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_3a6381c022329db6"}
- id
- vea_8a17eb23d3973adf
- frontier
- Erdős problems frontier
- source
- vs_8d613afdbb832fa8
- finding
- vf_f16fcdca9d3a5803
finding binding
boundopen_question
Erdős Problem #412 remains OPEN. Statement: Let $σ_1(n)=σ(n)$, the sum of divisors function, and $σ_k(n) = σ(σ_{k-1}(n))$. Is it true that, for every $m, n ≥ 2$, there exist some $i, j$ such that $σ_i(m) = σ_j(n)$? Topics: number theory, iterated functions. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A007497, A051572.
source binding
source-boundcap_61973ee16b553d57 · vc_3a6381c022329db6
vs_8d613afdbb832fa8
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_3a6381c022329db6"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_5d1d65d2ef78a526
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_929a1b7cf88f9845finding.assertedCandidate claim vc_3a6381c022329db6 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_b9aa405914549310finding.addCandidate claim vc_3a6381c022329db6 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.