A Fixed-Prime Criterion for Reciprocals in Missing-Digit Sets

TL;DR

This paper establishes a structural upper bound on the p-adic valuation of denominators of rationals in missing-digit sets, extending previous work and providing new finiteness criteria for reciprocals of various special sequences.

Contribution

It generalizes a key step in recent work to a broader class of sequences, offering explicit bounds and criteria for membership in missing-digit sets.

Findings

Derived explicit bounds on p-adic valuations of denominators.

Provided finiteness criteria for reciprocals intersecting missing-digit sets.

Applied results to superfactorials, polynomial products, and Fibonacci numbers.

Abstract

We prove a structural upper bound on the $p$-adic valuation of denominators of rationals belonging to a missing-digit set $K_{m,D}$, generalizing a key step in recent work of Lin, Wu, and Yang [arXiv:2603.24614] on reciprocals of factorials. For a rational $\frac{r}{Q}$ with $\gcd(Q,m)=1$ and a fixed prime $p_0\nmid m$, membership in $K_{m,D}$ forces $\nu_{p_0}(Q)$ to be controlled by the $p_0$-adic valuation of the multiplicative order of $m$ modulo the radical of $Q$, with explicit overhead depending only on $m$ and $D$. Because the obstruction is stated at the level of a single denominator, a pair of sequence-specific valuation estimates converts it into an effective finiteness criterion for $\left\{\frac{1}{a_n}:n\in\mathbb{N}\right\}\cap K_{m,D}$. Specializing to the case in which $Q$ is the part of $n!$ coprime to $m$ recovers the fixed-prime step in the Lin--Wu--Yang argument. As applications, we treat reciprocals of superfactorials, products of polynomial values, and products of Fibonacci numbers. We also exhibit an exponential family -- products of $(m^k-1)$ -- for which the full structural criterion applies but a coarser largest-prime-factor formulation does not.