Number theory
Date added
n!=a_1!a_2!···a_k!, with n−1 > a_1 ≥ a_2 ≥ ··· ≥ a_k, has
only finitely many solutions.
$5,408 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-373Command line, then a pull request on GitHub.
1 piece · 16 lemmas
2 Sept 2026
Erdős 373: finiteness of S reduces to a bound on n; Legendre length bound, Bertrand obstruction
5FqLp5…FfZZiK · 16 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos373-erdos-373-f430c70aef38f9b144563814-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-373 →
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«373»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos373.erdos_373" := by
sorry
end Bounty
Original conjecture (Lean type)
Erdos373.S.FiniteOriginal conjecture source: FormalConjectures/ErdosProblems/373.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.