SNTP(n) is the smallest prime such that p# - 1, p#, or p# + 1 is divisible by n, where p# is the primorial of p. Ashbacher shows that SNTP(n) only exists 1. If there are no square or higher powers in the factorization of n, or 2. If there exists a prime q

primorial | Smarandache function