Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
finite abelian groups
|
| gptkbp:field |
number theory
additive combinatorics |
| gptkbp:generalizes |
gptkb:Cauchy–Davenport_theorem
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Abraham_Ginzburg gptkb:Abraham_Ziv |
| gptkbp:publishedIn |
gptkb:Bulletin_of_the_Research_Council_of_Israel
|
| gptkbp:relatedConcept |
combinatorial number theory
zero-sum problem |
| gptkbp:sentence |
Every set of 2n-1 integers contains a subset of n integers whose sum is divisible by n.
|
| gptkbp:yearProved |
1961
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Ginzburg–Ziv theorem
|