Number theory
WithdrawnWithdrawn 6 Oct 2026
OWNER_ACCEPTED_PUBLICATION_CLOSURE (closed on the release owner's instruction of 2026-10-06T23:17:23Z to accept the public resolution claim in OpenAI math corpus family 020, commit adc7f1241b42e322a6451854ab7e4b4c146bf78a, first public 2026-10-06T21:58:50Z. Owner-directed acceptance: no independent proof replay or certification was performed. See OWNER-ACCEPTED-CLOSURES-2026-10-06.md.)
nobody has started
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«978»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos978.erdos_978.parts.ii" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ {f : Polynomial ℤ},
Irreducible f →
f.natDegree > 3 →
(¬∃ l, f.natDegree = 2 ^ l) →
0 < f.leadingCoeff →
(∀ (p : ℕ), Nat.Prime p → ∃ n, ¬↑p ^ (f.natDegree - 2) ∣ Polynomial.eval (↑n) f) →
{n | Powerfree (f.natDegree - 2) (Polynomial.eval (↑n) f)}.InfiniteOriginal conjecture source: FormalConjectures/ErdosProblems/978.lean
References
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.
Individual lemmas, special cases and supporting work, shown in their original scope.
Nothing has been published against this problem yet.