Scientia Magna Vol. 4 (2008), No. 1, 35-38
On the Smarandache power function and Euler totient function Chengliang Tian and Xiaoyan Li Department of Mathematics, Northwest University Xi’an, Shaanxi, P.R.China Abstract For any positive integer n, let SP (n) denotes the Smarandache power function, and φ(n) is the Euler totient function. The main purpose of this paper is using the elementary method to study the solutions of the equation SP (nk ) = φ(n), and give its all positive integer solutions for k = 1, 2, 3. Keywords Smarandache power function, Euler totient function, equation, positive integer solutions.
§1. Introduction and Results For any positive integer n, the famous Smarandache power function SP (n) is defined as the smallest positive integer m such that mm is divisible by n. That is, Y Y SP (n) = min{m : n | mm , m ∈ N, p= p} p|m
p|n
where N denotes the set of all positive integers. For example, the first few values of SP (n) are: SP (1) = 1, SP (2) = 2, SP (3) = 3, SP (4) = 2, SP (5) = 5, SP (6) = 6, SP (7) = 7, SP (8) = 4, SP (9) = 3, SP (10) = 10, SP (11) = 11, SP (12) = 6, SP (13) = 13, SP (14) = 14, SP (15) = 15, SP (16) = 4, SP (17) = 17, SP (18) = 6, SP (19) = 19, SP (20) = 10, · · · . In reference [1], Professor F.Smarandache asked us to study the properties of SP (n). From the definition of SP (n) we can easily get the following conclusions: if n = pα , then p, 1 ≤ α ≤ p; 2 p , p + 1 ≤ α ≤ 2p2 ; p3 , 2p2 + 1 ≤ α ≤ 3p3 ; SP (n) = ··· ··· α p , (α − 1)pα−1 + 1 ≤ α ≤ αpα . αr 1 α2 Let n = pα 1 p2 · · · pr denotes the factorization of n into prime Ypowers. Y If αi ≤ pi for all αi (i = 1, 2, · · · , r), then we have SP (n) = U (n), where U (n) = p, denotes the product p|n
p|n
over all different prime divisors of n. It is clear that SP (n) is not a multiplicative function. For example, SP (3) = 3, SP (8) = 4, SP (24) = 6 6= SP (3) × SP (8). But for most n we have SP (n) = U (n).