Odd prime-factor parity in Green’s Problem 64
Are there infinitely many primes p for which has an odd number of prime factors, counting multiplicity? For example, 7 qualifies because 7 − 2 is prime, while 11 does not because .
Why it matters and what counts as progress
Why it matters: The question asks a sieve to detect the parity of the number of prime factors. Many standard sieve estimates cannot distinguish the two parities.
What counts as progress: A proof must produce a qualifying prime above every bound. Quantitative estimates and analogous theorems for other shifts go beyond this question.
How the problem developed
AI contribution
Odd prime-factor parity in shifted primes: A proof of Green’s Problem 64
Inozemtsev proves that infinitely many primes p have an odd number of prime factors in , counted with multiplicity.
Sources
Publication history
Odd prime-factor parity in shifted primes: A proof of Green’s Problem 64
Daily emails by default, only when there’s an update.