Status: IN
`is_prime` in prime-arrangements checks divisors only up to `int(k**0.5) + 1`, making it O(sqrt(k)) per call — sufficient for the n<=100 constraint but would need a sieve for larger inputs.
Source: entries/2026/06/06/prime-arrangements-solution.md
JSON