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_f799999e18bc6780

id: vs_9b1f50141c522946
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

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

citation

external source

locator

title:cap_61973ee16b553d57 · vc_f799999e18bc6780

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 #373 remains OPEN. Statement: Show that the equation `n!=a_1!a_2!···a_k!`, with `n−1 > a_1 ≥ a_2 ≥ ··· ≥ a_k`, has only finitely many solutions. Topics: number theory, factorials. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A003135.
open_question · vf_ff17e9912e2bd1f3

Evidence atoms

vea_883e873a3110d999computational · supports
{"artifact_id":"va_9bc926d75e4e3881","artifact_packet_id":"cap_61973ee16b553d57","candidate_claim_id":"vc_f799999e18bc6780"}

Review, event, and evaluation records

events

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

reviewable changes

vpr_58de5983c47a108efinding.add
Candidate claim vc_f799999e18bc6780 imported from artifact packet cap_61973ee16b553d57
applied · agent:erdos-spine-ingest · 2026-05-30
vpr_a9e03e2615d94e5ffinding.note
SEMANTIC-EDGE DRAFT -> Erdos #398 (vf_484ed714dba000f6) [related, confidence 0.55]: Both are Diophantine equations in factorials (373: n!=a_1!...a_k!; 398: Brocard's n!+1=m^2), studied with the same prime-factorization-of-n! tools, but neither reduces to the other. -- 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_bf0865814e4c9d95finding.note
SEMANTIC-EDGE DRAFT -> Erdos #390 (vf_ddf9a0caad805397) [related, confidence 0.6]: Both concern representing n! as a product of other factors: 373 as a product of smaller factorials and 390 as a product of distinct integers exceeding n, the same multiplicative-decomposition-of-n! theme. -- 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.