TOPICS
Search

Smarandache Near-to-Primorial Function


The Smarandache near-to-primorial function SNTP(n) is the smallest prime p such that p#-1, p#, or p#+1 is divisible by the positive integer n, where p# is the primorial of p. The value SNTP(n) exists iff one of the following conditions holds (Ashbacher 1996):

1. n is squarefree.

2. n is not squarefree and there exists a prime q<p such that n|(q#+/-1), where p is the least prime factor of n.

For example, SNTP(n) is undefined at n=4, 8, 9, 12, 16, 18, 20, 24, 25, 27, and 28, the initial squareful numbers (OEIS A013929), since none satisfies the second condition. For the squarefree arguments n=1, 2, 3, 5, 6, 7, 10, 11, ..., the first few values of SNTP(n) 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-Primorial 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 Resource. https://mathworld.wolfram.com/SmarandacheNear-to-PrimorialFunction.html

Subject classifications