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_aa156335a381d06a"}
- id
- vea_fc3e45335b4391b7
- frontier
- Erdős problems frontier
- source
- vs_bf476f04695768bd
- finding
- vf_268fcebae708a61c
finding binding
boundopen_question
Erdős Problem #479 remains OPEN. Statement: Is it true that, for all $k\neq 1$, there are infinitely many $n$ such that $2^n\equiv k\pmod{n}$? Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A036236, A015919, A050259, A015921, A006521, A006517, A015940.
source binding
source-boundcap_61973ee16b553d57 · vc_aa156335a381d06a
vs_bf476f04695768bd
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_aa156335a381d06a"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_0f907e940249c513
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_c8f9eb7d8781aed8finding.assertedCandidate claim vc_aa156335a381d06a imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_bd01c3492584eef6finding.addCandidate claim vc_aa156335a381d06a imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.