TOPICS
Search

Smarandache Near-to-Primorial Function


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 (1996) 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<p such that n|(q#+/-1), where p is the smallest power contained in the factorization of n.

Therefore, SNTP(n) does not exist for the squareful numbers n=4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, ... (OEIS A013929). The first few values of SNTP(n), where defined, are 2, 2, 2, 3, 3, 3, 5, 7, ... (OEIS A046026).


See also

Primorial, Smarandache Function

Explore with Wolfram|Alpha

References

Ashbacher, C. "A Note on the Smarandache Near-To-Primordial Function." Smarandache Notions J. 7, 46-49, 1996.Mudge, M. R. "The Smarandache Near-To-Primorial Function." Abstracts of Papers Presented to the Amer. Math. Soc. 17, 585, 1996.Sloane, N. J. A. Sequences A013929 and A046026 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Smarandache Near-to-Primorial Function

Cite this as:

Weisstein, Eric W. "Smarandache Near-to-Primorial Function." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SmarandacheNear-to-PrimorialFunction.html

Subject classifications