Number theory
$5,144 bountynobody has started
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Even one lemma helps. Whoever finishes this later shares the pool with everyone who got them there.
contrib new erdos-317-variants-claim2Command line, then a pull request on GitHub.
Nothing has been published against this problem yet.
A first lemma is worth as much as a last one: whoever closes the problem shares the pool with everyone who got them there.
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
pool/tier-1/erdos-317-variants-claim2-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-317-variants-claim2 →
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«317»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos317.erdos_317.variants.claim2" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ᶠ (n : ℕ) in Filter.atTop,
∀ (δ : Fin n → ℚ),
δ '' Set.univ ⊆ {-1, 0, 1} → |∑ k, δ k / (↑↑k + 1)| ≠ 0 → |∑ k, δ k / (↑↑k + 1)| > 1 / ↑((Finset.Icc 1 n).lcm id)Original conjecture source: FormalConjectures/ErdosProblems/317.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.