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_7bdd021a926c5bcd

id: vs_e10cf9130a5aee2d
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_7bdd021a926c5bcd

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 #389 remains OPEN. Statement: Is it true that for every $n \geq 1$ there is a $k$ such that $$ n(n + 1) \cdots (n + k - 1) \mid (n + k) \cdots (n + 2k - 1)? $$ Topics: number theory. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A375071.
open_question · vf_8a36bcd1cf62278f

Evidence atoms

vea_bd2d6dfc75e6127fcomputational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_7bdd021a926c5bcd"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_745fcb0294ee8238finding.note
SEMANTIC-EDGE DRAFT -> Erdos #394 (vf_73cd34a5624f795b) [related, confidence 0.62]: Both study divisibility by blocks of consecutive integers: 389 asks when a length-k consecutive product divides the next block, and 394 defines the least m so n divides a length-k consecutive product, sharing the consecutive-product divisibility machinery. -- 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
vpr_d7ebf4ffca6ab2a7finding.add
Candidate claim vc_7bdd021a926c5bcd imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30

evaluations

No evaluation rows are attached.