On a Sum of Three Prime Squares
โ Scribed by Claus Bauer; Ming-Chit Liu; Tao Zhan
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 174 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We show that almost every natural number M is the sum of four squares with all their prime factors smaller than exp(20(log M log log M) 1ร2 ).
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.
This paper completes the determination of all integers of the form pqr (where p, q, and r are distinct primes) for which there exists a vertex-transitive graph on pqr vertices which is not a Cayley graph.