English
Related papers

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

200 papers

Denote by $\pi(x;q,a)$ the number of primes $p\leqslant x$ with $p\equiv a\bmod q.$ We prove new upper bounds for $\pi(x;q,a)$ when $q$ is a large prime very close to $\sqrt{x}$, improving upon the classical work of Iwaniec (1982). The…

Number Theory · Mathematics 2025-11-25 Ping Xi , Junren Zheng

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 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

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 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 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 show the primes have level of distribution $66/107\approx 0.617$ using triply well-factorable weights. This gives the highest level of distribution for primes in any setting, improving on the prior record level $3/5=0.60$ of Maynard. We…

Number Theory · Mathematics 2023-09-18 Jared Duker Lichtman

We prove an explicit Chebotarev variant of the Brun--Titchmarsh theorem. This leads to explicit versions of the best-known unconditional upper bounds toward conjectures of Lang and Trotter for the coefficients of holomorphic cuspidal…

Number Theory · Mathematics 2022-08-23 Daniel Hu , Hari R. Iyer , Alexander Shashkov

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

We prove a new bound to the exponential sum of the form $$ \sum_{h \sim H}\delta_h \mathop{\sum_{m\sim M}\sum_{n\sim N}}_{mn\sim x}a_{m}b_{n}\e\big(\alpha mn + h(mn + u)^{\gamma}\big), $$ by a new approach to the Type I sum. The sum can be…

Number Theory · Mathematics 2025-12-10 Li Lu , Lingyu Guo , Victor Z. Guo

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

Number Theory · Mathematics 2022-06-24 Stephan Baier , Sudhir Pujahari

Assuming that there exist (infinitely many) Siegel zeros, we show that the (Rosser-)Jurkat-Richert bounds in the linear sieve cannot be improved, and similarly look at Iwaniec's lower bound on Jacobsthal's problem, as well as minor…

Number Theory · Mathematics 2020-10-06 Andrew Granville

Let $p$ be a prime. For $d\in \mathbb{N}$, let $\mathbb{Q}_p^d$ be the standard $d$-dimensional p-adic Hilbert space. Let $m \in \mathbb{N}$ and $\text{Sym}^m(\mathbb{Q}_p^d)$ be the p-adic Hilbert space of symmetric m-tensors. We prove the…

Number Theory · Mathematics 2024-08-07 K. Mahesh Krishna

In the present paper we obtain several new results related to the problem of upper bound estimates for the number of solutions of the congruence $$ x^{x}\equiv \lambda\pmod p;\quad x\in \mathbb{N},\quad x\le p-1, $$ where $p$ is a large…

Number Theory · Mathematics 2015-03-11 Javier Cilleruelo , Moubariz Z. Garaev

Recently, Agievich proposed an interesting upper bound on binomial coefficients in the de Moivre-Laplace form. In this article, we show that the latter bound, in the specific case of a central binomial coefficient, is larger than the one…

Combinatorics · Mathematics 2024-08-01 Jean-Christophe Pain

We study short sums of algebraic trace functions via the $q$-analogue of van der Corput method, and develop methods of arithmetic exponent pairs that coincide with the classical case while the moduli has sufficiently good factorizations. As…

Number Theory · Mathematics 2021-04-20 Jie Wu , Ping Xi

Assuming the generalized Lindel\"of hypothesis for Dirichlet $L$-functions, we establish that the least prime $p\equiv a\pmod{q}$ satisfies $p\ll_{\varepsilon} q^{2+\varepsilon}$. This achieves a bound that nearly matches the classical…

Number Theory · Mathematics 2026-03-27 Matías Bruna

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

Number Theory · Mathematics 2023-03-10 Ethan S. Lee
‹ Prev 1 2 3 10 Next ›