On a divisibility problem
Shichun Yang, Florian Luca, Alain Togbé
Mathematica Bohemica · 2019
doi:10.21136/mb.2018.0058-17 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Let $p_1, p_2, \cdots$ be the sequence of all primes in ascending order. Using explicit estimates from the prime number theory, we show that if $ k \geq5 $, then (p_{k+1}-1)! \mid(\tfrac12 (p_{k +1} - 1))! p_ k!, which improves a previous result of the second author.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.