Status: IN
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.
Source: entries/2026/06/06/three-divisors-solution.md
JSON