Erdős problem 1108For each k≥2k \geq 2, does the set A={∑n∈Sn!:S⊂N 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?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 11083 retained source recordsCanvaspublic previewSource#1108→ResultNone→Checks0