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_d233f8360eabdf91"}
- id
- vea_52e334274178e6ae
- frontier
- Erdős problems frontier
- source
- vs_49ee0586f3fec0ae
- finding
- vf_adb1652aa188bae4
finding binding
boundopen_question
Erdős Problem #1142 remains OPEN. Statement: Are there infinitely many $n > 2$ such that $n - 2^k$ is prime for all $k \geq 1$ with $2^k < n$? The only known such $n$ are $4, 7, 15, 21, 45, 75, 105$ (OEIS [A039669](https://oeis.org/A039669)). Topics: number theory, primes. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A039669.
source binding
source-boundcap_61973ee16b553d57 · vc_d233f8360eabdf91
vs_49ee0586f3fec0ae
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_d233f8360eabdf91"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_50696e496dee574d
caveats
No caveats recorded.
Review, event, and evaluation records
2events
vev_20ef529c2ea36b90finding.assertedCandidate claim vc_d233f8360eabdf91 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_434ac0c62953107dfinding.addCandidate claim vc_d233f8360eabdf91 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
evaluations
No evaluation rows are attached.