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_0f43e18649ced858

id: vs_187087d33a78fed3
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_0f43e18649ced858

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 #387 remains OPEN. Statement: Is there an absolute constant `c > 0` such that, for all `1 ≤ k < n`, the binomial coefficient `n.choose k` has a divisor in `(cn, n]`? Topics: number theory, binomial coefficients. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
open_question · vf_b3b3b5863382d573

Evidence atoms

vea_c01e807d8fd75a8ecomputational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_0f43e18649ced858"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_1d3ae11df599b1ccfinding.add
Candidate claim vc_0f43e18649ced858 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_5685839bea1d2a0afinding.note
SEMANTIC-EDGE DRAFT -> Erdos #396 (vf_6514a3669c0d3857) [shares_technique, confidence 0.55]: Both attack the divisor structure of binomial coefficients via prime-power valuations from Kummer's theorem (387: existence of a divisor in (cn,n]; 396: a falling product dividing the central coefficient). -- 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.