Odd prime-factor parity in shifted primes: A proof of Green’s Problem 64

Igor Inozemtsev

Inozemtsev proves that infinitely many primes p have an odd number of prime factors in p−2p - 2, counted with multiplicity.

What was already known

Ben Green posed the fixed-shift question. The proof adapts a parity weight and correlation method from OpenAI manuscripts and follows the specialization in Jizhou Guo’s manuscript.

AI involvement AI-led

The paper credits GPT-6 Astra with proof development and formalization. It distinguishes the OpenAI source arguments and Guo’s exposition, which the agent used to guide the final specialization.

Importance Notable

The proof settles Green’s fixed-shift infinitude question.

Technical verification Formal (Lean 4)

The project reports a fresh build, comparison of both submitted statements and replay with Lean, NanoDa and con-ron.

Formal checking

The project reports a fresh build, comparison of both submitted statements and replay with Lean, NanoDa and con-ron.

Checker
Project’s protected Palomar verification workflow
Scope
Compared and checked the infinitude and unbounded-prime statements against the exported proof, with standard Lean axioms.
Basis
Reported by the linked checker

Human understanding Few

The manuscript gives a detailed proof. Its provenance credits the proof development to Astra and does not identify a human account of the central correlation estimate.

Correction and publication history