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?

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:dae27589074872cd1263cde90f12574a4c86eb5f13fefd95ace1f915fed50560
Metadata
sha256:9f76bef22f70bd74d6ad65d19aa8389803aed9227d5716092caa44c89c0ba095
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:b4fccd7bd5a467cadfa752290c1b6f2580b1405a532a73ac500073799fe0e76d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page