On the distance between factorials and repunits
Acta Arithmetica
MSC: Primary 11D61
DOI: 10.4064/aa241115-29-7
Opublikowany online: 21 October 2025
Streszczenie
We show that if $n\ge n_0$ and $b\ge 2$ are integers, $p\ge 7$ is prime and $n!-(b^p-1)/(b-1)\ge 0$, then $n!-(b^p-1)/(b-1) \ge 0.5\log \log n/\log \log \log n$. Further results are obtained, in particular for the case $n!-(b^p-1)/(b-1) \lt 0$.
