Related papers: Primes in short arithmetic progressions

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

Let $\mathbf{P}$ denote the set of prime numbers and, for an appropriate function $h$, define a set $\mathbf{P}_{h}=\{p\in\mathbf{P}: \exists_{n\in\mathbb{N}}\ p=\lfloor h(n)\rfloor\}$. The aim of this paper is to show that every subset of…

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set…

We show that smooth-supported multiplicative functions $f$ are well-distributed in arithmetic progressions $a_1a_2^{-1} \pmod q$ on average over moduli $q\leq x^{3/5-\varepsilon}$ with $(q,a_1a_2)=1$.

Let $E$ be an elliptic curve of rank $\text{rk}(E) \geq 1$, and let $P \in E(\mathbb{Q})$ be a point of infinite order. The number of elliptic primes $p \leq x$ for which $\langle P\rangle=E(\mathbb{F}_p)$ is expected to be…

We establish unconditional $\Omega$-results for all weighted even moments of primes in arithmetic progressions. We also study the moments of these moments and establish lower bounds under GRH. Finally, under GRH and LI we prove an…

B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…

We describe some of the machinery behind recent progress in establishing infinitely many arithmetic progressions of length $k$ in various sets of integers, in particular in arbitrary dense subsets of the integers, and in the primes.

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression $a$ (mod $q$) with $(a,q)=1$. For…

We establish an analog of the Hardy-Ramanujan inequality for counting members of sifted sets with a given number of distinct prime factors. In particular, we establish a bound for the number of shifted primes p+a below x with k distinct…

Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…

Define a natural number $n$ as a \textit{square-full} integer if for every prime $p$ such that $p|n$, we have $p^2|n$. In this paper, we establish an upper bound on the variance of square-full integers in short intervals of an expected…

A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…

Let $k\leq n$ be two positive integers and $q$ a prime power. The basic question in minimal linear codes is to determine if there exists an $[n,k]_q$ minimal linear code. The first objective of this paper is to present a new sufficient and…

Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{\phi (y)}{N} \sum _{\substack{n <N\\n\equiv…

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…