Erdős problem 890
A question of Erdős and Selfridge [ErSe67], who observe that for every . This follows from Pólya's theorem that the set of -smooth integers has unbounded gaps - indeed, is divisible by all primes and, provided is large, all but at most one of has a prime factor by Pólya's theorem.
How the state got here
0 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingNothing recorded here
- Next gapNot recorded
Result history
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 details
Exact provenance
- Problem row
- sha256:7d54533d783a5ca33d6e7873a2fea6d3b40f16908a6c291d45b7bcbd867c7e2e
- Metadata
- sha256:4bc9745fa9fdb6b4dd124c6bbf1a1b164e977c7054ff379ade6073e0bd38a5c7
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:298bae08a221f19efb5f350da917b1972d797ab85b27f82c9615ec245fcba9ca
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb