frontiers / 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

used by 0 · replayed by 2 producers

e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null

Source record

back to sources

cap_61973ee16b553d57 · vc_4a2405c379500e41

id: vs_86643f2561fea76a
frontier: Erdős problems frontier
type: synthetic_report

source boundary

frontier-owned

synthetic

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

2 reviewable changes and 0 evaluations are attached through this source or its findings.

citation

external source

locator

title:cap_61973ee16b553d57 · vc_4a2405c379500e41

imported

2026-05-30T00:42:06.826507+00:00

extraction mode

artifact_to_state_import

authors

Erdős Open-Problem spine ingest

caveats

source requires human review before being treated as evidence

Bound findings

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.
open_question · vf_9b39406ea761804f

Evidence atoms

vea_8fbb03f2a4bf0d03computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_4a2405c379500e41"}

Review, event, and evaluation records

events

vev_4d2e172c03e063b7finding.asserted
Candidate claim vc_4a2405c379500e41 imported from artifact packet cap_61973ee16b553d57
reviewer:erdos-db-trust · 2026-05-30

reviewable changes

vpr_64f202fc6795cb72finding.add
Candidate claim vc_4a2405c379500e41 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_69879990bac817fbfinding.note
SEMANTIC-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.