English
Related papers

Related papers: The Cram\'er conjecture holds with a positive prob…

200 papers

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

General Mathematics · Mathematics 2019-04-02 N. A. Carella

Kummer (1851) and, many years later, Ihara (2005) both posed conjectures on invariants related to the cyclotomic field $\mathbb Q(\zeta_q)$ with $q$ a prime. Kummer's conjecture concerns the asymptotic behaviour of the first factor of the…

Number Theory · Mathematics 2020-08-27 Pieter Moree

We prove explicit versions of Cram\'er's theorem for primes in arithmetic progressions, on the assumption of the generalized Riemann hypothesis.

Number Theory · Mathematics 2019-01-15 Adrian W. Dudek , Loïc Grenié , Giuseppe Molteni

Let $q\ge 3$ be a non-exceptional modulus $q\ge3$, and let $a$ be a positive integer coprime with $q$. For any $\epsilon>0$, there exists $\alpha>0$ (computable), such that for all $x\ge \alpha (\log q)^2$, the interval $\left[…

Number Theory · Mathematics 2020-12-09 Habiba Kadiri

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

Number Theory · Mathematics 2015-10-08 André LeClair

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

History and Overview · Mathematics 2020-02-04 Alberto Fraile , Roberto Martinez , Daniel Fernandez

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

Number Theory · Mathematics 2013-06-06 Shanta Laishram , Ram Murty

Let $x\geq 1$ be a large number, and let $1 \leq a <q $ be integers such that $\gcd(a,q)=1$ and $q=O(\log^c)$ with $c>0$ constant. This note proves that the counting function for the number of primes $p \in \{p=qn+a: n \geq1 \}$ with a…

General Mathematics · Mathematics 2025-09-30 N. A. Carella

We study the distribution of consecutive sums of two squares in arithmetic progressions. We show that for any odd squarefree modulus $q$, any two reduced congruence classes $a_1$ and $a_2$ mod $q$, and any $r_1,r_2 \ge 1$, a positive…

Number Theory · Mathematics 2025-09-17 Noam Kimmel , Vivian Kuperberg

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…

Number Theory · Mathematics 2009-06-02 Adway Mitra , Goutam Paul , Ushnish Sarkar

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

Number Theory · Mathematics 2007-05-23 Chunlei Liu

The Brun-Titchmarsh theorem shows that the number of primes $\le x$ which are congruent to $a\pmod{q}$ is $\le (C+o(1))x/(\phi(q)\log{x})$ for some value $C$ depending on $\log{x}/\log{q}$. Different authors have provided different…

Number Theory · Mathematics 2012-05-22 J. Maynard

Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…

Number Theory · Mathematics 2020-10-14 William D. Banks

In this paper we show that for some constant $c>0$ and for any $A>0$ there exist some $x(A)>0$ such that, If $q\leq (\log x)^{A}$ then we have \begin{align} \Psi_z(x;\mathcal{N}_q(a,b),q) &= \frac{\Theta (z)}{2\phi(q)}x +…

Number Theory · Mathematics 2021-07-29 Theophilus Agama , Marco Bortolamasim , Arturo Tapia

In this paper we prove a conjectured modular equation of Farkas and Kra, which involving a half sum of certain modular form of weight $1$ for congruence subgroup $\Gamma_1(k)$ with any prime $k$. We prove that their conjectured identity…

Number Theory · Mathematics 2018-12-27 Nian Hong Zhou

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Number Theory · Mathematics 2014-08-13 Kolbjørn Tunstrøm

Hooley conjectured that the variance V(x;q) of the distribution of primes up to x in the arithmetic progressions modulo q is asymptotically x log q, in some unspecified range of q\leq x. On average over 1\leq q \leq Q, this conjecture is…

Number Theory · Mathematics 2013-04-17 Daniel Fiorilli

We study the existence of products of primes in arithmetic progressions, building on the work of Ramar\'e and Walker. One of our main results is that if $q$ is a large modulus, then any invertible residue class mod $q$ contains a product of…

Number Theory · Mathematics 2022-08-12 Barnabás Szabó

We provide some variations on the Greene-Krammer's identity which involve q-Catalan numbers. Our method reveals a curious analogy between these new identities and some congruences modulo a prime.

Combinatorics · Mathematics 2009-05-26 Roberto Tauraso

We prove that, if $x$ and $q\leqslant x^{1/16}$ are two parameters, then for any invertible residue class $a$ modulo $q$ there exists a product of exactly three primes, each one below $x^{1/3}$, that is congruent to $a$ modulo $q$.

Number Theory · Mathematics 2019-03-04 Olivier Ramaré , Aled Walker