Status: IN
`isThreeDivisors` encodes the number-theory result that τ(n)=3 iff n=p² for prime p, reducing a divisor-counting problem to a perfect-square check followed by a primality test on the root.
Source: entries/2026/06/06/three-divisors-solution.md
JSON