Related papers: Product of three primes in large arithmetic progre…

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…

For any positive integers $q$, $n$, $m$ with $q$ being a prime power and $n \geq 5$, we establish a condition sufficient to ensure the existence of a primitive normal pair $(\epsilon,f(\epsilon))$ in $\mathbb{F}_{q^{n}}$ over…

Let $E/\mathbb Q$ be an elliptic curve, and denote by $N(p)$ the number of $\mathbb{F}_p$-points of the reduction modulo $p$ of $E$. A conjecture of Koblitz, refined by Zywina, states that the number of primes $p \leq X$ at which $N(p)$ is…

Let $q$ be a prime power and $n, r$ integers such that $r\mid q^n-1$. An element of $\mathbb{F}_{q^n}$ of multiplicative order $(q^n-1)/r$ is called \emph{$r$-primitive}. For any odd prime power $q$, we show that there exists a…

For every modulus $q\ge3$, we define a family of subsets $\mathcal{A}$ of the multiplicative group $(\mathbb{Z}/{q}\mathbb{Z})^\times$ for which the Euler product $\prod_{p\text{mod}q\in\mathcal{A}}(1-p^{-s})$ can be computed in double…

We prove that a positive proportion of the intervals of any fixed scalar multiple of $\log(X)$ in the dyadic interval $[X,2X]$ contain a prime number. We also show that a positive proportion of the congruence classes modulo $q$ contain a…

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Let q>1 and m>0 be relatively prime integers. We find an explicit period $\nu_m(q)$ such that for any integers n>0 and r we have $[n+\nu_m(q),r]_m(a)=[n,r]_m(a) (mod q)$ whenever a is an integer with $\gcd(1-(-a)^m,q)=1$, or a=-1 (mod q),…

In this paper we evaluate several determinants involving quadratic residues modulo primes. For example, for any prime $p>3$ with $p\equiv3\pmod4$ and $a,b\in\mathbb Z$ with $p\nmid ab$, we prove that $$\det\left[ 1+\tan\pi\frac{aj^2+bk^2}p…

Let $P(a,q)$ be the least prime in the arithmetic progression $\{n\equiv a(mod\ q)\}$. In this note, when $q$ has bounded cubic part and $(a,q)=1$, we combine the Heath-Brown's method and the Burgess's bounds for L-functions to obtain $…

We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In…

We provide a formula for the logarithmic density of the set of positive real numbers on which two prime counting functions $\psi(x;q,a)$ and $\psi(x;q,b)$ are simultaneously larger than their asymptotic main terms, as well as a method for…

This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…

While the sequence of primes is very well distributed in the reduced residue classes (mod $q$), the distribution of pairs of consecutive primes among the permissible $\phi(q)^2$ pairs of reduced residue classes (mod $q$) is surprisingly…

We study frequency moments of partition statistics arising from Euler products $A(q)=\prod_{r\ge1}(1-q^r)^{-c(r)}$ via a transform that expresses the moment generating functions as $B(q)$ times explicit divisor--sum series determined by…

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…

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 $1\leq a<q$ be a pair of small integers such that $\gcd(a,q)=1$ and let $x>1$ be a large number. This note discusses the existence of a short sequence of primes $p\equiv a\bmod q$ between two squares $x^2$ and $(x+1)^2$.

A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…

We study the average value of the divisor function $\tau(n)$ for $n\le x$ with $n \equiv a \bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$.…