Erdős problem 458
Let denote the least common multiple of . Let be the -th prime. Is it true that for all , ?
Erdős Problems records this as falsifiable.
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal1 retained
- Resolutionfalsifiable
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingWork
Nothing here has checked that finding.
Reproducing it here turns a report into evidence.
Where the source files it579 share a topic
Erdős problem 321acceptedCarrying a Standing. Browse the topic.