Related papers: Goldbach versus de Polignac numbers
Heilbronn gave a sufficient condition for a number field with a totally ramified prime to fail to be norm-Euclidean. We say that Heilbronn's criterion applies to a polynomial $f$ if it applies to the number field $K=\mathbb{Q}[x]/(f)$…
Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…
We prove new results on the additive theory of reversed primes $\overleftarrow{p}$; that is, primes $p$ which are written backwards in a fixed base $b\geq 2$. In particular, we study a variant of Goldbach's conjecture, looking at…
A prime p is called Sophie Germain prime if 2p+1 is also prime. A formula for the density of such primes is given in a more general setting using a new approach. This method uses the Ramanujan-Fourier series for a modified von Mangoldt…
The set of primes where a hypergeomeric series with rational parameters is $p$-adically bounded is known by [10] to have a Dirichlet density. We establish a formula for this Dirichlet density and conjecture that it is rare for the density…
We show that large gaps between smooth numbers are infrequent. The key new tool is a novel mean value bound for a special type of Dirichlet polynomial.
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
We study an asymptotic formula for average orders of Goldbach representations of an integer as the sum of k primes. We extend the existing result for k=2 to a general k, for which we obtain a better error term. Moreover, we prove an…
In this note, we generalise two results on prime numbers in short intervals. The first result is Ingham's theorem which connects the zero-density estimates with short intervals where the prime number theorem holds, and the second result is…
We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new…
We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$,…
We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…
We take the pre-sieved set to be all natural numbers $N=\{1,2,3,\dots\}$ with a sieve system:single sieve,double sieve,.... With single sieve, i.e. , remove out the multiple of a prime, we derive all the primes. With double sieve, i.e. ,…
In this paper, we show that various kinds of integer polynomials with prescribed properties of their roots have positive density. For example, we prove that almost all integer polynomials have exactly one or two roots with maximal modulus.…
Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_{\epsilon}(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 +…
Emmanuel Kowalski and William Sawin proved, using a deep independence result of Kloosterman sheaves, that the polygonal paths joining the partial sums of the normalized classical Kloosterman sums S(a,b0;p)/p^{1/2} converge in the sense of…
The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…
Chebyshev observed in a letter to Fuss that there tends to be more primes of the form $4n+3$ than of the form $4n+1$. The general phenomenon, which is referred to as Chebyshev's bias, is that primes tend to be biased in their distribution…
We present a method for finding large fixed-size primes of the form $X^2+c$. We study the density of primes on the sets $E_c = \{N(X,c)=X^2+c,\ X \in (2\mathbb{Z}+(c-1))\}$, $c \in \mathbb{N}^*$. We describe an algorithm for generating…
For a fixed rational number g and integers a and d the sets N_g(a,d), respectively R_g(a,d), of primes p for which the order, respectively the index of g(mod p) is congruent to a(mod d), are considered. Under the Generalized Riemann…