Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
gptkb:discrepancy_theory
sequences of +1 and -1 |
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:formedBy |
gptkb:Paul_Erdős
1930s |
| gptkbp:namedAfter |
gptkb:Paul_Erdős
|
| gptkbp:relatedTo |
gptkb:combinatorics
combinatorial number theory multiplicative functions |
| gptkbp:solutionPublishedIn |
gptkb:Discrete_Analysis
|
| gptkbp:solvedBy |
gptkb:Terence_Tao
|
| gptkbp:solvedInYear |
2015
|
| gptkbp:type |
Is the discrepancy of every infinite ±1 sequence unbounded?
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős discrepancy problem
|