{"id":"three-divisors-quarter-root-complexity","text":"The primality check in `isThreeDivisors` runs trial division on `sqrt(n)` up to `isqrt(sqrt(n))`, giving O(n^(1/4)) overall time — faster than the O(√n) brute-force divisor count.","truth_value":"IN","source":"entries/2026/06/06/three-divisors-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"three-divisors-quarter-root-complexity","truth_value":"IN","reason":"premise"}]}}