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?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#1108
  2. ResultNone
  3. Checks0

Search problems.science

Find a Problem, Result, source, or page