As an extension of the Linnik Gallagher results on the ``almost Goldbach'' problem, we prove that every large even integer is a sum of four squares of primes and 8330 powers of 2.
โฆ LIBER โฆ
Representations of Integers as Sums of Squares
โ Scribed by Ken Ono
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 92 KB
- Volume
- 95
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Representation of Even Integers as Sums
โ
Jianya Liu; Ming-Chit Liu
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 185 KB
On the Number of Integers Representable
โ
Hisashi Yokota
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 176 KB
Let Nรฐnร be the set of all integers that can be expressed as a sum of reciprocals of distinct integers 4n: Then we prove that for sufficiently large n; which improves the lower bound given by Croot. # 2002 Elsevier Science (USA)
On Number of Integers Representable as a
โ
Hisashi Yokota
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 262 KB
The Largest Integer Expressible as a Sum
โ
Hisashi Yokota
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 113 KB
Density properties of primes, squares, a
โ
George B Thomas Jr.
๐
Article
๐
1973
๐
Elsevier Science
๐
English
โ 148 KB
Sums of squares and expected mean square
โ
Michael F. Driscoll; Connie M. Borror
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 108 KB
The four different types of sums of squares available in SAS are considered, and a broad overview is given of how the similarities and dissimilarities between them depend upon the structure of the data being analyzed (for example, on the presence of empty cells). The fixed-effect hypotheses tested b