Field theory and polynomials
WithdrawnDate added
Withdrawn 19 Aug 2026
WITHDRAWN (removed from the active solver pool by maintainer request)
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«477»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos477.erdos_477.variants.monomial" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (k : ℕ),
2 ≤ k → ∀ (A : Set ℤ), ∃ z, ¬∃! a, (a ∈ A ×ˢ Set.range fun x => Polynomial.eval x (Polynomial.X ^ k)) ∧ z = a.1 + a.2Original conjecture source: FormalConjectures/ErdosProblems/477.lean
The audit patch changes this file, so the upstream version can differ from the statement above.
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.