|
|||||
|
|
On the primality of |
|
| Authors: | Chris K Caldwell Yves Gallot |
| Institution: | Department of Mathematics and Computer Science, University of Tennessee at Martin, Martin, Tennessee 38238 ; Department of Mathematics and Computer Science, University of Tennessee at Martin, Martin, Tennessee 38238 |
| Abstract: | For each prime |
| Keywords: | Prime numbers factorial primes primality proving algorithms |
| 点击此处可从《Mathematics of Computation》浏览原始摘要信息 | |
| 点击此处可从《Mathematics of Computation》下载免费的PDF全文 | |
, let 
be the product of the primes less than or equal to 
. We have greatly extended the range for which the primality of 
and 
are known and have found two new primes of the first form ( 
) and one of the second (
). We supply heuristic estimates on the expected number of such primes and compare these estimates to the number actually found.