Combinatorics
Date added
$991 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«345»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos345.erdos_345" := by
sorry
end Bounty
Original conjecture (Lean type)
{k |
0 < k ∧
∃ a b,
IsLeast (IsAddComplete.thresholds (Erdos345.kthPowers k)) a ∧
IsLeast (IsAddComplete.thresholds (Erdos345.kthPowers (k + 1))) b ∧ b < a}.InfiniteOriginal conjecture source: FormalConjectures/ErdosProblems/345.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.