Skip to content

Erdős problem 1108

For each k2k \geq 2, does the set A={nSn!:SN finite}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 kk-th powers?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/1108.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1108.leanErdos1108.erdos_1108.parts.i1 lineExact file
True ↔ ∀ k ≥ 2, {a | aErdos1108.FactorialSums ∧ ∃ m, m ^ k = a}.Finite
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page