Representation of Even Integers as Sums of Squares of Primes and Powers of 2
โ Scribed by Jianya Liu; Ming-Chit Liu
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 185 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
We prove that the density of integers -2 (mod 24), which can be represented as the sum of two squares of primes and k powers of 4, tends to 1 as k Q . in the sequence k -0 (mod 3). Consequently, there exists a positive integer k 0 such that every large integer -4 (mod 24) is the sum of four squares
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)