Number theory
$4,969 bounty1 piece from 1 personlast one last month
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 finishes the problem, the pool splits between everyone whose work led there.
contrib new erdos-829Command line, then a pull request on GitHub.
1 piece · 40 lemmas
3 Sept 2026
Erdős 829: discriminant and primitive-factor filters for two-cube representations
5FqLp5…FfZZiK · 40 lemmas
Formal statement
Proof target
import FormalConjectures.ErdosProblems.«829»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos829.erdos_829" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∃ C, (fun n => ↑(AdditiveCombinatorics.sumRep Erdos829.cubes n)) =O[Filter.atTop] fun n => Real.log ↑n ^ COriginal conjecture source: FormalConjectures/ErdosProblems/829.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.