{"id":"three-divisors-perfect-square-prime","text":"`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.","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-perfect-square-prime","truth_value":"IN","reason":"premise"}]}}