{"id":"is-prime-covers-0-to-20","text":"`is_prime` uses a hardcoded set `{2,3,5,7,11,13,17,19}` that is correct for all integers 0–20, sufficient for inputs up to `2^20 - 1` (the problem's upper bound); extending beyond 20-bit inputs would require adding primes up to the new bit width","truth_value":"IN","source":"entries/2026/06/06/prime-number-of-set-bits-in-binary-representation-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"is-prime-covers-0-to-20","truth_value":"IN","reason":"premise"}]}}