Erdős problem 536
Let and be sufficiently large. Is it true that if has size at least then there must be distinct such that where denotes the least common multiple?
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:61faeca3445138dff08a7d56cc82e70a3877b582dc4438602de29b99848fe51f
- Metadata
- sha256:797f0ff57936b44f5ce6390033d818c0bf7b690832f13ad7aa622edbe8083913
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:ff2710ab917cf07aa6419b628f04b526544df52d8db09fdfffcf279fdbbeee8e
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb