English
Related papers

Related papers: Two problems on the distribution of Carmichael's l…

200 papers

For a partition $\lambda \vdash n$, we let $\operatorname{pd}(\lambda)$, the parity difference of $\lambda$, be the number of odd parts of $\lambda$ minus the number of even parts of $\lambda$. We prove for $c_0\in\mathbb{R}$ an asymptotic…

Number Theory · Mathematics 2025-04-04 Siu Hang Man

Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently…

Statistics Theory · Mathematics 2019-01-04 Alex Ely Kossovsky

We prove connections between Zeckendorf decompositions and Benford's law. Recall that if we define the Fibonacci numbers by $F_1 = 1, F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$, every positive integer can be written uniquely as a sum of…

We introduce the Plancherel measure on the set of partition collections, which parameterize irreducible representations of order n general linear group over a finite field. We prove that as n goes to infinity, the random partitions from the…

Representation Theory · Mathematics 2008-06-11 A. Dudko

The scope of this paper is twofold. First, to emphasize the use of the mod 1 map in exploring the digit distribution of random variables. We show that the well-known base- and scale-invariance of Benford variables are consequences of their…

Probability · Mathematics 2013-12-24 Azar Khosravani , Constantin Rasinariu

An important unsolved question in number theory is the Lehmer's totient problem that asks whether there exists any composite number $n$ such that $\varphi(n)\mid n-1$, where $\varphi$ is the Euler's totient function. It is known that if any…

Group Theory · Mathematics 2021-10-27 Marius Tărnăuceanu

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo…

Number Theory · Mathematics 2017-01-10 Olivier Bordellès

Let $a_1$, $a_2$, and $a_3$ be distinct reduced residues modulo $q$ satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \pmod q$. We conditionally derive an asymptotic formula, with an error term that has a power savings in $q$, for…

Number Theory · Mathematics 2023-06-22 Jiawei Lin , Greg Martin

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…

Number Theory · Mathematics 2013-01-03 Étienne Fouvry , Satadal Ganguly , Emmanuel Kowalski , Philippe Michel

We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…

Combinatorics · Mathematics 2019-05-06 Sara C. Billey , Matjaž Konvalinka , Joshua P. Swanson

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

Number Theory · Mathematics 2007-05-23 Ken Ono

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…

Combinatorics · Mathematics 2025-02-03 Michael J. Schlosser , Nian Hong Zhou

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Number Theory · Mathematics 2016-05-20 Sungjin Kim

Let $\sigma(n)$ and $\gamma(n)$ denote the sum of divisors and the product of distinct prime divisors of $n$ respectively. We shall show that, if $n\neq 1, 1782$ and $\sigma(n)=(\gamma(n))^2$, then there exist odd (not necessarily distinct)…

Number Theory · Mathematics 2021-09-22 Tomohiro Yamada

This is a review of several results related to distribution of powers and combination of powers modulo 1. We include a proof that given a sequence of real numbers $\theta_n$, it is possible to get an $\alpha$ (given $\lambda \ne 0$), or a…

Number Theory · Mathematics 2013-12-23 Miguel A. Lerma

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

Number Theory · Mathematics 2021-08-03 Junyong Zhao , Shaofang Hong , Chaoxi Zhu

Let $g_1, \dots , g_M$ be additive functions for which there exist nonconstant polynomials $G_1, \dots , G_M$ satisfying $g_i(p) = G_i(p)$ for all primes $p$ and all $i \in \{1, \dots , M\}$. Under fairly general and nearly optimal…

Number Theory · Mathematics 2024-01-03 Akash Singha Roy

Let $F$ be a totally real field. We study the root numbers $\epsilon(1/2, \pi)$ of self-dual cuspidal automorphic representations $\pi$ of $\mathrm{GL}_{2N}/F$ with conductor $\mathfrak n$ and regular integral infinitesimal character…

Number Theory · Mathematics 2025-02-03 Rahul Dalal , Mathilde Gerbelli-Gauthier

In this work the generalized Collatz problem $qn+1$ ($q$ odd) is studied. As a natural generalization of the original $3n+1$ problem, it consists of a discrete dynamical system of an arithmetical kind. Using standard methods of number…

General Mathematics · Mathematics 2021-01-08 Robert Santos

Let $n\ge 5$ be an odd integer. It is shown that $\{1^{\sigma(1)},\ldots,n^{\sigma(n)}\}$ is a complete residue system modulo $n$ for some permutation $\sigma$ of $\{1,\ldots,n\}$ if and only if $\frac{1}{2}(n-1)$ is a Sophie Germain prime.…

Number Theory · Mathematics 2017-09-27 Paolo Leonetti
‹ Prev 1 4 5 6 7 8 10 Next ›