Related papers: A note on Primes in Short Intervals

Using evaluations of the difference between consecutive primes we develop another way of estimating of the number of primes in the interval $(n, 2n)$. We also discuss the ultra Cramer conjecture, $p_{n+1} - p_n = O(log^{1+\epsilon}p_n)$…

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

Let $\Lambda(n)$ be the von Mangoldt function, $x$ real and $2\leq y \leq x$. This paper improves the estimate on the exponential sum over primes in short intervals \[ S_k(x,y;\alpha) = \sum_{x< n \leq x+y} \Lambda(n) e\left( n^k \alpha…

We establish an analog of the Hardy-Ramanujan inequality for counting members of sifted sets with a given number of distinct prime factors. In particular, we establish a bound for the number of shifted primes p+a below x with k distinct…

We estimate the asymptotic density of the set $\bar{A}$ of primes $p$ satisfying the constraint that $p+1$ and $p-1$ have only one prime divisor larger than $3$. We also estimate the density of a maximal subset $\bar{B} \subset \bar{A}$…

TO BE PUBLISHED BY ISRAEL JOURNAL OF MATHEMATICS. We study the mean $\sum_{x\in\mathcal{X}} \bigl|\sum_{p\le N}{}u_p e(xp)\bigr|^{\ell}$ when $\ell$ covers the full range $[2,\infty)$ and $\mathcal{X}\subset\mathbb{R}/\mathbb{Z}$ is a…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…

We prove a Kahane-Khinchin type result with a few random vectors, which are distributed independently with respect to an arbitrary log-concave probability measure on $\R^n$. This is an application of small ball estimate and Chernoff's…

We investigate the level spacing distribution for the quantum spectrum of the square billiard. Extending work of Connors--Keating, and Smilansky, we formulate an analog of the Hardy--Littlewood prime $k$-tuple conjecture for sums of two…

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

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

In this paper, we make some conjectures on prime numbers that are sharper than those found in the current literature. First we describe our studies on Legendre's Conjecture which is still unsolved. Next, we show that Brocard's Conjecture…

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

We solve some famous conjectures on the distribution of primes. These conjectures are to be listed as Legendre's, Andrica's, Oppermann's, Brocard's, Cram\'{e}r's, Shanks', and five Smarandache's conjectures. We make use of both…

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…

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

Let $H = N^{\theta}, \theta > 2/3$ and $k \geq 1$. We obtain estimates for the following exponential sum over primes in short intervals: \[ \sum_{N < n \leq N+H} \Lambda(n) e(g(n)), \] where $g$ is a polynomial of degree $k$. As a…

We prove that if $x$ is large enough, namely $x\ge x_0$, then there exists a prime between $x(1- \Delta^{-1})$ and $x$, where $\Delta$ is an effective constant computed in terms of $x_0$. This improves some previous results of Ramar\'e and…

We relate the size of the error term in the Hardy-Littlewood conjectured formula for the number of prime pairs to the $L^{1}$ norm of an exponential sum over the primes formed with the von Mangoldt function.

We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…