English
Related papers

Related papers: On the Brun--Titchmarsh theorem. II

200 papers

The classical Brun--Titchmarsh theorem gives an upper bound, which is of correct order of magnitude in the full range, for the number of primes $p\leqslant x$ satisfying $p\equiv a\bmod q$. We strengthen this inequality for different ranges…

Number Theory · Mathematics 2025-12-30 Ping Xi , Junren Zheng

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…

Number Theory · Mathematics 2019-11-25 M. A. Korolev

For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where…

Number Theory · Mathematics 2018-06-08 Alexander Dunn , Alexandru Zaharescu

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

Number Theory · Mathematics 2019-12-09 M. E. Changa , M. A. Korolev

The series of some new estimates for the sums of the type \[ S_{q}(x;f)\,=\,\mathop{{\sum}'}\limits_{n\leqslant x}f(n)e_{q}(an^{*}+bn) \] is obtained. Here $q$ is a sufficiently large integer, $\sqrt{q}(\log{q})\!\ll\!x\leqslant q$, $a,b$…

Number Theory · Mathematics 2018-04-05 M. A. Korolev

We give an explicit version of Brun-Titchmarsh theorem applicable for arbitrary moduli and arbitrary intervals. For example, we show that $\pi(x+y; k, a)-\pi(x; k, a)<2y/(\varphi(k)(\log (y/k)+0.8601))$ for any relatively prime positive…

Number Theory · Mathematics 2023-12-27 Tomohiro Yamada

We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.

Number Theory · Mathematics 2015-11-09 Jan Büthe

The author studies an average version of Brun-Titchmarsh theorem with large moduli. Using Maynard's recent breakthrough on the Bombieri-Friedlander-Iwaniec type triple convolution estimates, we refine the previous result of Baker and Harman…

Number Theory · Mathematics 2025-10-08 Runbo Li

We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$,…

Number Theory · Mathematics 2018-11-05 Igor E. Shparlinski , Jose Felipe Voloch

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

We prove a bound on the number of primes with a given splitting behaviour in a given field extension. This bound generalises the Brun-Titchmarsh bound on the number of primes in an arithmetic progression. The proof is set up as an…

Number Theory · Mathematics 2017-03-10 Korneel Debaene

We prove that the Kloosterman sum $\text{Kl}(1,q)$ changes sign infinitely many times, as $q\rightarrow +\infty$ with at most six prime factors. As a consequence, our result improved the best known result of Xi(IMRN, 2022). The novelty of…

Number Theory · Mathematics 2026-02-05 Tianping Zhang , Mingxuan Zhong

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

Number Theory · Mathematics 2025-12-08 Peng Gao , Xiaosheng Wu

For a prime $p$, we consider Kloosterman sums $$ K_{p}(a) = \sum_{x\in \F_p^*} \exp(2 \pi i (x + ax^{-1})/p), \qquad a \in \F_p^*, $$ over a finite field of $p$ elements. It is well known that due to results of Deligne, Katz and Sarnak, the…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski

Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r.…

Number Theory · Mathematics 2014-02-26 Tristan Freiberg

When solving a number of problems in prime number theory, it is sufficient that $t(x;q)$ admits an estimate close to this one. The best known estimates for $t(x;q)$ previously belonged to G.~Montgomery, R.~Vaughn, and Z.~Kh.~Rakhmonov. In…

Number Theory · Mathematics 2025-03-12 Z. Rakhmonov , O. Nozirov

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

Number Theory · Mathematics 2022-11-18 Jared Duker Lichtman

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

Number Theory · Mathematics 2024-10-15 Ben Green , Mehtaab Sawhney

G. Ricotta and E. Royer (2018) have recently proved that the polygonal paths joining the partial sums of the normalized classical Kloosterman sums $S(a,b;p^n)/p^(n/2) converge in law in the Banach space of complex-valued continuous function…

Number Theory · Mathematics 2019-05-08 Guillaume Ricotta , Emmanuel Royer , Igor Shparlinski

We prove new bounds on bilinear forms with Kloosterman sums, complementing and improving a series of results by \'E. Fouvry, E. Kowalski and Ph. Michel (2014), V. Blomer, \'E. Fouvry, E. Kowalski, Ph. Michel and D. Mili\'cevi\'c (2017), E.…

Number Theory · Mathematics 2023-04-18 Bryce Kerr , Igor E. Shparlinski , Xiaosheng Wu , Ping Xi
‹ Prev 1 2 3 10 Next ›