Skip to content
Preprint

An Asymptotic for Non-Wieferich Numbers

Oct 2026 · 0 citations · 10 references
Mathematics

Abstract

A cyclic number is a positive integer $n$ such that $\gcd(n, \varphi(n)) = 1$. Erd\H{o}s showed that the number of cyclic numbers up to $x$, $C(x)$, has $C(x) \sim e^{-\gamma}x/\log_3(x)$ asymptotically as $x$ tends to infinity. We define Wieferich numbers to be odd, positive integers $n$ such that $(n, (2^{\ell(n)}-1)/n)>1$, where $\ell(n)$ is the smallest positive integer with $2^{\ell(n)} \equiv 1 \mod n$. Franco and Pomerance showed that non-Wieferich numbers have density zero among the odd integers. We show that the counting function of $n \leq x$ in the symmetric difference of non-Wieferich numbers and cyclic numbers is $O(x/(\log_3(x))^2)$, under a mild assumption on the counting function of Wieferich primes.

View source

Similar papers

Preprint Sep 2026

On a Tur\'an's theorem for small primes

Denote by $\omega(n)$ the number of distinct prime divisors of the natural number $n$. In 2007, Granville and Soundararajan gave a quite new method to compute the higher moments $\sum_{n\leq x}(\omega(n)-\log\log x)^{k}$, for a wide range of integers $k\geq 2$. In this notes, we shall apply the method for $\omega_{z}(n...

T. Minamide, Haruka Sakai, Y. Tanigawa · 1 citation
Preprint Oct 2026

On a series related to the M\"obius function

For a natural number $n>1$ let $P^-(n)$ denote its smallest prime divisor. Alladi and Johnson proved that $\sum_{P^{-}(n)\equiv l \Mod{k}} \frac{\mu(n)\omega(n)}{n} = 0$ for $(l,k)=1$, and Tenenbaum showed that the partial sums of this series up to $X$ are $O_\varepsilon\bigl((\log\log X)^{5/3+\varepsilon}/\log X\bigr)...

Deep Thakur · 0 citations
Preprint Oct 2026

Bounds on the maximum denominator of fractional chromatic numbers

For a positive rational number $x=p/q$, where $p$ and $q$ are coprime positive integers, let $\operatorname{den}(x)=q$. For a positive integer $n$, let $\operatorname{sd}(n)=\max\{\operatorname{den}(\chi_f(G)): |V(G)|=n\}$. Let $D(n)=2^{-n}(n+1)^{(n+1)/2}$. It was proved by Alon, Tuza and Voigt that $\operatorname{sd}(...

Xin-Bo Xu, Xu-Ding Zhu · 0 citations
Preprint Sep 2026

Asymptotic Behavior of Iterated Sets of Remainders

For a positive integer $n$, let $$S_0(n)=\{1,2,\ldots,\lfloor n/2\rfloor\},\qquad S_{j+1}(n)=\{n\bmod k:k\in S_j(n)\setminus\{0\}\},$$ and put $s_j(n) := |S_j(n)|$. The sets defined above arise naturally in the study of the length of the Pierce series expansion of a rational number. In \cite{Ba-Vu}, Baraskar and Vukusi...

Omkar Baraskar, Prashant Gokhale, Sarvagya Jain et al. · 1 citation
Preprint Sep 2026

Distinct exponents in the prime factorization

Following Erd\H{o}s (1982) and Sanna (2019), we study the arithmetic function $h(n)$, which is defined to be the number of distinct exponents in the prime factorization of a positive integer $n$. Among other things, we show that $$ \sum_{n\leq x}h(\phi(n)) \asymp x\left(\frac{\log\log x}{\log\log\log x}\right)^{1/2}, $...

Mikhail R. Gabdullin, V. V. Iudelevich · 0 citations
Preprint Oct 2026

Antichains among Divisor Sums of Divisors

For a positive integer $n$, let $S(n)=\{\sigma(d): d\mid n\}$ be ordered by divisibility, and let $a(n)$ be its width. We study how much of the divisor lattice of $n$ survives under the map $d\mapsto \sigma(d)$. For every fixed prime-exponent pattern, the largest possible value of $a(n)$ is the width of a corresponding...

Felix Huber · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.