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_00d9aaf421adeacf"}
- id
- vea_c8d7b1cc80fbe53c
- frontier
- Erdős problems frontier
- source
- vs_b91dda0c3d2027e8
- finding
- vf_7d46d436d8c31259
finding binding
boundopen_question
Erdős Problem #371 remains OPEN. Statement: Let $P(n)$ denote the largest prime factor of $n$. Show that the set of $n$ with $P(n+1) > P(n)$ has density $\frac{1}{2}$. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A070089.
source binding
source-boundcap_61973ee16b553d57 · vc_00d9aaf421adeacf
vs_b91dda0c3d2027e8
review context
unverified1 events
1 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_00d9aaf421adeacf"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_962fd3c6a87f54b4
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_9e6c513efcf9fda0finding.assertedCandidate claim vc_00d9aaf421adeacf imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_013b92282e6e8c40finding.addCandidate claim vc_00d9aaf421adeacf imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.