Erdős problem 650
Let be such that if has then every interval in of length contains many distinct integers where each is divisible by some , where are distinct.
How the state got here
1 of 6 recorded- Prior stateNone retained
- WorkNo submitted work retained
- VerificationNo check retained
- DecisionNo Repository has decided
- StandingA Result stands 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:f0fa42be2dec6972a81c4bb6f51e60f8519b97eccbef7b172bfaec567064caa0
- Metadata
- sha256:663b2862b47a4afefa34554404fa350fca1deec7c6d3b61eaf2634aa1b892f8b
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:6c38c273248b961dc984097f9225f1130e2a30fb2c7b713956d54b36388db9bd
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb