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_496c7893951d83ce

id: vs_7ebbdf1af120b173
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_496c7893951d83ce

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 #377 remains OPEN. Statement: Is there some absolute constant $C > 0$ such that $$ \sum_{p \leq n} 1_{p\nmid {2n \choose n}}\frac{1}{p} \leq C $$ for all $n$? Topics: number theory, binomial coefficients. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: N/A.
open_question · vf_507e61fe107d57bb

Evidence atoms

vea_1d5b7f108423ad90computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_496c7893951d83ce"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_36b3ed86fed3faa4finding.add
Candidate claim vc_496c7893951d83ce imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_e0d738cd8b7ad2b3finding.note
SEMANTIC-EDGE DRAFT -> Erdos #376 (vf_359c6e30cd652e65) [related, confidence 0.78]: 377 (reciprocal sum over primes not dividing the central binomial coefficient) and 376 (n with C(2n,n) coprime to 105) both concern the set of primes missing from C(2n,n)'s factorization. -- 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.