Math. Sci. Lett. 3, No. 3, 249-253 (2014) 249 Mathematical Sciences Letters An International Journal http://dx.doi.org/10.12785/msl/030318 Generalized Perfect Numbers Connected with Arithmetic Functions Azizul Hoque∗ and Himashree Kalita Department of Mathematics, Gauhati University, Guwahati, 781014, India Received: 13 Apr. 2014, Revised: 24 May 2014, Accepted: 26 May 2014 Published online: 1 Sep. 2014 Abstract: In this paper, we obtain some new results for perfect numbers and generalized perfect numbers connected with the relationship among arithmetic functions σ, φ and ψ. These arithmetic functions and their compositions play vital role in this work. Keywords: Perfect number, Superperfect number, k-hyperperfect number, Super-hyperperfect number, Arithmetic functions. 1 Introduction been checked without success [2]. Recently T. Goto, Y. Ohno [3], D. Ianucci [5,6], K. G. Hare [4] established For a natural number n, we denote the sum of positive several results on odd perfect numbers. A positive integer σ n is called superperfect number if σ(σ(n)) = 2n. The divisors of n by (n) = ∑d|n d and the sum of proper positive divisors of n by ρ(n) = σ(n) − n. A natural notion of these numbers was introduced by D. ρ Suryanarayana [11] in 1969. Even superperfect numbers number n is called a perfect number if (n) = n or p−1 p equivalently σ(n)= 2n. The first few perfect numbers are are of the form 2 , where 2 − 1 is a Mersenne prime. 6, 28, 496, 8128..... (Sloanes A000396 [13]). Euclid The first few superperfect numbers are 2, 4, 16, 64, 4096, discovered that the first four perfect numbers are 65536, 262144..... It is not known whether there are any generated by the formula 2n−1(2n − 1) about 300 B.C. odd superperfect numbers. An odd superperfect number n [8]. He also noticed that 2n 1 is a prime number for would have to be a square number such that either n or − σ every instance, and in Proposition IX.36 of Elements (n) is divisible by at least three distinct primes [7]. gave the proof, that the discovered formula gives an even perfect number whenever 2n − 1 is prime. In order for 2n − 1 to be a prime, n must itself to be a prime. A A positive integer n is called k-hyperperfect number if p k + 1 k − 1 Mersenne prime is a prime number of the form 2 − 1, σ(n)= n + . On can remark that a number is where p must also be a prime number. Any even perfect k k perfect iff it is 1-hyperperfect. The concept of number n is of the form n = 2p−1(2p − 1), where 2p − 1 is a Mersenne prime. Perfect numbers are intimately k-hyperperfect number was given by Minoli and Bear connected with these primes, since there is a concrete [10] and they also conjecture that there are k-hyperperfect numbers for every k. All hyperperfect numbers less than one-to-one association between even perfect numbers and 11 Mersenne primes. The fact that Euclids formula gives all 10 have been computed by J.S. Craine [9]. Bege and Fogarasi [1] introduced the concept of super-hyperperfect possible even perfect numbers was proved by Euler two millennia after the formula was discovered. There are number. A positive integer n is called super-hyperperfect k + 1 k − 1 only 48 known Mersenne primes (2013 [12]) and hence number if σ(σ(n)) = n + . They have k k only 48 even perfect numbers are known. There is a conjectured that all super-hyperperfect numbers are of the conjecture that there are infinitely many perfect numbers. 3p − 1 The search for new ones is to keep on going by search form 3p−1, where p and are primes. For any 2 program via the Internet; named GIMPS (Great Internet natural number n, Eulers phi-function and Dedekinds Mersenne Prime Search). It is not known if any odd 1 300 Arithmetic function are given by φ(n)= n∏ (1 − ) perfect number exists, although numbers up to 10 have p|n p ∗ Corresponding author e-mail: [email protected] c 2014 NSP Natural Sciences Publishing Cor. 250 A. Hoque, H. Kalita: Generalized Perfect Numbers Connected with... 1 and ψ(n) = n∏ (1 + ) respectively, where p runs Hence the theorem follows. p|n p through the distinct prime divisors of n. Corollary 2.4. If k > 1,1 + 2 + 4 + 8 + ... + k = 2k − 1, where 2k − 1 is a prime and k(2k − 1) is a perfect number, then 2 Main Results (2φ)n ◦(φ ◦ψ)(k(2k−1)) = (φ ◦2ψ)n ◦(φ ◦ψ)(k(2k−1)), Theorem 2.1. If k > 1,1 + 2 + 4 + 8 + ... + k = 2k − 1, where 2k − 1 is a prime and k(2k − 1) is a perfect number, n ≥ 0 then (φ ◦ ψ ◦ σ)(k(2k − 1)) = 2(φ ◦ ψ)(k(2k − 1)). Proof: It is clear that (k,2k − 1)= 1, and k is even and of Theorem 2.5. If k > 1,1 + 2 + 4 + 8 + ... + k = 2k − 1, the form 2n,n ≥ 1. Since both φ and ψ are multiplicative where 2k − 1 is a prime and k(2k − 1) is a perfect number, ψn n−1 2 functions, then (k(2k − 1)) = 3.2 k , n ≥ 1. (φ ◦ ψ ◦ σ)(k(2k − 1)) = φ(ψ(σ(k(2k − 1)))) Proof: It is clear that (k,2k − 1)= 1, and k is even and of m ψ = φ(ψ(2k(2k − 1))) the form 2 , m ≥ 1. Since is multiplicative function, = φ(ψ(2k)ψ(2k − 1)) ψ(k(2k − 1)) = ψ(k)ψ(2k − 1)= 3k2 = φ(2k(1 + 1/2)2k) 2 = 2.2k (1 − 1/2) Thus the result is true for n = 1. = 2k2 (1) Suppose the result is true for n > 1. Then ψn(k(2k − 1)) = 3.2n−1k2 Also Now (φ ◦ ψ)(k(2k − 1)) = φ(ψ(k(2k − 1))) = φ(ψ(k)ψ(2k − 1)) ψn+1(k(2k − 1)) = ψ(3.2n−1k2) = φ(k(1 + 1/2)2k) = ψ(3.22m+n−1), = φ(3k2) = ψ(3)ψ(22m+n−1) = φ(3φ(k2)) = k2 (2) = 4.22m+n−1(1 + 1/2) (1)and (2) give the result. = 3.22m+n = 3.2nk2 Theorem 2.2. If k > 1,1 + 2 + 4 + 8 + ... + k = 2k − 1, where 2k − 1 is a prime and k(2k − 1) is a perfect number, Hence the theorem follows. φ n φ ψ 2 then (2 ) ( ( (k(2k − 1)))) = k , n ≥ 0. Theorem 2.6. For any even perfect number n, Proof: We prove the result by applying induction on n. (φ ◦ σ)(n) (φ ◦ ρ)(n)= By equation ( 2 ), the result is true for n = 0. Lets assume 2 the result is true for any positive integer n > 0. Then p−1 p 2φ n φ ψ k 2k 1 k2 Proof An even perfect number n is of the form 2 (2 − ( ) ( ( ( ( − )))) = p Now, 1), where 2 − 1 is a Mersenne prime. Now (2φ)n+1(φ(ψ(k(2k − 1)))) = 2φ((2φ)n(φ(ψ(k(2k − 1))))) = 2φ(k2) (By hypothesis) (φ ◦ ρ)(n)= φ(ρ(n)) = φ(n)= φ(2p−1(2p − 1)) 2 2 1 = 2k (1 − 1/2)= k = 2p−1(1 − )(2p − 2) Hence the theorem follows. 2 = 2p−1(2p−1 − 1) Theorem 2.3. If k > 1,1 + 2 + 4 + 8 + ... + k = 2k − 1, where 2k − 1 is a prime and k(2k − 1) is a perfect number, Again, then (φ ◦ 2ψ)n ◦ (φ ◦ ψ)(k(2k − 1)) = k2, n ≥ 0. Proof: We prove the result by applying induction on n. By (φ ◦ σ)(n)= φ(σ(n)) = φ(2n)= φ(2p(2p − 1)) equation (2), the result is true for n = 0. Lets assume the 1 result is true for n > 0. Then = 2p(1 − )(2p − 2) (φ ◦ 2ψ)n ◦ (φ ◦ ψ)(k(2k − 1)) = k2 2 p p−1 Now = 2 (2 − 1) φ ψ n+1 φ ψ ( ◦ 2 ) ◦ ( ◦ )(k(2k − 1)) (φ ◦ σ)(n) φ ψ φ ψ n φ ψ Thus (φ ◦ ρ)(n)= = ( ◦ 2 )(( ◦ 2 ) ◦ ( ◦ )(k(2k − 1))) 2 φ ψ 2 = (2 (k )) (By hypothesis) Theorem 2.7. If n = pk−1(pk − p + 1) where p and pk − = φ(3k2)= k2 p + 1 are primes, then n is (p − 1)-hyperperfect number. c 2014 NSP Natural Sciences Publishing Cor. Math. Sci. Lett. 3, No. 3, 249-253 (2014) / www.naturalspublishing.com/Journals.asp 251 Proof: From definition and basic results of the divisor (3) and(5) give, function σ, it follows that: 1 m + p − 1 k−1 k ψ(n) = (1 − )( )σ(n) (6) σ(n)= σ(p )σ(p − p + 1) p2 m + p − 2 pk − 1 (4) and(5) give, = (pk − p + 2) p − 1 (p − 1)(m − 1) pk(pk − p + 1)+ p − 2 φ(n)= ψ(n) (7) = (p + 1)(m + 1) p − 1 (6) and(7)give, p p − 2 = pk−1(pk − p + 1)+ p − 1 p − 1 (p − 1)(m − 1) 1 m + p − 1 p p − 2 φ(n)= (1 − )( )σ(n) = n + 2 p − 1 p − 1 (p + 1)(m + 1) p m + p − 2 This gives, Hence n is (p − 1)-hyperperfect number. p m + 1 m + p − 2 σ(n) = ( )2( )( )φ(n) (8) We generalize conjecture 2 introduced by Antal Bege and p − 1 m − 1 m + p − 1 Kinga Fogarasi in [1] as follows: Conjecture 1. All (p−1)-hyperperfectnumbers are of the For 2-hyperperfect number n, and m = 3k − 2, one can form n = pk−1(pk − p + 1), where p and pk − p + 1 are easily obtain the following result as a particular case of the theorem 2.8.