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_4a2405c379500e41"}
- id
- vea_8fbb03f2a4bf0d03
- frontier
- Erdős problems frontier
- source
- vs_86643f2561fea76a
- finding
- vf_9b39406ea761804f
finding binding
boundopen_question
Erdős Problem #123 remains OPEN. Statement: **Erdős Problem #123** Let $a, b, c$ be three integers which are pairwise coprime. Is every large integer the sum of distinct integers of the form $a^k b^l c^m$ ($k, l, m ≥ 0$), none of which divide any other? Equivalently: is the set $\{a^k b^l c^m : k, l, m \geq 0\}$ d-complete? Note: For this not to reduce to the two-integer case, we need the integers to be greater than one and distinct. Topics: number theory. Erdős prize: $250. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
source binding
source-boundcap_61973ee16b553d57 · vc_4a2405c379500e41
vs_86643f2561fea76a
review context
unverified1 events
2 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_4a2405c379500e41"}
locator
span:0
extraction method
artifact_to_state_import
support relation
supports
condition refs
vcnd_0fb0a40c88ee9276
caveats
No caveats recorded.
Review, event, and evaluation records
3events
vev_4d2e172c03e063b7finding.assertedCandidate claim vc_4a2405c379500e41 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30
reviewable changes
vpr_64f202fc6795cb72finding.addCandidate claim vc_4a2405c379500e41 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_69879990bac817fbfinding.noteSEMANTIC-EDGE DRAFT -> Erdos #32 (vf_2de03f410f195cdc) [related, confidence 0.55]: Both are additive-completeness problems asking that every sufficiently large integer be represented as a sum from a set (distinct elements in 123, p+a complements to primes in 32). -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
pending_review · agent:semantic-edge-extractor · 2026-06-10
evaluations
No evaluation rows are attached.