The multplicative order of an integer g modulo a prime p, with p coprime to g, is defined to be the smallest positive integer k such that g^k is congruent to 1 modulo p. For fixed integers g and d the distribution of this order over residue classes mod d is considered as p runs over the primes.
An overview is given of the most significant of my results on this problem obtained (mainly) in the three part series of papers `On the distribution of the order and index of g (modulo p) over residue classes' I-III (appeared in the Journal of Number Theory, also available from the ArXiv).
Improving on some recent results of Matomäki and of Wright, we show that the number of Carmichael numbers to $X$ in a coprime residue class exceeds $X^{1/(6\log\log\log X)}$ for all sufficiently large $X$ depending on the modulus of the residue class.
Eisenstein classes of Siegel varieties are motivic cohomology classes defined as pull-backs by torsion sections of the polylogarithm prosheaf on the universal abelian scheme. By reduction to the Hilbert-Blumenthal case, we prove that the Betti realization of these classes on Siegel varieties of arbitrary genus have non-trivial residue on zero dimensional strata of the Baily-Borel compactification. A direct corollary is the non-vanishing of a higher regulator map.
In this article we investigate the distribution of prime ideals of residue degree bigger than one across the ideal classes in the class group of a number field $L$. A criterion for the class group of $L$ being generated by the classes of prime ideals of residue degree $f>1$ is provided. Further, some consequences of this study on the solvability of norm equations for $L/\mathbb{Q}$ and on the problem of finding annihilators for relative extensions are discussed.
We give an algorithm to determine all the repeated concatenations, in a given base, of a natural number in a residue class. The author recently describes a particular sequence of $v$-palindromes that inspires this investigation. We also generalize this sequence and discuss how there could be variations of the investigation we do in this paper.
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 be seen as complementary to work of Narkiewicz, who obtained comprehensive results for fixed moduli.
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$, extending the Bombieri-Vinogradov theorem to moduli of size $x^{1/2+δ}$ which have conveniently sized divisors. The main feature of these estimates is that they are completely uniform with respect to the residue classes considered, unlike previous works on primes in arithmetic progressions to large moduli.
We consider a problem of P. Erdos, A. M. Odlyzko and A. Sarkozy about the representation of residue classes modulo m by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to achieve the expected results, here we obtain some unconditional results ``on average'' over moduli m and residue classes modulo m and somewhat stronger results when the average is restricted to prime moduli m = p. We also consider the analogous question wherein the primes are replaced by easier sequences so, quite naturally, we obtain much stronger results.
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to construct an elliptic curve over prime field using complex multiplication method.
We characterize which residue classes contain infinitely many totients (values of Euler's function) and which do not. We show that the union of all residue classes that are totient-free has asymptotic density 3/4, that is, almost all numbers that are 2 mod 4 are in a residue class that is totient-free. In the other direction, we show the existence of a positive density of odd numbers m, such that for any $s\ge0$ and any even number $a$, the residue class $a\pmod{2^sm}$ contains infinitely many totients.
Improving upon previous work on the subject, we use Wright's Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer that are in any given arithmetic progression.
We prove that the set of Farey fractions of order $T$, that is, the set $\{α/β\in \Q : \gcd(α, β) = 1, 1 \le α, β\le T\}$, is uniformly distributed in residue classes modulo a prime $p$ provided $T \ge p^{1/2 +\eps}$ for any fixed $\eps>0$. We apply this to obtain upper bounds for the Lang--Trotter conjectures on Frobenius traces and Frobenius fields ``on average'' over a one-parametric family of elliptic curves.
We resolve a function field version of two conjectures concerning the variance of the number of primes in short intervals (Goldston and Montgomery) and in arithmetic progressions (Hooley). A crucial ingredient in our work are recent equidistribution results of N. Katz.
Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has no irreducible factors of degree exceeding $\text{deg}~F -1$. We also give applications to generating sequences of irreducible polynomials.
We show that for any $\varepsilon > 0$ and a sufficiently large cube-free $q$, any reduced residue class modulo $q$ can be represented as a product of $14$ integers from the interval $[1, q^{1/4e^{1/2} + \varepsilon}]$. The length of the interval is at the lower limit of what is possible before the Burgess bound on the smallest quadratic nonresidue is improved. We also consider several variations of this result and give applications to Fermat quotients.
We prove upper bounds for sums of Kloosterman sums against general arithmetic weight functions. In particular, we obtain power cancellation in sums of Kloosterman sums over arithmetic progressions, which is of square-root strength in any fixed primitive congruence class up to bounds towards the Ramanujan conjecture.
We fix a non-zero integer $a$ and consider arithmetic progressions $a \bmod q$, with $q$ varying over a given range. We show that for certain specific values of $a$, the arithmetic progressions $a \bmod q$ contain, on average, significantly fewer primes than expected.
We generalize current known distribution results on Shanks--Rényi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function field analogues developed in the recent years. More precisely, let $π(x;q,a)$ be the number of primes up to $x$ that are congruent to $a$ modulo $q$. For a fixed integer $q$ and distinct invertible congruence classes $a_0,a_1,\ldots,a_D$, assuming the generalized Riemann Hypothesis and a weak version of the linear independence hypothesis, we show that the set of $…
We show, in an effective way, that there exists a sequence of congruence classes $a_k\pmod {m_k}$ such that the minimal solution $n=n_k$ of the congruence $ϕ(n)\equiv a_k\pmod {m_k}$ exists and satisfies $\log n_k/\log m_k\to\infty $ as $k\to\infty$. Here, $ϕ(n)$ is the Euler function. This answers a question raised in \cite{FS}. We also show that every congruence class containing an even integer contains infinitely many values of the Carmichael function $λ(n)$ and the least such $n$ satisfies $n\ll m^{13}$.
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), that this set has a natural density which can be computed in terms of degrees of certain Kummer extensions and Galois theoretic intersection coefficients. In case d is a power of an odd prime several properties of this density are established.
For any prime $p$, let $y(p)$ denote the smallest integer $y$ such that every reduced residue class $\pmod p$ is represented by the product of some subset of $\{1,\dots,y\}$. It is easy to see that $y(p)$ is at least as large as the smallest quadratic nonresidue $\pmod p$; we prove that $y(p) \ll_\varepsilon p^{1/(4 \sqrt e)+\varepsilon}$, thus strengthening Burgess's classical result. This result is of intermediate strength between two other results, namely Burthe's proof that the multiplicative group $\pmod p$ is generated by the integers up to $O_\varepsilon(p^{1/(4 \sqrt e)+\varepsilon}$, …
For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis, these sets have a natural density. Moreover, we explicitly compute this density. For d=4 this generalises earlier work by K. Chinen and L. Murata. The case d=3 was apparently not considered before.
Let $q>r\ge1$ be coprime positive integers. We empirically study the maximal gaps $G_{q,r}(x)$ between primes $p=qn+r\le x$, $n\in{\mathbb N}$. Extensive computations suggest that almost always $G_{q,r}(x)<φ(q)\log^2x$. More precisely, the vast majority of maximal gaps are near a trend curve $T$ predicted using a generalization of Wolf's conjecture: $$G_{q,r}(x) ~\sim~ T(q,x)={φ(q)x\over{\rm li}(x)} \Big(2\log{{\rm li}(x)\overφ(q)} - \log x + b\Big),$$ where $b = b(q,x) = O_q(1)$. The distribution of properly rescaled maximal gaps $G_{q,r}(x)$ is close to the Gumbel extreme value distribution.…
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+δ}$ with a 'convenient sized' factor. As a consequence, the expected asymptotic holds for all but $O(δQ)$ moduli $q\sim Q=x^{1/2+δ}$ and we get results for moduli as large as $x^{11/21}$. Our proof extends previous techniques of Bombieri, Fouvry, Friedlander and Iwaniec by incorporating new ideas inspired by amplification methods. We combine these with techniques of Zhang and P…
Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k \left(1-\frac{1}{φ(a_i)}\right)$, where $φ$ is the Euler's totient function. This result is similar to the one of Heilbronn and Rohrbach, which says that the set of positive integer $n$ such that $n \not\equiv 0 \bmod a_i$ for $i=1,\ldots,k$ admits asymptotic density which is at least $\prod_{i=1}^k \left(1-\frac{1}{a_i}\right)$.
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 Hypothesis (GRH), it was shown in part II that these sets have a natural density. Here it is shown that these densities can be expressed as linear combinations of certain constants introduced by Pappalardi. Furthermore it is proved that these densities equal their g-averages for almost all g. It is also shown that if such a density does not equal its g-average then…
Let $q$ be an integer $\geq 2$ and let $S_q(n)$ denote the sum of digits of $n$ in base $q$. For \[ α=[0;\overline{1,m}],\ m\geq 2, \] let $S_α(n)$ denote the sum of digits in the Ostrowski $α$-representation of $n$. Let $m_1,m_2\geq 2$ be integers with $$\gcd(q-1,m_1)=\gcd(m,m_2)=1.$$ We prove that there exists $δ>0$ such that for all integers $a_1,a_2$, \begin{eqnarray*} &&|\{0\leq n<N: S_{q}(n)\equiv a_1\pmod{m_1},\ S_α(n)\equiv a_2\pmod{m_2}\}| &=&\frac{N}{m_1m_2}+O(N^{1-δ}). \end{eqnarray*} The asymptotic relation implied by this equality was proved by Coquet, Rhin & Toffin and the equali…
This paper deals with function field analogues of famous theorems of Laudau which counted the number of integers which have $t$ prime factors and R. Hall which researched the distribution of divisors of integers in residue classes.\;We extend the Selberg-Delange method to handle the following problems.\;The number of monic polynomials with degree $n$ have $t$ irreducible factors;\;The number of monic polynomials with degree $n$ in some residue classes have $t$ irreducible factors and the residue classes distribution of divisors of monic polynomial.\;
We investigate the distribution of the function $ω(n)$, the number of distinct prime divisors of $n$, in residue classes modulo $q$ for natural numbers $q$ greater than 2. In particular we ask `prime number races' style questions, as suggested by Coons and Dahmen in their paper `On the residue class distribution of the number of prime divisors of an integer'.
For two distinct integers $m_1,m_2\ge2$, we set $α_1=[0;\overline{1,m_1}]$ and $α_2=[0;\overline{1,m_2}]$ and we denote by $S_{α_1}(n)$ and $S_{α_2}(n)$ respectively the sum of digits functions in the Ostrowski $α_1$ and $α_2-$representations of $n$. Let $b_1,b_2 $ be positive integers satisfying $(b_1,m_1)=1$ and $(b_2,m_2)=1$, we obtain an estimation with an error term $O(N^{1-δ})$ for the cardinal of the following set $$\Big\{ 0\leq n<N;\ S_{α_1}(n)\equiv a_1\pmod{b_1},\ S_{α_2}(n)\equiv a_2\pmod{b_2}\Big\},$$ for all integers $a_1$ and $a_2.$ Our result should be compared to that of Bésine…
We construct a collection of matrices defined by quadratic residue symbols, termed "quadratic residue matrices", associated to the splitting behavior of prime ideals in a composite of quadratic extensions of $\mathbb{Q}$, and prove a simple criterion characterizing such matrices. We also study the analogous classes of matrices constructed from the cubic and quartic residue symbols for a set of prime ideals of $\mathbb{Q}(\sqrt{-3})$ and $\mathbb{Q}(i)$, respectively.
In a recent paper of the author with D. Dummit and H. Kisilevsky, we constructed a collection of matrices defined by quadratic residue symbols, termed "quadratic residue matrices", associated to the splitting behavior of prime ideals in a composite of quadratic extensions of $\mathbb{Q}$, and proved a simple criterion characterizing such matrices. We then analyzed the analogous classes of matrices constructed from the cubic and quartic residue symbols for a set of prime ideals of $\mathbb{Q}(\sqrt{-3})$ and $\mathbb{Q}(i)$, respectively. In this paper, the goal is to construct and study the fi…
We consider the distribution in residue classes modulo primes $p$ of Euler's totient function $ϕ(n)$ and the sum-of-proper-divisors function $s(n):=σ(n)-n$. We prove that the values $ϕ(n)$, for $n\le x$, that are coprime to $p$ are asymptotically uniformly distributed among the $p-1$ coprime residue classes modulo $p$, uniformly for $5 \le p \le (\log{x})^A$ (with $A$ fixed but arbitrary). We also show that the values of $s(n)$, for $n$ composite, are uniformly distributed among all $p$ residue classes modulo every $p\le (\log{x})^A$. These appear to be the first results of their kind where th…
We prove that the sequence $n!\,(\bmod\,p)$ occupies at least $\sqrt{\frac{3}{2}N}$ residue classes in the short interval $H\le n \le H+N$ and $N\gg p^{\frac{1}{4}}$ improving previously known trivial bound $\sqrt{N}.$ In the other direction, we estimate the average number of residue classes missed by the sequence $n!\,(\bmod\,p)$ for $p\le x.$
We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992). We also estimate the smallest squarefull number in almost all residue classes modulo a prime $p$.
Our purpose is to give an account of the $r$-tuple problem on the increasing sequence of reduced fractions having denominators bounded by a certain size and belonging to a fixed real interval. We show that when the size grows to infinity, the proportion of the $r$-tuples of consecutive denominators with components in certain apriori fixed arithmetic progressions with the same ratio approaches a limit, which is independent on the interval. The limit is given explicitly and it is completely described in a few particular instances.
A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this size we show that, under mild assumptions on the size of the modulus $m$ and on the difference $N^{1/2}-\Abs{\cal A}$ (these quantities should not be too large) the elements of ${\cal A}$ are uniformly distributed in the residue classes mod $m$. Quantitative estimates on how uniform the distribution is are also provided. This generalizes recent results of Lin…
How many points does an affine algebraic set have in residue classes modulo n ?
Research Center for Logic, Optimization and Security (LOS), Faculty of Mathematics and Computer Science, University of Bucharest(布加勒斯特大学数学与计算机科学学院逻辑、优化与安全研究中心);Simion Stoilow Institute of Mathematics of the Romanian Academy(罗马尼亚科学院西奥多·斯托伊洛数学研究所)
For any $k\geq 1$, we study the distribution of the difference between the number of integers $n\leq x$ with $ω(n)=k$ or $Ω(n)=k$ in two different arithmetic progressions, where $ω(n)$ is the number of distinct prime factors of $n$ and $Ω(n)$ is the number of prime factors of $n$ counted with multiplicity . Under some reasonable assumptions, we show that, if $k$ is odd, the integers with $Ω(n)=k$ have preference for quadratic non-residue classes; and if $k$ is even, such integers have preference for quadratic residue classes. This result confirms a conjecture of Richard Hudson. However, the in…
Let $p$ be an odd prime number. In this article, we study the number of quadratic residues and non-residues modulo $p$ which are multiples of $2$ or $3$ or $4$ and lying in the interval $[1, p-1]$, by applying the Dirichlet's class number formula for the imaginary quadratic field $\mathbb{Q}(\sqrt{-p})$.
We study the distribution of spacings between squares modulo q as the number of prime divisors of q tends to infinity. In an earlier paper Kurlberg and Rudnick proved that the spacing distribution for square free q is Poissonian, this paper extends the result to arbitrary q.
Given collections A and B of residue classes modulo m and n, respectively, we investigate conditions on A and B that ensure that, for at least some a in A and b in B, the linear system x = a mod m, x = b mod n has an integer solution, and we quantify the number of such admissible pairs (a,b). The special case where A and B consist of intervals of residue classes has application to the Lonely Runner Conjecture.
For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $φ(q)$ reduced residue classes modulo $q$. This paper considers patterns of sequences of consecutive primes $(p_n, p_{n+1}, \ldots, p_{n+k})$ modulo $q$. Numerical evidence suggests a preference for certain prime patterns. For example, computed frequencies of the pattern $(a,a)$ modulo $q$ up to $x$ are much less than the expected frequency $π(x)/φ(q)^2$. We begin to rigorously c…
We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the least prime or almost-prime primitive root (mod p) that holds uniformly for all p, analogous to Linnik's Theorem on a uniform upper bound for the least prime in a single arithmetic progression (mod p).
Zero-sum problems for abelian groups and covers of the integers by residue classes, are two different active topics initiated by P. Erdos more than 40 years ago and investigated by many researchers separately since then. In an earlier announcement [Electron. Res. Announc. Amer. Math. Soc. 9(2003), 51-60], the author claimed some surprising connections among these seemingly unrelated fascinating areas. In this paper we establish further connections between zero-sum problems for abelian p-groups and covers of the integers. For example, we extend the famous Erdos-Ginzburg-Ziv theorem in the follo…
Let $f(x)$ be an irreducible polynomial with integer coefficients of degree at least two. Hooley proved that the roots of the congruence equation $f(x)\equiv 0\mod n$ is uniformly distributed. as a parallel of Hooley's theorem under ideal theoretical setting, we prove the uniformity of the distribution of residues of an algebraic number modulo degree one ideals. Then using this result we show that the roots of a system of polynomial congruences are uniformly distributed. Finally, the distribution of digits of n-adic expansions of an algebraic number is discussed.
We show that, in a restricted range, the divisor function of integers in residue classes modulo a prime follows a Gaussian distribution, and a similar result for Hecke eigenvalues of classical holomorphic cusp forms. Furthermore, we obtain the joint distribution of these arithmetic functions in two related residue classes. These results follow from asymptotic evaluations of the relevant moments, and depend crucially on results on the independence of monodromy groups related to products of Kloosterman sums.