Sums of Two Squares in Short Intervals

2000 ◽  
Vol 52 (4) ◽  
pp. 673-694 ◽  
Author(s):  
Antal Balog ◽  
Trevor D. Wooley

AbstractLet denote the set of integers representable as a sum of two squares. Since can be described as the unsifted elements of a sieving process of positive dimension, it is to be expected that hasmany properties in common with the set of prime numbers. In this paper we exhibit “unexpected irregularities” in the distribution of sums of two squares in short intervals, a phenomenon analogous to that discovered by Maier, over a decade ago, in the distribution of prime numbers. To be precise, we show that there are infinitely many short intervals containing considerably more elements of than expected, and infinitely many intervals containing considerably fewer than expected.

2006 ◽  
Vol 79 (5-6) ◽  
pp. 848-853
Author(s):  
N. N. Mot’kina

Author(s):  
D. R. Heath-Brown

In this paper we shall investigate the occurrence of almost-primes in arithmetic progressions and in short intervals. These problems correspond to two well-known conjectures concerning prime numbers. The first conjecture is that, if (l, k) = 1, there exists a prime p satisfying


2013 ◽  
Vol 09 (07) ◽  
pp. 1687-1711 ◽  
Author(s):  
YOTAM SMILANSKY

In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the number of representable integers in short intervals is consistent with a Poisson distribution, where "short" means of length comparable to the mean spacing between sums of two squares. In addition we present a method for producing such conjectures through calculations in prime power residue rings and describe how these conjectures, as well as the above stated result, may by generalized to other binary quadratic forms. While producing these pair correlation conjectures we arrive at a surprising result regarding Mertens' formula for primes in arithmetic progressions, and in order to test the validity of the conjectures, we present numerical computations which support our approach.


2016 ◽  
Vol 12 (05) ◽  
pp. 1391-1407 ◽  
Author(s):  
Adrian W. Dudek ◽  
Loïc Grenié ◽  
Giuseppe Molteni

In this paper, on the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.


2007 ◽  
Vol 128 (2) ◽  
pp. 193-200 ◽  
Author(s):  
Kaisa Matomäki

1985 ◽  
Vol 17 (1) ◽  
pp. 419-429
Author(s):  
J. Pintz

Sign in / Sign up

Export Citation Format

Share Document