Erdős problem 932
Let denote the th prime. For infinitely many there are at least two integers all of whose prime factors are .
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:05e4de89a67a72f88bbf5d2a060046d2a3430afc20a49015ec19bc1ad1b6cefa
- Metadata
- sha256:50883eadc26535f2555c1903eaad2bfd8a179114ead9659569c058b993f0f5ff
- Observation
- sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
- Content
- sha256:ff6333400c295117ba5865bb932b4635c57682c3dc2fa79767a573a71c2dae39
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
- Source commit
- 36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb