English
Related papers

Related papers: Short intervals for the Romanoff-type sumset

200 papers

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

Number Theory · Mathematics 2012-03-02 Jean Bourgain , Moubariz Garaev , Sergei Konyagin , Igor Shparlinski

Let $\mathbb{N}$ and $\mathcal{P}$ be the sets of natural numbers and primes, respectively. Motived by an old problem of Erd\H os and Kalm\'ar, we prove that for almost all $y>1$ the lower asymptotic density of integers of the form…

Number Theory · Mathematics 2025-09-09 Yuchen Ding

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

General Mathematics · Mathematics 2009-01-07 N. A. Carella

We study higher uniformity properties of the von Mangoldt function $\Lambda$, the M\"obius function $\mu$, and the divisor functions $d_k$ on short intervals $(x,x+H]$ for almost all $x \in [X, 2X]$. Let $\Lambda^\sharp$ and $d_k^\sharp$ be…

Number Theory · Mathematics 2026-01-26 Kaisa Matomäki , Maksym Radziwiłł , Xuancheng Shao , Terence Tao , Joni Teräväinen

We show that the expected asymptotic for the sums $\sum_{X < n \leq 2X} \Lambda(n) \Lambda(n+h)$, $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$, and $\sum_{X < n \leq 2X} \Lambda(n) d_k(n+h)$ hold for almost all $h \in [-H,H]$, provided that…

Number Theory · Mathematics 2019-02-19 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

Let $\mathcal{A}=\{a_{n}\}_{n=1}^{\infty}$ and $\mathcal{B}=\{b_{n}\}_{n=1}^{\infty}$ be two sequences of positive integers (not necessarily distinct). Under some restrictions on $\mathcal{A}$ and $\mathcal{B}$, we obtain a lower bound for…

Number Theory · Mathematics 2026-01-22 Artyom Radomskii

Let \( X \geq y \geq 2 \), and let \( u = \frac{\log X}{\log y} \). We say a number is \textit{$y$-smooth} if all of its prime factors are less than or equal to \( y \). In this paper, we study the distribution of $y$-smooth numbers in…

Number Theory · Mathematics 2025-02-18 Sarvagya Jain

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

Number Theory · Mathematics 2026-04-07 Stephan Baier , Sayantan Roy

Let P be the set of all primes and P_2=P\cup{p_1p_2: p_1,p_2\in P}$. We prove that the sumset 2^P+P_2={2^p+q: p\in P, q\in P_2} has a positive lower density.

Number Theory · Mathematics 2015-05-13 Hongze Li , Hao Pan

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

Number Theory · Mathematics 2025-08-11 Ayla Gafni , Terence Tao

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…

Number Theory · Mathematics 2019-03-06 Habiba Kadiri , Allysa Lumley

Using Watt's mean value theorem and a delicate sieve decomposition, the author shows that the interval $[x, x+x^{\frac{1}{2}+\varepsilon}]$ contains an integer with a prime factor larger than $x^{\frac{35}{36}-\varepsilon}$ for sufficiently…

Number Theory · Mathematics 2026-01-06 Runbo Li

Let ${\mathcal H}$ be a multiplicative subgroup of $\mathbb{F}_p^*$ of order $H>p^{1/4}$. We show that $$ \max_{(a,p)=1}\left|\sum_{x\in {\mathcal H}} {\mathbf{\,e}}_p(ax)\right| \le H^{1-31/2880+o(1)}, $$ where ${\mathbf{\,e}}_p(z) =…

95 years ago Hoheisel proved the existence of primes in the sub-linear interval \[ \left[x, x+x^{1-{1\over 33000}}\right] \qquad \hbox{for $x$ sufficiently large}. \] This was improved by Heilbronn, proving existence of primes in the…

Number Theory · Mathematics 2025-08-29 Matt Visser

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

Number Theory · Mathematics 2021-04-14 Harald Andrés Helfgott , Maksym Radziwiłł

We show that as soon as $h\to \infty$ with $X \to \infty$, almost all intervals $(x-h\log X, x]$ with $x \in (X/2, X]$ contain a product of at most two primes. In the proof we use Richert's weighted sieve, with the arithmetic information…

Number Theory · Mathematics 2022-01-19 Kaisa Matomäki

Let $\mathcal{P}$ and $\mathbb{N}$ be the sets of all primes and natural numbers, respectively. In this article, it is proved that there has a positive lower density of the natural numbers which can be represented by the form…

Number Theory · Mathematics 2022-04-25 Yuchen Ding

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

Number Theory · Mathematics 2011-05-31 Giovanni Coppola

We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…

Number Theory · Mathematics 2019-09-16 Alessandro Languasco , Alessandro Zaccagnini