Number theory
Date added
Erdos388.erdos_388.variants.classification.
$926 bounty
Nobody has attempted this. A complete proof or refutation takes the whole bounty.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«388»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos388.erdos_388" := by
sorry
end Bounty
Original conjecture (Lean type)
{(m₁, k₁, m₂, k₂) |
3 < k₁ ∧ 3 < k₂ ∧ m₁ + k₁ ≤ m₂ ∧ ∏ i ∈ Finset.Icc 1 k₁, (m₁ + i) = ∏ j ∈ Finset.Icc 1 k₂, (m₂ + j)}.FiniteOriginal conjecture source: FormalConjectures/ErdosProblems/388.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.