PRIMALITY BETWEEN CONSECUTIVE PRIMORIALS

초록

In this paper, we consider a general number system with a base m in order to determine if a positive integer x is prime. We show that the base m providing the most efficient test is the primorial p(n)(sic) when p(n) (sic) < x < p(n+1)(sic) and establish a necessary and sufficient condition for x in between consecutive primorials to be determined as a prime number.

키워드