Number theory
Date added
$5,226 bounty1 piece from 1 personlast one 2 months ago
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
A lemma, a definition, a special case. There is no race: when someone closes the problem, up to half of its bounty can go to the recognised pieces that led there.
contrib new erdos-242-variants-schinzel-generalizationCommand line, then a pull request on GitHub.
1 piece · 12 lemmas
3 Sept 2026
Schinzel: complete positive numerators below 4 and a multiples family for every numerator
5FqLp5…FfZZiK · 12 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-variants-schinzel-generalization-4ccbc080b2625fbeadfbab9a-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-242-variants-schinzel-generalization →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«242»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos242.erdos_242.variants.schinzel_generalization" := by
sorry
end Bounty
Original conjecture (Lean type)
∀ (a : ℕ), 0 < a → ∀ᶠ (n : ℕ) in Filter.atTop, ∃ x y z, 1 ≤ x ∧ x < y ∧ y < z ∧ ↑a / ↑n = 1 / ↑x + 1 / ↑y + 1 / ↑zOriginal conjecture source: FormalConjectures/ErdosProblems/242.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.