Related papers: On the regularity of primes in arithmetic progress…
We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…
Under fairly general conditions, we show that families of integer-valued polynomial-like multiplicative functions are uniformly distributed in coprime residue classes mod $p$, where $p$ is a growing prime (or nearly prime) modulus. This can…
We show that, for sufficiently large integers $m$ and $X$, for almost all $a =1, ..., m$ the ratios $a/x$ and the products $ax$, where $|x|\le X$, are very uniformly distributed in the residue ring modulo $m$. This extends some recent…
We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…
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…
For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…
Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree $d$ whose Galois group is $S_d$. Let $(a_n)$ be a linearly recuresive sequence of integers which has $P$ as its characteristic polynomial. We prove, under…
Probabilistic models for the distribution of primes in the natural numbers are constructed in the article. The author found and proved the probabilistic estimates of the deviation $R(x)=|\pi(x)- Li(x)|$. The author has analyzed the…
We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $\omega(n)=k$ or $\Omega(n)=k$ in two different arithmetic progressions, where $\omega(n)$ is the number of distinct prime factors…
We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…
The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…
Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…
For a fixed rational number g and integers a and d the sets N_g(a,d), respectively R_g(a,d), of primes p for which the order, respectively the index of g(mod p) is congruent to a(mod d), are considered. Under the Generalized Riemann…
Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…
The goal of this article is to study the discrepancy of the distribution of arithmetic sequences in arithmetic progressions. We will fix a sequence $\A=\{\a(n)\}_{n\geq 1}$ of non-negative real numbers in a certain class of arithmetic…
A famous conjecture of Artin asserts that any integer $a$ that is neither $-1$ nor a square should be a primitive root (mod $p$) for a positive proportion of primes $p$. Moreover, using a heuristic argument, Artin guessed an explicit…
Let a be a positive integer which is not a perfect h-th power with h greater than 1, and Q_a(x;4,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo 4. When j=0, 2, it is known that…
We study values of k for which the interval (kn,(k+1)n) contains a prime for every n>1. We prove that the list of such integers k includes k=1,2,3,5,9,14, and no others, at least for k<=50,000,000. For every known k of this list, we give a…