The present author now shows that (1) holds with equality for almost all n. The methods of proof are typically Erdös. The generalisation to the case where each al can be written as the sum of at most r(\geq 2) preceding members of the sequence is briefly dealt with, and similar results are stated.
Classif.: * 11B75 Combinatorial number theory
11B83 Special sequences of integers and polynomials
Citations: Zbl 092.046
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag
|Books||Problems||Set Theory||Combinatorics||Extremal Probl/Ramsey Th.|
|Graph Theory||Add.Number Theory||Mult.Number Theory||Analysis||Geometry|
|Probabability||Personalia||About Paul Erdös||Publication Year||Home Page|