Delphi.science

Green's Problem 64: odd prime-factor parity in shifted primes

Source: github.com/inozemtsev/formal-math/tree/e0de90b2eff7e44d20b4…

Igor Inozemtsev

Palomar Registrypalomar/PALOMAR-2026-11-13-000010Nov 13, 2026math.NTscore 0

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.

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-13-000010
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000010/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000010/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'