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
e1288/1288 · statement.registered · agent:claude-proxy · 2026-06-10 · null→null
Evidence atom
back to sources{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_1dc0d8a036c19db9"}
- id
- vea_0e0424f1356e6718
- frontier
- Erdős problems frontier
- source
- vs_289cb5597b0698ea
- finding
- vf_8847971758e968de
finding binding
boundopen_question
Erdős Problem #370 has status 'proved (lean)'. Statement: Are there infinitely many $n$ such that the largest prime factor of $n$ is $< n^{\frac{1}{2}}$ and the largest prime factor of $n + 1$ is $< (n + 1)^{\frac{1}{2}}$. Steinerberger has pointed out this problem has a trivial solution. This was formalized in Lean by Alexeev using Aristotle. Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_1dc0d8a036c19db9
vs_289cb5597b0698ea
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_1dc0d8a036c19db9"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_4f810dfb6b127d1a
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_3e59ae36bcd421bbfinding.assertedCandidate claim vc_1dc0d8a036c19db9 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_1287893c93afe29bfinding.addCandidate claim vc_1dc0d8a036c19db9 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.