Skip to content

Erdős problem 1108

Start work

For 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?

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it575 share a topic
Number Theory576Factorials21
Erdős problem 321accepted
Carrying a Standing. Browse the topic.
Start workOpen sources