Results 1 
4 of
4
Higher correlations of divisor sums related to primes, II: Variations of . . .
, 2007
"... We calculate the triple correlations for the truncated divisor sum λR(n). The λR(n) behave over certain averages just as the prime counting von Mangoldt function Λ(n) does or is conjectured to do. We also calculate the mixed (with a factor of Λ(n)) correlations. The results for the moments up to the ..."
Abstract

Cited by 50 (9 self)
 Add to MetaCart
We calculate the triple correlations for the truncated divisor sum λR(n). The λR(n) behave over certain averages just as the prime counting von Mangoldt function Λ(n) does or is conjectured to do. We also calculate the mixed (with a factor of Λ(n)) correlations. The results for the moments up to the third degree, and therefore the implications for the distribution of primes in short intervals, are the same as those we obtained (in the first paper with this title) by using the simpler approximation ΛR(n). However, when λR(n) is used, the error in the singular series approximation is often much smaller than what ΛR(n) allows. Assuming the Generalized Riemann Hypothesis (GRH) for Dirichlet Lfunctions, we obtain an Ω±result for the variation of the error term in the prime number theorem. Formerly, our knowledge under GRH was restricted to Ωresults for the absolute value of this variation. An important ingredient in the last part of this work is a recent result due to Montgomery and Soundararajan which makes it possible for us to dispense with a large error term in the evaluation of a certain singular series average. We believe that our results on the sums λR(n) and ΛR(n) can be employed in diverse problems concerning primes.
Longer than average intervals containing no primes
 Trans. Amer. Math. Soc
, 1987
"... Abstract. We present two methods for proving that there is a positive proportion of intervals which contain no primes and are longer than the average distance between consecutive primes. The first method is based on an argument of Erdös which uses a sieve upper bound for prime twins to bound the den ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present two methods for proving that there is a positive proportion of intervals which contain no primes and are longer than the average distance between consecutive primes. The first method is based on an argument of Erdös which uses a sieve upper bound for prime twins to bound the density function for gaps between primes. The second method uses known results about the first three moments for the distribution of intervals with a given number of primes. Better results are obtained by assuming that the first n moments are Poisson. The related problem of longer than average gaps between primes is also considered. I. Introduction. In this paper we examine the occurrence of long intervals containing no prime numbers from a statistical point of view. Previous work on this subject (see [15, Chapter 5]) has been directed toward constructing very long sequences of consecutive composite numbers. However, these sequences occur so infrequently they have no statistical significance. In this paper, we introduce two different
A Survey of Results on Primes in Short Intervals
"... Prime numbers have been a source of fascination for mathematicians since antiquity. The proof that there are infinitely many prime numbers is attributed to Euclid (fourth century B.C.). The basic method of determining all primes less than a given number N is ..."
Abstract
 Add to MetaCart
Prime numbers have been a source of fascination for mathematicians since antiquity. The proof that there are infinitely many prime numbers is attributed to Euclid (fourth century B.C.). The basic method of determining all primes less than a given number N is