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

Erdos, Ginzburg, Ziv 1961, Bull. Research Council Israel

id: vs_9324a9c5bd493a09
frontier: Erdős problems frontier
year: 1961
type: paper

source boundary

frontier-owned

declared

finding bindings

record context

1 findings

evidence atoms

materialized

1 atoms

review context

inspectable

1 events

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

citation

locator

title:Erdos, Ginzburg, Ziv 1961, Bull. Research Council Israel

imported

2026-05-10T19:27:57.576903+00:00

extraction mode

manual_curation

authors

agent:vela-curation-bot

caveats

No caveats recorded.

Bound findings

Erdos-Ginzburg-Ziv theorem (1961, solved): among any 2n-1 integers, there exist n whose sum is divisible by n. Tight: 2n-2 integers may admit no such subset.
theoretical · vf_e9e8b34f2a6a7b1d

Evidence atoms

vea_0855e0fc314547f6theoretical · unknown
Erdos-Ginzburg-Ziv theorem (1961, solved): among any 2n-1 integers, there exist n whose sum is divisible by n. Tight: 2n-2 integers may admit no such subset.

Review, event, and evaluation records

events

vev_2e5bce2042a57539finding.asserted
Manual finding added to frontier state
reviewer:will-blair · 2026-05-10

reviewable changes

vpr_933b01bcb2066d02finding.add
Manual finding added to frontier state
applied · agent:vela-curation-bot · 2026-05-10

evaluations

No evaluation rows are attached.