Answers are grounded in this paper and cite their sources.
Let \(a(n)\) be the least prime \(p\) for which \( 10^n/p\) is prime, and let \(b(n)= 10^n/a(n)\) when such a denominator exists; \(b(n)\) is OEIS A090520. We prove from first principles that \(b(n)>0\) for every \(n≥1\), resolving the nonvanishing conjecture recorded for the sequence. We characterize \(b(n)\) as the largest prime quotient whose quotient fiber contains a prime denominator. An explicit theorem of Dusart on primes in short intervals yields a uniform family of occupied quotient fibers and, in particular, \[ n→∞b(n)/(nlog 10)^3≥1. \] Consequently \(b(n)→∞\), and the denominator–quotient relation gives \(a(n)b(n)~10^n\). We also prove a contrasting smallness phenomenon. If \[ L(K)=lcm\{p-1:p≤ K,\ p prime\}, \] then every positive multiple \(n\) of \(L(K)\) satisfies \(b(n)<10^n/K\) for \(K≥5\). Hence every fixed relative threshold is crossed on a set of positive lower density and \[ n→∞b(n)/10^n=0. \] A standard upper-bound sieve estimate for \(L(K)\) sharpens this along a subsequence to \[ n→∞b(n)log n/10^n=0. \] Finally, a quotient-fiber transfer argument combined with Jia's exceptional-set theorem for primes in almost all short intervals shows that, for every fixed \(0<β<19/39\), \[ b(n)=ω(10β n), \] and therefore \[ n→∞{log₁₀b(n)}{n}≥19/39. \] All infinite statements are proved analytically and do not depend on finite computation.
No takes yet. Share an insight, caveat, or question.
Lien-Hung Su (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: