Erdős problem 30
Is it true that, for every , h(N) )
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:72782efdb3c22f7e994530f3b9d727697d01b48f90ba5ae085d61eaabf6dcf2c
- Metadata
- sha256:72049746b807adbedd95a83f4e0054939f9c2fa63689312b968cc4faaea3e7b9
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:5089c1ee472461b8860710ed79b235b7f86f744bf716115e677aa8a683c64da3
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207