Let a(n) be the least inverse of the Smarandache function, that is, the least positive integer for m for which S(m) = n. In other words. a(n) is the position of the first occurrence of the integer n in the sequence S(1), S(2), … , S(k),….
Show that a(p) = p whenever p is prime.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.