Erdős problem 887
Is there an absolute constant such that, for every , if is sufficiently large then has at most divisors in .
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:b7751274d3496049a00a81e9a2b734c7ad0dda2dcf62838666b751842b35c090
- Metadata
- sha256:1f1f8d783521e857f5f69d133c8dfbb851fcf9e236b36d9b16abe923641a0f2e
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:8ae5ccd492573a8b21cc9278213c08521a2f11142794fac4ab22f0c315d0c29c
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207
Source review
Native pull-request state, mechanical checks, semantic findings, and artifact availability are separate source facts. None is a Vela Verification, Decision, or change to Math Standing.
Formal Conjectures PR #1237
FormalConjectures/ErdosProblems/887.lean
PR mergedreview approvedsource audit: needs revision
failsemantic
answer slot scope fidelity
At exact PR 1237 head 28860856/blob 6feb58b9, the docstring asks for one absolute K, but answer(sorry) occurs under the C and n binders.
passmechanical
lean build
The exact PR head completed the repository Build project job successfully.
Read-only projection