evidence boundary
supportsfrontiers / frontier
Erdős problems frontier
- id
- vfr_37aec80d874a0239
- license
- CC-BY-4.0
- findings
- 1,256
- accepted core
- 6
- contested
- 0
- links
- 17
- sources
- 1,234
- evidence
- 1,256
- avg conf
- 0.98
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_01fd84c405b62992"}
- id
- vea_8656ea489ee694cd
- frontier
- Erdős problems frontier
- source
- vs_db18cadbc679ebd1
- finding
- vf_1b02c9b209dd10a3
finding binding
boundopen_question
Erdős Problem #647 has status 'verifiable'. Statement: Let $\tau(n)$ count the number of divisors of $n$. Is there some $n > 24$ such that $$ \max_{m < n}(m + \tau(m)) \leq n + 2? $$ Topics: number theory. Erdős prize: £25. Statement is machine-verified in Lean (formal-conjectures). OEIS: A062249, A087280.
source binding
source-boundcap_61973ee16b553d57 · vc_01fd84c405b62992
vs_db18cadbc679ebd1
review context
unverified2 events
2 reviewable changes and 0 evaluation records target this atom or its bound objects.
statement
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_01fd84c405b62992"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_521d37223686a771
caveats
No caveats recorded.
Review, event, and evaluation records
4events
vev_eaab443b043adf00finding.notedExternal corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #647 (listed in erdos_problems_attempted.txt of google-deepmind/alphaproof-nexus-results@0647711a7118) and did not solve it (9 of 242 attempted Erdős problems solved). Their Lean formalization of the statement lives in google-deepmind/formal-conjectures. Treat as evidence the open obligations here are genuine, not low-hanging.
reviewer:will-blair · 2026-06-10
vev_f41d2a3879417d6cfinding.assertedCandidate claim vc_01fd84c405b62992 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_017ca8e9ad715bbdfinding.noteExternal corroboration of frontier difficulty: AlphaProof Nexus (DeepMind, arXiv 2605.22763, May 2026) attempted Erdős #647 (listed in erdos_problems_attempted.txt of google-deepmind/alphaproof-nexus-results@0647711a7118) and did not solve it (9 of 242 attempted Erdős problems solved). Their Lean formalization of the statement lives in google-deepmind/formal-conjectures. Treat as evidence the open obligations here are genuine, not low-hanging.
applied · agent:nexus-ingest-2026-06-10 · 2026-06-10
vpr_8d2ae94674908decfinding.addCandidate claim vc_01fd84c405b62992 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.