qedbot

Green's open problems·green:64

Green's Open Problem 64

conjecture formal record: open F2 declared

Machine-checked by Palomar.

Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

Source

AI activity

How grades work

No AI contribution recorded against this statement.

F2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

declares divergences from its source reviewed by an agent source authors not contacted

Checks

1
  • verified·Palomar

    Registered by Palomar at 43f0988e: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel

    project registered at a pinned commit·2026-11-15·commit 43f0988e15c2

    PALOMAR-2026-11-13-000010

Declared by the projects

1

As each project's formalization.yaml states it.

Primes p for which Ω(p − 2) is odd (Green's Problem 64)inozemtsev/formal-math/proofs/green64 · joined by anchor · Palomar

Read formalization.yaml

authors
Igor Inozemtsev
method
agent — gpt-6 astra
review
agent-reviewed
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
sources
100 Open Problems, Problem 64 — formalizes, authors not-contacted; Shifted primes with a prescribed parity of the number of prime factors — adapts, authors not-contacted; Prime Predecessors with an Even Number of Prime Factors — adapts, authors not-contacted; Weighted dilation graphs, smooth shifted primes and totient fibers — adapts, authors not-contacted
divergences
The main proposition is the fixed-shift question stated as an affirmative infinitude theorem. It has no extra hypotheses. A supporting witness lemma makes unboundedness and positivity explicit. Omega counts multiplicities, so p = 11 does not qualify, since Omega(9) = 2.
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 0

No proof artifact cited by the formal record.

Also known as · 2
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/GreensOpenProblems/64.lean
  • FormalConjectures/GreensOpenProblems/64.lean

Cite this record

qed.bot, “Green's Open Problem 64”, https://qed.bot/s/green-64, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.