Arithmetic Bias in the Distribution of Mersenne Prime Exponents and the Divisor Structure of p-1
UNED（西班牙国立远程教育大学）
Jesus Dominguez
备注：
Revised version (39 pages, 15 tables). The structural model and its limitations have been clarified and the presentation streamlined. An error in the reproducibility archive added in v6 has been corrected without affecting the reported results
The classical Wagstaff heuristic models the primality of $M_p=2^p-1$ primarily through the size of the prime exponent $p$, at the aggregate scale $C\log p/p$. We test whether the divisor structure of $p-1$ produces detectable secondary variation, using $S(p)=\logτ(p-1)/\log\log p$. Known Mersenne-prime exponents $p\ge13$ show systematically elevated values of $S$ relative to nearby prime exponents. In the population-level Wagstaff-balanced design over all $5{,}761{,}450$ prime exponents $13\le p<10^8$, $32$ of the $47$ known cases lie in the higher-$S$ regions; the exact conditional randomization gives the two-sided reference value $p_{\mathrm{two}}=0.0115$.
We develop a structural model from the cyclotomic and residue constraints generated by the divisors of $p-1$. Within a declared factorwise representation, its local response is determined by the exact modular geometry, while subsequent effective aggregation remains model-dependent and transmission to primality is heuristic. The modular census is constructed without using $S(p)$ or $τ(p-1)$ as summary predictors and without using Mersenne-prime labels. Applied to the same population, it gives a higher-$S$ allocation of $28.61$ on the conditioned 47-case scale, compared with $23.5$ under the balanced Wagstaff reference. A low-dimensional reduction with reference anchoring gives $32.28$, close to the $32$ observed. This agreement provides a quantitative consistency check for the structural model. For the prospectively fixed interval $10^8\le p<10^9$, the same global reduction assigns a conditioned higher-$S$ share of $73.88\%$.
The only (unitary) perfect polynomials over $\mathbb{F}_2$ that are products of $x$, $x+1$ and Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$. Other consequences of such a factorization are new results about odd perfect polynomials.
We address an arithmetic problem in the ring $\F_2[x]$ related to the fixed points of the sum of divisors function. We study some binary polynomials $A$ such that $σ(A)/A $ is still a binary polynomial. Technically, we prove that the only (unitary) perfect polynomials over $\F_2$ that are products of $x$, $x+1$ and of Mersenne primes are precisely the nine (resp. nine "classes") known ones. This follows from a new result about the factorization of $M^{2h+1} +1$, for a Mersenne prime $M$ and for a positive integer $h$.
We investigate various questions concerning the reciprocal sum of divisors, or prime divisors, of the Mersenne numbers $2^n-1$. Conditional on the Elliott-Halberstam Conjecture and the Generalized Riemann Hypothesis, we determine $\max_{n\le x} \sum_{p \mid 2^n-1} 1/p$ to within $o(1)$ and $\max_{n\le x} \sum_{d\mid 2^n-1}1/d$ to within a factor of $1+o(1)$, as $x\to\infty$. This refines, conditionally, earlier estimates of Erdős and Erdős-Kiss-Pomerance. Conditionally (only) on GRH, we also determine $\sum 1/d$ to within a factor of $1+o(1)$ where $d$ runs over all numbers dividing $2^n-1$ fo…
We get some results about the factorization of $ϕ_p(M) \in {\mathbb{F}}_2[x]$, where $p$ is a prime number, $ϕ_p$ is the corresponding cyclotomic polynomial and $M$ is a Mersenne prime (polynomial). By the way, we better understand the factorization of the sum of the divisors of $M^{2h}$, for a positive integer $h$.
Let $(M_n)_{n\geq0}$ be the Mersenne sequence defined by $M_n=2^n-1$. Let $ω(n)$ be the number of distinct prime divisors of $n.$ In this short note, we present a description of the Mersenne numbers satisfying $ω(M_n)\leq3$. Moreover, we prove that the inequality, given $ε>0$, $ω(M_n)> 2^{(1-ε)\log\log n} -3 $ holds for almost all positive integers $n$. Besides, we present the integer solutions $(m,n,a)$ of the equation $M_m+M_n=2p^a$ with $m,n\geq2$, $p$ an odd prime number and $a$ a positive integer.
We introduce a new class of pseudoprimes-so called "overpseudoprimes" which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime iff value of h(n) is invariant of all divisors d>1 of n. In particular, we prove that all composite Mersenne numbers 2^p-1,where p is prime, and squares of Wieferich primes are overpseudoprimes. We give also a generalization of the results on arbitrary base a>1 and prove that every overpseudoprime is strong pseudoprime of the same base.
We introduce a new class of pseudoprimes-so called "overpseudoprimes to base $b$", which is a subclass of strong pseudoprimes to base $b$. Denoting via $|b|_n$ the multiplicative order of $b$ modulo $n$, we show that a composite $n$ is overpseudoprime if and only if $|b|_d$ is invariant for all divisors $d>1$ of $n$. In particular, we prove that all composite Mersenne numbers $2^{p}-1$, where $p$ is prime, are overpseudoprime to base 2 and squares of Wieferich primes are overpseudoprimes to base 2. Finally, we show that some kinds of well known numbers are overpseudoprime to a base $b$.
An integer $n$ is said to be \textit{arithmetic} if the arithmetic mean of its divisors is an integer. In this paper, using properties of the factorization of values of cyclotomic polynomials, we characterize arithmetic numbers. As an application, in Section 2, we give an interesting characterization of Mersenne numbers.
The divisor function $σ(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for $ν_{p}(σ(n))$ are established. For $p=2$, these involve only the odd primes dividing $n$. These expressions are used to establish the bound $ν_{2}(σ(n)) \leq \lceil\log_{2}(n) \rceil$, with equality if and only if $n$ is the product of distinct Mersenne primes, and for an odd prime $p$, the bound is $ν_{p}(σ(n)) \leq \lceil \log_{p}(n) \rceil$, with equality related to solutions…
We prove a result on the distribution of the general divisor functions in arithmetic progressions to smooth moduli which exceed the square root of the length.
Iannucci considered the positive divisors of a natural number $n$ that do not exceed the square root of $n$ and found all numbers whose such divisors are in arithmetic progression. Continuing the work, we define large divisors to be divisors at least $\sqrt{n}$ and find all numbers whose large divisors are in arithmetic progression. The asymptotic formula for the count of these numbers up to a bound $x$ is observed to be $\frac{x\log\log x}{\log x}$.
Given positive integers a,b,c and d such that c and d are coprime we show that the primes p=c(mod d)dividing a^k+b^k for some k>=1 have a natural density and explicitly compute this density. We demonstrate our results by considering some claims of Fermat that he made in a 1641 letter to Mersenne.
Iannucci considered the positive divisors of a natural number $n$ that do not exceed $\sqrt{n}$ and found all forms of numbers whose such divisors are in arithmetic progression. In this paper, we generalize Iannucci's result by excluding the trivial divisors $1$ and $\sqrt{n}$ (when $n$ is a square). Surprisingly, the length of our arithmetic progression cannot exceed $5$.
By using the $q$-analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus $q$. We show that the expected asymptotic formula holds for a larger range of $q$ than was previously known, provided that $q$ has a certain factorisation.
Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.
We study the average value of the divisor function $τ(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}$. We show how to go past this barrier when $q=p^k$ for odd primes $p$ and any fixed integer $k\ge 7$.
We prove the analogue of an identity of Huard, Ou, Spearman and Williams and apply it to evaluate a variety of sums involving divisor functions in two variables. It turns out that these sums count representations of positive integers involving radicals.
We obtain several asymptotic estimates for the sums of the restricted divisor function $$ τ_{M,N}(k) = #\{1 \le m \le M, \ 1\le n \le N: mn = k\} $$ over short arithmetic progressions, which improve some results of J. Truelsen. Such estimates are motivated by the links with the pair correlation problem for fractional parts of the quadratic function $αk^2$, $k=1,2,...$ with a real $α$.
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 particular, we break the classical barrier $q \le x^{2/3}$ for such formulas, and generalise a recent result of R.~Khan (2015), making it uniform in $k$.
We study the variance of sums of the $k$-fold divisor function $d_k(n)$ over sparse arithmetic progressions, with averaging over both residue classes and moduli. In a restricted range, we confirm an averaged version of a recent conjecture about the asymptotics of this variance. This result is closely related to moments of Dirichlet $L$-functions and our proof relies on the asymptotic large sieve.
We prove that for a large class of multiplicative functions, referred to as generalized divisor functions, it is possible to find a lower bound for the corresponding variance in arithmetic progressions. As a main corollary, we deduce such a result for any $α$-fold divisor function, for any complex number $α\not\in \{1\}\cup-\mathbb{N}$, even when considering a sequence of parameters $α$ close in a proper way to $1$. Our work builds on that of Harper and Soundararajan, who handled the particular case of $k$-fold divisor functions $d_k(n)$, with $k\in\mathbb{N}_{\geq 2}$.
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.
Complete characterization of $2$-near perfect numbers with exactly 2 prime factors
University of Notre Dame（圣母大学）；Yale University（耶鲁大学）；California Institute of Technology（加州理工学院）；Massachusetts Institute of Technology（麻省理工学院）；Hopkins School（霍普金斯中学）
Let $\gcd(d_{1},\ldots,d_{k})$ be the greatest common divisor of the positive integers $d_{1},\ldots,d_{k}$, for any integer $k\geq 2$, and let $τ$ and $μ$ denote the divisor function and the Möbius function, respectively. For an arbitrary arithmetic function $g$ and for any real number $x>5$ and any integer $k\geq 3$, we define the sum $$ S_{g,k}(x) :=\sum_{n\leq x}\sum_{d_{1}\cdots d_{k}=n} g(\gcd(d_{1},\ldots,d_{k})) $$ In this paper, we give asymptotic formulas for $S_{τ,k}(x)$ and $S_{μ,k}(x)$ for $k\geq 3$.
The integer $d$ is called an exponential divisor of $n=\prod_{i=1}^r p_i^{a_i}>1$ if $d=\prod_{i=1}^r p_i^{c_i}$, where $c_i \mid a_i$ for every $1\le i \le r$. The integers $n=\prod_{i=1}^r p_i^{a_i}, m=\prod_{i=1}^r p_i^{b_i}>1$ having the same prime factors are called exponentially coprime if $(a_i,b_i)=1$ for every $1\le i\le r$. In the paper we investigate asymptotic properties of certain arithmetic functions involving exponential divisors and exponentially coprime integers.
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values of $m$ belong to any given infinite arithmetic progression $an+b$. We prove if $a$ is relatively prime to $b$ and order of $b$ modulo $a$ is relatively prime to $k$ then there exist infinitely many natural numbers $n$ such that sum of divisors of $an+b$ is a perfect $k$th power. We also prove that, in general, either sum of divisors of $an+b$ is not a perfec…
We extend the necessity part of Lucas Lehmer iteration for testing Mersenne prime to all base and uniformly for both generalized Mersenne and Wagstaff numbers(the later correspond to negative base). The role of the quadratic iteration $x \rightarrow x^2-2$ is extended by Chebyshev polynomial $T_n(x)$ with an implied iteration algorithm because of the compositional identity $T_n(T_m(x))=T_{nm}(x)$. This results from a Chebyshev polynomial primality test based essentially on the Lucas pair $(ω_a,\overlineω_a)$, $ω_a=a+\sqrt{a^2-1}$, where $a \neq 0 \pm 1$. It seems interesting that the arithmeti…
We compute the variances of sums in arithmetic progressions of generalised k-divisor functions related to certain L-functions in $\mathbb{F}_q(t)$, in the limit as $q\to\infty$. This is achieved by making use of recently established equidistribution results for the associated Frobenius conjugacy classes. The variances are thus expressed, when $q\to\infty$, in terms of matrix integrals, which may be evaluated. Our results extend those obtained previously in the special case corresponding to the usual $k$-divisor function, when the L-function in question has degree one. They illustrate the role …
We consider very general "random integers" and (attempt to) prove that many multiplicative and additive functions of such integers have limiting distributions. These integers include, for instance, the curvatures of Apollonian circle packings, trace of Frobenius elements for elliptic curves, the Ramanujan tau-function, Mersenne numbers, and many others.
In this paper, we confirm a smoothed version of a recent conjecture on the variance of the k-fold divisor function in arithmetic progressions to individual composite moduli, in a restricted range. In contrast to a previous result of Rodgers and Soundararajan, we do not require averaging over the moduli. Our proof adapts a technique of S. Lester who treated in the same range the variance of the k-fold divisor function in the short intervals setting, and is based on a smoothed Voronoi summation formula but twisted by multiplicative characters. The use of Dirichlet characters allows us to extend …
We compute the divisors of Borcherds products on integral models of orthogonal Shimura varieties. As an application, we obtain an integral version of a theorem of Borcherds on the modularity of a generating series of special divisors.
Let K be a number field, let f(x) in K(x) be a rational function of degree d> 1, and let z in K be a wandering point such that f^n(z) is nonzero for all n > 0. We prove that if the abc-conjecture holds for K, then for all but finitely many positive integers n, there is a prime p of K such that p | f^n(z) and p does not divide f^m(z) for all positive integers m < n. We prove the same result unconditionally for function fields of characteristic 0 when f is not isotrivial.
We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by the minor arc contribution in the circle method, which we lower bound by comparing with suitable auxiliary exponential sums that are easier to understand. As an application, we prove a lower bound of $(1-ε) QN\log(Q^2/N)$ for the variance of the von Mangoldt function $(Λ(n))_{n=1}^{N}$, on the range $\sqrt{N} (\log N)^C \leq Q \leq N$. Previously such a resul…
We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function, the Dedekind function, the sum-of-divisors function, the divisor function, the gcd-sum function. We also consider analogs of these functions, which are associated to unitary and exponential divisors, and other special functions. Some of our results improve the error terms obtained by Bordellès and Cloitre. We formulate certain open problems.
We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must have density zero, regardless of choice of a_0. The proof relies on tools from group theory and probability theory to develop a zero-density criterion in terms of arithmetic properties of the forward orbit of the critical point of f. This provides an analogy to results in real and complex dynamics, where analytic properties of the forward orbit of the critica…
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 were averaged over all progression of a given modulus. The method uses a short divisor sum approximation for the von Mangoldt function, together with some new results for binary correlations of this divisor sum approximation in arithmetic progressions.
We obtain several asymptotic formulas for the sum of the divisor function $τ(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x^{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x^{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 0$. Our method builds on an approach due to Blomer (2008) …
This paper is about the arithmetic of Kudla-Rapoport divisors on Shimura varieties of type GU(n-1,1). In the first part of the paper we construct a toroidal compactification of N. Kramer's integral model of the Shimura variety. This extends work of K.-W. Lan, who constructed a compactification at unramified primes. In the second, and main, part of the paper we use ideas of Kudla to construct Green functions for the Kudla-Rapoport divisors on the open Shimura variety, and analyze the behavior of these functions near the boundary of the compactification. The Green functions turn out to have loga…
In this paper, we study twisted arithmetic divisors on the modular curve X_0(N) with N square-free. For each pair (Δ, r) where Δ>0 and Δ\equiv r^2 \mod 4N, we constructed a twisted arithmetic theta function ϕ_{Δ, r}(τ) which is a generating function of arithmetic twisted Heegner divisors. We prove the modularity of ϕ_{Δ, r}(τ), along the way, we also identify the arithmetic pairing \langle ϕ_{Δ, r}(τ),\widehatω_N \rangle with special value of some Eisenstein series, where \widehatω_N is a normalized metric Hodge line bundle.
In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $φ$, Dedekind function $Ψ$, sum-of-divisors function $σ$ or the alternating sum-of-divisors function $β.$ We improve previous results when $f=φ$ and derive new estimates when $f=Ψ, f=σ$ and $f=β.$
Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^mτ_k$, where $τ_k$ is a $k$-dimensional divisor function and $E^m$ stands for the $m$-fold iterate of $E$. We estimate the error terms of $\sum_{n\le x} E^mτ_k(n)$ for various combinations of $m$ and $k$. We also study properties of $E^mf$ for arbitrary $f$ and sufficiently large $m$. Our study provides a unified approach to functions with exponential divisors. We improve special cases of the Dir…
We introduce the notion of $ε$-irreducibility for arithmetic cycles meaning that the degree of its analytic part is small compared to the degree of its irreducible classical part. We will show that for every $ε>0$ any sufficiently high tensor power of an arithmetically ample hermitian line bundle can be represented by an $ε$-irreducible arithmetic divisor. Our methods of proof also allow us to study the distribution of divisors of small sections of an arithmetically ample hermitian line bundle $\overline{\mathcal{L}}$. We will prove that for increasing tensor powers $\overline{\mathcal{L}}^{\o…
