On a divisibility problem
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.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics of the Czech Academy of Science
2019-07-01
|
| Series: | Mathematica Bohemica |
| Subjects: | |
| Online Access: | http://mb.math.cas.cz/full/144/2/mb144_2_2.pdf |