Erdős problem 1000
Let be an infinite sequence of integers, and let count the number of such that the fraction does not have denominator for when written in lowest form; equivalently, for all .
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:5c0187de4ea245dade00ab0cedc0c4c31917dcf193d2ce9c61859ca78067711c
- Metadata
- sha256:206d89891e8f94e9424aef137581dcd61fd244e66cd3924cbcbedb0d40959f7b
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:74b94bde42b1c18ff7732dc7bbbff3de043dd84a988e92fc40d0581f0cbc10e2
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb