{"id":"palomar/PALOMAR-2026-11-13-000010","url":"https://github.com/inozemtsev/formal-math/tree/e0de90b2eff7e44d20b481340af58015506c5386/proofs/green64","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000010-v1.json","repo":"https://github.com/inozemtsev/formal-math","tags":["math.NT","msc:11N36","msc:11N05"],"score":0,"title":"Green's Problem 64: odd prime-factor parity in shifted primes","trust":"high","domain":"math.NT","source":"palomar","authors":["Igor Inozemtsev"],"reviews":0,"subject":"math.NT","summary":"There are infinitely many primes p for which p - 2 has an odd number of prime factors, counted with multiplicity. A second theorem gives such a prime above every natural bound and explicitly records p - 2 > 0. Both statements have no additional hypotheses. The standalone Lean development includes its supporting analytic number theory and uses Mathlib as its only direct Lake dependency.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-13","reactions":{},"formalized":true,"formalizes":[{"title":"100 Open Problems, Problem 64","identifier":"https://people.maths.ox.ac.uk/greenbj/papers/open-problems.pdf#problem.64","relationship":"formalizes"},{"title":"Shifted primes with a prescribed parity of the number of prime factors","identifier":"https://github.com/aster2024/openai-math-followups/blob/563cece082b628dfe3ba0290c9e4e30b92ffeca6/shifted-prime-parity/source/main.tex","relationship":"adapts"},{"title":"Prime Predecessors with an Even Number of Prime Factors","identifier":"https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/Prime-Predecessors-with-an-Even-Number-of-Prime-Factors-September-17-2026/build/main.tex","relationship":"adapts"}]}