Odd prime-factor parity in Green’s Problem 64

Are there infinitely many primes p for which p−2p - 2 has an odd number of prime factors, counting multiplicity? For example, 7 qualifies because 7 − 2 is prime, while 11 does not because 11−2=3×311 - 2 = 3 \times 3.

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

  1. 2026 · Problem statement [4]

    Ben Green Asked whether the shift by two of infinitely many primes has an odd number of prime factors.

  2. 12 Nov 2026 · Proof and checking [1][2]

    Igor Inozemtsev with GPT-6 Astra Gave a proof using a parity weight, correlation estimates and a weighted sieve.

AI contribution

Sources

  1. Igor Inozemtsev’s proof of Green’s Problem 64
  2. Verified statements and checking scope
  3. Sources and attribution
  4. Ben Green, 100 Open Problems, Problem 64
Publication history