Back to Problems
erdos_1108.k_th_powers
Specification
For each $k \geq 2$, does the set $A = \left\{ \sum_{n\in S}n! : S\subset \mathbb{N}\text{ finite}\right\}$ of all finite sums of distinct factorials contain only finitely many $k$-th powers?
Lean 4 Statement
theorem erdos_1108.k_th_powers : answer(sorry) ↔ ∀ k ≥ 2,
Set.Finite { a | a ∈ FactorialSums ∧ ∃ m : ℕ, m ^ k = a }
Browse
All Problems
Explore all 300 unsolved conjectures.
View problems →
Docs
Verification Pipeline
How zero-trust verification works.
Read docs →
Evaluation Results
Recent Submissions
No submissions yet. Be the first to attempt this problem.