{"id":"sqrt-divisor-enumeration-pattern","text":"`common_factors` enumerates divisors in O(sqrt(gcd(a,b))) by iterating only up to the square root and pairing each divisor `i` with `g // i`, with a guard against double-counting perfect squares","truth_value":"IN","source":"entries/2026/06/06/number-of-common-factors-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sqrt-divisor-enumeration-pattern","truth_value":"IN","reason":"premise"}]}}