Related papers: Two problems on the distribution of Carmichael's l…
The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…
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…
Let a be a positive integer greater than 1, and Q_a(x;k,j) be the set of primes p less than x such that the residual order of a(mod p) is congruent to j modulo k. In this paper, the natural densities of Q_a(x;4,j) (j=0,1,2,3) are…
We say that $d_3(n)$ has exponent of distribution $\theta$ if, for every $\varepsilon>0$, the expected asymptotic holds uniformly for all moduli $q \le x^{\theta-\varepsilon}$. Nguyen proved, following earlier work of Banks, Heath-Brown,…
We generalize current known distribution results on Shanks--R\'enyi 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…
For any $\epsilon>0$, there exists $q_0(\epsilon)$ such for any $q\ge q_0(\epsilon)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three…
Benford's law is a famous law in statistics which states that the leading digits of random variables in diverse data sets appear not uniformly from 1 to 9; the probability that d (d=1,...,9) appears as a leading digit is given by…
Let $q$ be a prime power, $G=GL_n(q)$ and let $U\leqslant G$ be the subgroup of (lower) unitriangular matrices in $G$. For a partition $\lambda$ of $n$ denote the corresponding unipotent Specht module over the complex field $\C$ for $G$ by…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…
We derive a necessary and sufficient condition for the sum of M independent continuous random variables modulo 1 to converge to the uniform distribution in L^1([0,1]), and discuss generalizations to discrete random variables. A consequence…
In this work, we prove the joint convergence in distribution of $q$ variables modulo one obtained as partial sums of a sequence of i.i.d. square integrable random variables multiplied by a common factor given by some function of an…
Let $b_k(n)$ denote the $k-$regular partitons of a natural number $n$. In this paper, we study the behavior of $b_k(n)$ modulo composite integers $M$ which are coprime to $6$. Specially, we prove that for arbitrary $k-$regular partiton…
We elaborate the notions of Martin-L\"of and Schnorr randomness for real numbers in terms of uniform distribution of sequences. We give a necessary condition for a real number to be Schnorr random expressed in terms of classical uniform…
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,…
We show that for any $\varepsilon > 0$, prime $q$ sufficiently large with respect to $1 / \varepsilon$ and residue class $(a,q) = 1$, there exist two integers $m, n \leq q^{5/2 + \varepsilon}$ with $m \equiv n \equiv a \pmod{q}$ such that…
Here we prove that Benford's law holds for coefficients of an infinite class of modular forms. Expanding the work of Bringmann and Ono on exact formulas for harmonic Maass forms, we derive the necessary asymptotics. This implies that the…
Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the…
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…
Let $q$ be an integer $\geq 2$ and let $S_q(n)$ denote the sum of digits of $n$ in base $q$. For \[ \alpha=[0;\overline{1,m}],\ m\geq 2, \] let $S_{\alpha}(n)$ denote the sum of digits in the Ostrowski $\alpha$-representation of $n$. Let…