DOCSLIB.ORG

Available Online Through ISSN 2229 – 5046

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Available Online Through ISSN 2229 – 5046 International Journal of Mathematical Archive-4(6), 2013, 118-123 Available online through www.ijma.info ISSN 2229 – 5046 SOME ASPECTS OF PERFECT AND GENERALIZED PERFECT NUMBERS Bhabesh Das* Department of Mathematics, Gauhati University, Guwahati-781014, Assam, India (Received on: 23-04-12; Revised & Accepted on: 20-05-13) ABSTRACT In this paper, some new results for perfect and generalized perfect numbers are derived. Arithmetic functions like the Dedekind’s function ψ, the divisor function , Euler’s totient function φ and their compositions play a significant role in our results. Mathematics Subject Classification: 11A25, 11A41, 11Y70. Keywords: perfect number, 2-hyperperfect number, super-hyperperfect number, superperfect number, triangular number. 1. INTRODUCTION Let (n) be the sum of positive divisors of n, i.e (n) = | and T(n) be the sum of aliquot parts of n , i.e. the positive divisors of n other than n itself, so that T(n) = (n) – n. A natural number n is called a perfect number if T(n) = n or equivalently (n) = 2n. The first few perfect numbers∑ are 6, 28, 496, 8128..... Euclid discovered the first four perfect numbers which are generated by the formula 2 1(2 1) about 300 B.C [8], where (2 1) is a prime. A Mersenne prime is a prime number of the form 2 1, −where p must also be a prime 1 number. Any even perfect number n is of the form n = 2 (2 1) , where 2 1 is a Mersenne− prime. Only 47 Mersenne primes− are known by now (2010[1]), which means− that there are 47 known − even perfect numbers. There is a conjecture that there are infinitely many perfect numbers. The search− for new ones− is to keep on going by search program via the Internet; named GIMPS (Great Internet Mersenne Prime Search). It is not known if any odd perfect number exists, although numbers up to 10300 have been checked without success [2]. There are some results concerning the odd perfect numbers, (i) Any odd perfect number must be of the form 12m + 1 or 36m + 9 (ii) If n is an odd perfect number, it has the form: n = qkp2e... r2f, where q, p,.. ,r are distinct primes and q ≡ k ≡ 1 (mod 4). [5] A positive integer n is said to be a harmonic number if harmonic mean of its divisors is an integer. In 1948 Norwegian mathematician Oystein Ore proved that every perfect number is an Ore harmonic number. ( +1) If positive integer k is a triangular number, then k must be of the form , n . Every even perfect number is a 2 ℕ triangular number. Even perfect numbers end with 6 or 8. ∈ For any n 1, Euler’s phi-function and Dedekind’s Arithmetic function are given by ≥ 1 1 ɸ(n) = | 1 and ψ(n) = | 1 + respectively, ∏ � − � ∏ � � where p runs through the distinct prime divisors of n. Let by convention, φ (1) = 1, ψ(1) = 1. -k Arithmetic function σk(n) is defined as σk(n) = | and σ1(n) = σ (n), and σ-k(n) = n σk(n) for any n ℕ. An Arithmetic function f is said to be a multiplicative∑ function if f(m.n) = f(m)f(n), where g.c.d (m, n) =∈ 1. Functions , φ, σk, and ψ are all multiplicative arithmetic functions. Corresponding author: Bhabesh Das* Department of Mathematics, Gauhati University, Guwahati-781014, Assam, India International Journal of Mathematical Archive- 4(6), June – 2013 118 Bhabesh Das*/Some Aspects of Perfect and Generalized Perfect Numbers/ IJMA- 4(6), June-2013. A positive integer n is called a superperfect number if ( ( ))= 2n. D. Suryanarayana introduced the notation of superperfect number in [11]. Even superperfect numbers are of the form 2 1, where 2 1 is a Mersenne prime. The first few superperfect numbers are 2, 4, 16, 64, 4096, 65536 , 262144..... It− is not known whether there are any odd superperfect numbers. An odd superperfect number n would have to be a square number− such that either n or σ(n) is divisible by at least three distinct primes [7]. 3 1 A positive integer n is called super-hyperperfect number if ( ) = + . 2 2 The first few super-hyperperfect numbers are 9, 729, 531441.... �In [1]� the author conjectured that if n = 3 1, where p 3 1 − and are primes, then n is a super-hyperperfect number. 2 − In [9] Minoli and Bear introduced the concept of k-hyperperfect numbers and they conjectured that there are k- +1 1 hyperperfect numbers for every k. A positive integer n is called k- hyperperfect number if ( ) = n + . A number is a perfect number if and only if it is a 1-hyperperfect number. In [1] A. Beg studied different k -hyperperfect− 3 1 numbers. For any 2-hyperperfect number n, ( ) = n + . The first few 2-hyperperfect numbers are 21, 2133, 2 2 19521....... In [1] the author conjectured that all 2-hyperperfect numbers are of the form n = 3 1(3 2), where 3 2 is prime. A positive integer n is called a quasiperfect number if ( ) = 2n + 1 [6]. No quasiperfect− numbers have been found so far, but if a quasiperfect number exists, it must be an odd square number greater than −1035and have at− least seven distinct prime factors [4]. A divisor d of a number n is said to be unitary divisor if g.c.d (n, ) = 1. A positive integer n is called unitary perfect number if (n) = 2n, where (n) denotes the sum of unitary divisors of n. In [10] the author proved that there are no odd unitary∗ perfect numbers. ∗A positive integer n is said to be a unitary super perfect number (USP) if ( (n)) = 2n. The first few USP numbers are 2, 9, 165, 238,....Thus there are both even and odd USPs [12]. ∗ ∗ σ(n) The function h defined by h(n) = is called index of n. h(n) is a unbounded and multiplicative function. A positive integer n is a perfect number if and only h(n) = 2. The function h takes larger value than 1 for all n > 1. If h(n) < 2, then the number n is called deficient number. If h(n) > 2, then the number n is called abundant number. 2. MAIN RESULTS In this section we prove our main results on perfect and generalized perfect numbers. Proposition 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, then ψ(k[2k 1]) = 3 2. ≥ − − − Moreover, if k(2k 1)− = 2 1 (2 1) is an even perfect number, then 1 2 2 − ψ(2 [2 1]) = 3. 2 − −− − Proof: Let k 1, 1 + 2 + 4 +..... + k =− 2k 1 and (2k 1) is a prime. Since (k, 2k 1) = 1 and Ψ is a multiplicative function , so ψ(k[2k 1]) = ψ(k) ψ(2k 1). From hypothesis k is even and is of the form 2 (n 1). By using the 1 3 definition of Dedekind≥ psi function, we can write− ψ(k) =− k(1 + ) = − − − 2 2 ≥ Since 2k 1 is prime, ψ( 2k 1 ) = 2k. 3 Also, ψ(k[2k− 1]) = ψ(k) ψ(2k− 1) = 2 = 3 2 . This implies ψ(k[2k 1]) = 3 2 2 Any even perfect− number is of the− form 2 1 (2 1), where 2 1 is prime.− So, if k = 2 1 and 2k 1 = 2 1 is a prime, then k(2k 1) is even perfect number− and − − − − − 1 2 2 − ψ(2 [2 1]) = 3. 2 − − Proposition 2.2: For any even perfect number− n, ψ(σ(n)) = ψ(ψ(n)). Proof: If n is a perfect number, then n = 2 1(2 1), where 2 1 is a Mersenne prime − and σ(n) = 2n = 2 (2 1). Since ψ is multiplicative− and (2 , 2 − 1) = 1, 1 so ψ(σ(n)) = ψ(2 [2 −1]) = ψ(2 ) ψ(2 1) = 2 (1+ ) 2 =− 3.22 1 . 2 − © 2013, IJMA. All Rights −Reserved − 119 Bhabesh Das*/Some Aspects of Perfect and Generalized Perfect Numbers/ IJMA- 4(6), June-2013. This implies 2 1 ψ(σ(n)) = 3.2 (i) − From proposition 2.1., ψ(n) = 3. 22 2 . Since (3, 22 2 ) = 1, so − − 2 2 2 2 2 2 1 2 1 ψ(ψ(n)) = ψ(3. 2 ) = ψ(3) ψ (2 ) = 4. 2 (1+ ) = 3. 2 . 2 − − − − Thus, ψ(ψ(n)) = 3.22 1 (ii) − From (i) and (ii), we obtain ψ(σ(n)) = ψ(ψ(n)) . Proposition 2.3: Let m be a Mersenne prime and m = 2 1. If n = 2 1(2 1) is an even perfect number − 4 (n) ( 1) (n) − − then ( ) = and φ( ) = 3( +1) 3 ( ) ψ − ψ Proof: Let m = 2 1, then 2 = m + 1 Since n is an even perfect− number, so ( ) = 2n = 2 (2 1) = m (m + 1) ( ) = m( m + 1) − (i) 3 3 From the proposition 2.1. ψ(n) = 3. 22 2 = 22 = ( + 1)2. This gives 4 4 − 3 2 ψ(n) = ( + 1) (ii) 4 ( ) 4 From (i) and (ii), we obtain = . (n) 3( + 1) ψ Thus 4 (n) ( ) = (iii) 3( + 1) ψ Since φ is a multiplicative function and (2 1, 2 1) = 1, so − 2 1 1 − 1 1 ( +1) ( 1) 1 φ (n) = φ(2 (2 1)) = φ (2 ) φ (2 1) = 2 (2 1) = . = . 2 2 4 − − − − − − This implies − − − 2 1 φ (n) = (iv) 4 − ( 1) (n) From (iii) and (iv) we obtain φ( ) = 3 ( ) − ψ Proposition 2.4: Let 3 2 be a prime.
Load more

Recommended publications
  • Bi-Unitary Multiperfect Numbers, I
    Notes on Number Theory and Discrete Mathematics Print ISSN 1310–5132, Online ISSN 2367–8275 Vol. 26, 2020, No. 1, 93–171 DOI: 10.7546/nntdm.2020.26.1.93-171 Bi-unitary multiperfect numbers, I Pentti Haukkanen1 and Varanasi Sitaramaiah2 1 Faculty of Information Technology and Communication Sciences, FI-33014 Tampere University, Finland e-mail: [email protected] 2 1/194e, Poola Subbaiah Street, Taluk Office Road, Markapur Prakasam District, Andhra Pradesh, 523316 India e-mail: [email protected] Dedicated to the memory of Prof. D. Suryanarayana Received: 19 December 2019 Revised: 21 January 2020 Accepted: 5 March 2020 Abstract: A divisor d of a positive integer n is called a unitary divisor if gcd(d; n=d) = 1; and d is called a bi-unitary divisor of n if the greatest common unitary divisor of d and n=d is unity. The concept of a bi-unitary divisor is due to D. Surynarayana [12]. Let σ∗∗(n) denote the sum of the bi-unitary divisors of n: A positive integer n is called a bi-unitary perfect number if σ∗∗(n) = 2n. This concept was introduced by C. R. Wall in 1972 [15], and he proved that there are only three bi-unitary perfect numbers, namely 6, 60 and 90. In 1987, Peter Hagis [6] introduced the notion of bi-unitary multi k-perfect numbers as solu- tions n of the equation σ∗∗(n) = kn. A bi-unitary multi 3-perfect number is called a bi-unitary triperfect number. A bi-unitary multiperfect number means a bi-unitary multi k-perfect number with k ≥ 3: Hagis [6] proved that there are no odd bi-unitary multiperfect numbers.
    [Show full text]
  • Input for Carnival of Math: Number 115, October 2014
    Input for Carnival of Math: Number 115, October 2014 I visited Singapore in 1996 and the people were very kind to me. So I though this might be a little payback for their kindness. Good Luck. David Brooks The “Mathematical Association of America” (http://maanumberaday.blogspot.com/2009/11/115.html ) notes that: 115 = 5 x 23. 115 = 23 x (2 + 3). 115 has a unique representation as a sum of three squares: 3 2 + 5 2 + 9 2 = 115. 115 is the smallest three-digit integer, abc , such that ( abc )/( a*b*c) is prime : 115/5 = 23. STS-115 was a space shuttle mission to the International Space Station flown by the space shuttle Atlantis on Sept. 9, 2006. The “Online Encyclopedia of Integer Sequences” (http://www.oeis.org) notes that 115 is a tridecagonal (or 13-gonal) number. Also, 115 is the number of rooted trees with 8 vertices (or nodes). If you do a search for 115 on the OEIS website you will find out that there are 7,041 integer sequences that contain the number 115. The website “Positive Integers” (http://www.positiveintegers.org/115) notes that 115 is a palindromic and repdigit number when written in base 22 (5522). The website “Number Gossip” (http://www.numbergossip.com) notes that: 115 is the smallest three-digit integer, abc, such that (abc)/(a*b*c) is prime. It also notes that 115 is a composite, deficient, lucky, odd odious and square-free number. The website “Numbers Aplenty” (http://www.numbersaplenty.com/115) notes that: It has 4 divisors, whose sum is σ = 144.
    [Show full text]
  • On Abundancy Index of Some Special Class of Numbers
    Sohag J. Math. 4, No. 2, 37-40 (2017) 37 Sohag Journal of Mathematics An International Journal http://dx.doi.org/10.18576/sjm/040202 On Abundancy Index of Some Special Class of Numbers Bhabesh Das1,∗ and Helen K. Saikia2 1 Department of Mathematics, B.P.C.College, Assam, 781127, India 2 Department of Mathematics, Gauhati University, Assam, 781014, India Received: 10 Dec. 2015, Revised: 12 Sep. 2016, Accepted: 23 Sep. 2016 Published online: 1 May 2017 σ(n) σ Abstract: For any positive integer n, abundancy index I(n) is defined as I(n) = n , where (n) is the sum of all positive divisors of n. In this paper, we have discussed non trivial lower and upper bounds of I(n) for some special class of numbers like Quasi perfect numbers, Super hyperperfect numbers, Near perfect numbers and Hyperperfect numbers. Keywords: Quasi perfect number, Super hyperperfect number, Near perfect number, Hyperperfect number p−1 1 Introduction of n. If m = 2 Mp is an even perfect number, where p p both p and Mp = 2 − 1 are primes, then n = 2m, n = 2 m We known divisor function σ(n) is the sum of all positive and n = (2p − 1)m are near perfect numbers. There are divisors of n , including 1 and n itself. The abundancy finitely many near perfect numbers other than these three p index I(n) for any positive integer n is associated with the shapes. The primes of the form Mp = 2 − 1 are called divisor function σ(n) and is defined as Mersenne primes.
    [Show full text]
  • Generalized Perfect Numbers
    Acta Univ. Sapientiae, Mathematica, 1, 1 (2009) 73–82 Generalized perfect numbers Antal Bege Kinga Fogarasi Sapientia–Hungarian University of Sapientia–Hungarian University of Transilvania Transilvania Department of Mathematics and Department of Mathematics and Informatics, Informatics, Tˆargu Mure¸s, Romania Tˆargu Mure¸s, Romania email: [email protected] email: [email protected] Abstract. Let σ(n) denote the sum of positive divisors of the natural number n. A natural number is perfect if σ(n) = 2n. This concept was already generalized in form of superperfect numbers σ2(n)= σ(σ(n)) = k+1 k−1 2n and hyperperfect numbers σ(n)= k n + k . In this paper some new ways of generalizing perfect numbers are inves- tigated, numerical results are presented and some conjectures are estab- lished. 1 Introduction For the natural number n we denote the sum of positive divisors by arXiv:1008.0155v1 [math.NT] 1 Aug 2010 σ(n)= X d. d|n Definition 1 A positive integer n is called perfect number if it is equal to the sum of its proper divisors. Equivalently: σ(n)= 2n, where AMS 2000 subject classifications: 11A25, 11Y70 Key words and phrases: perfect number, superperfect number, k-hyperperfect number 73 74 A. Bege, K. Fogarasi Example 1 The first few perfect numbers are: 6, 28, 496, 8128, . (Sloane’s A000396 [15]), since 6 = 1 + 2 + 3 28 = 1 + 2 + 4 + 7 + 14 496 = 1 + 2 + 4 + 8 + 16 + 31 + 62 + 124 + 248 Euclid discovered that the first four perfect numbers are generated by the for- mula 2n−1(2n − 1).
    [Show full text]
  • ON PERFECT and NEAR-PERFECT NUMBERS 1. Introduction a Perfect
    ON PERFECT AND NEAR-PERFECT NUMBERS PAUL POLLACK AND VLADIMIR SHEVELEV Abstract. We call n a near-perfect number if n is the sum of all of its proper divisors, except for one of them, which we term the redundant divisor. For example, the representation 12 = 1 + 2 + 3 + 6 shows that 12 is near-perfect with redundant divisor 4. Near-perfect numbers are thus a very special class of pseudoperfect numbers, as defined by Sierpi´nski. We discuss some rules for generating near-perfect numbers similar to Euclid's rule for constructing even perfect numbers, and we obtain an upper bound of x5=6+o(1) for the number of near-perfect numbers in [1; x], as x ! 1. 1. Introduction A perfect number is a positive integer equal to the sum of its proper positive divisors. Let σ(n) denote the sum of all of the positive divisors of n. Then n is a perfect number if and only if σ(n) − n = n, that is, σ(n) = 2n. The first four perfect numbers { 6, 28, 496, and 8128 { were known to Euclid, who also succeeded in establishing the following general rule: Theorem A (Euclid). If p is a prime number for which 2p − 1 is also prime, then n = 2p−1(2p − 1) is a perfect number. It is interesting that 2000 years passed before the next important result in the theory of perfect numbers. In 1747, Euler showed that every even perfect number arises from an application of Euclid's rule: Theorem B (Euler). All even perfect numbers have the form 2p−1(2p − 1), where p and 2p − 1 are primes.
    [Show full text]
  • PRIME-PERFECT NUMBERS Paul Pollack [email protected] Carl
    PRIME-PERFECT NUMBERS Paul Pollack Department of Mathematics, University of Illinois, Urbana, Illinois 61801, USA [email protected] Carl Pomerance Department of Mathematics, Dartmouth College, Hanover, New Hampshire 03755, USA [email protected] In memory of John Lewis Selfridge Abstract We discuss a relative of the perfect numbers for which it is possible to prove that there are infinitely many examples. Call a natural number n prime-perfect if n and σ(n) share the same set of distinct prime divisors. For example, all even perfect numbers are prime-perfect. We show that the count Nσ(x) of prime-perfect numbers in [1; x] satisfies estimates of the form c= log log log x 1 +o(1) exp((log x) ) ≤ Nσ(x) ≤ x 3 ; as x ! 1. We also discuss the analogous problem for the Euler function. Letting N'(x) denote the number of n ≤ x for which n and '(n) share the same set of prime factors, we show that as x ! 1, x1=2 x7=20 ≤ N (x) ≤ ; where L(x) = xlog log log x= log log x: ' L(x)1=4+o(1) We conclude by discussing some related problems posed by Harborth and Cohen. 1. Introduction P Let σ(n) := djn d be the sum of the proper divisors of n. A natural number n is called perfect if σ(n) = 2n and, more generally, multiply perfect if n j σ(n). The study of such numbers has an ancient pedigree (surveyed, e.g., in [5, Chapter 1] and [28, Chapter 1]), but many of the most interesting problems remain unsolved.
    [Show full text]
  • The Math Problems Notebook
    Valentin Boju Louis Funar The Math Problems Notebook Birkhauser¨ Boston • Basel • Berlin Valentin Boju Louis Funar MontrealTech Institut Fourier BP 74 Institut de Technologie de Montreal URF Mathematiques P.O. Box 78575, Station Wilderton Universite´ de Grenoble I Montreal, Quebec, H3S 2W9 Canada 38402 Saint Martin d’Heres cedex [email protected] France [email protected] Cover design by Alex Gerasev. Mathematics Subject Classification (2000): 00A07 (Primary); 05-01, 11-01, 26-01, 51-01, 52-01 Library of Congress Control Number: 2007929628 ISBN-13: 978-0-8176-4546-5 e-ISBN-13: 978-0-8176-4547-2 Printed on acid-free paper. c 2007 Birkhauser¨ Boston All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Birkhauser¨ Boston, c/o Springer Science+Business Media LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbid- den. The use in this publication of trade names, trademarks, service marks and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. 987654321 www.birkhauser.com (TXQ/SB) The Authors Valentin Boju was professor of mathematics at the University of Craiova, Romania, until his retirement in 2000. His research work was primarily in the field of geome- try.
    [Show full text]
  • Types of Integer Harmonic Numbers (Ii)
    Bulletin of the Transilvania University of Bra¸sov • Vol 9(58), No. 1 - 2016 Series III: Mathematics, Informatics, Physics, 67-82 TYPES OF INTEGER HARMONIC NUMBERS (II) Adelina MANEA1 and Nicu¸sorMINCULETE2 Abstract In the first part of this paper we obtained several bi-unitary harmonic numbers which are higher than 109, using the Mersenne prime numbers. In this paper we investigate bi-unitary harmonic numbers of some particular forms: 2k · n, pqt2, p2q2t, with different primes p, q, t and a squarefree inte- ger n. 2010 Mathematics Subject Classification: 11A25. Key words: harmonic numbers, bi-unitary harmonic numbers. 1 Introduction The harmonic numbers introduced by O. Ore in [8] were named in this way by C. Pomerance in [11]. They are defined as positive integers for which the harmonic mean of their divisors is an integer. O. Ore linked the perfect numbers with the harmonic numbers, showing that every perfect number is harmonic. A list of the harmonic numbers less than 2 · 109 is given by G. L. Cohen in [1], finding a total of 130 of harmonic numbers, and G. L. Cohen and R. M. Sorli in [2] have continued to this list up to 1010. The notion of harmonic numbers is extended to unitary harmonic numbers by K. Nageswara Rao in [7] and then to bi-unitary harmonic numbers by J. S´andor in [12]. Our paper is inspired by [12], where J. S´andorpresented a table containing all the 211 bi-unitary harmonic numbers up to 109. We extend the J. S´andors's study, looking for other bi-unitary harmonic numbers, greater than 109.
    [Show full text]
  • A Study of .Perfect Numbers and Unitary Perfect
    CORE Metadata, citation and similar papers at core.ac.uk Provided by SHAREOK repository A STUDY OF .PERFECT NUMBERS AND UNITARY PERFECT NUMBERS By EDWARD LEE DUBOWSKY /I Bachelor of Science Northwest Missouri State College Maryville, Missouri: 1951 Master of Science Kansas State University Manhattan, Kansas 1954 Submitted to the Faculty of the Graduate College of the Oklahoma State University in partial fulfillment of .the requirements fqr the Degree of DOCTOR OF EDUCATION May, 1972 ,r . I \_J.(,e, .u,,1,; /q7Q D 0 &'ISs ~::>-~ OKLAHOMA STATE UNIVERSITY LIBRARY AUG 10 1973 A STUDY OF PERFECT NUMBERS ·AND UNITARY PERFECT NUMBERS Thesis Approved: OQ LL . ACKNOWLEDGEMENTS I wish to express my sincere gratitude to .Dr. Gerald K. Goff, .who suggested. this topic, for his guidance and invaluable assistance in the preparation of this dissertation. Special thanks.go to the members of. my advisory committee: 0 Dr. John Jewett, Dr. Craig Wood, Dr. Robert Alciatore, and Dr. Vernon Troxel. I wish to thank. Dr. Jeanne Agnew for the excellent training in number theory. that -made possible this .study. I wish tc;, thank Cynthia Wise for her excellent _job in typing this dissertation •. Finally, I wish to express gratitude to my wife, Juanita, .and my children, Sondra and David, for their encouragement and sacrifice made during this study. TABLE OF CONTENTS Chapter Page I. HISTORY AND INTRODUCTION. 1 II. EVEN PERFECT NUMBERS 4 Basic Theorems • • • • • • • • . 8 Some Congruence Relations ••• , , 12 Geometric Numbers ••.••• , , , , • , • . 16 Harmonic ,Mean of the Divisors •. ~ ••• , ••• I: 19 Other Properties •••• 21 Binary Notation. • •••• , ••• , •• , 23 III, ODD PERFECT NUMBERS . " . 27 Basic Structure • , , •• , , , .
    [Show full text]
  • On Perfect Numbers and Their Relations 1 Introduction
    Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 27, 1337 - 1346 On Perfect Numbers and their Relations Recep G¨ur 2000 Evler Mahallesi Boykent Sitesi E Blok 26/7 Nevsehir, Turkey [email protected] Nihal Bircan Technische Universitaet Berlin Fakultaet II Institut f¨ur Mathematik MA 8 − 1 Strasse des 17. Juni 136 D-10623 Berlin, Germany [email protected] Abstract In this paper, we get some new formulas for generalized perfect numbers and their relationship between arithmetical functions φ, σ concerning Ore’s harmonic numbers and by using these formulas we present some examples. Mathematics Subject Classification: 11A25, 11A41, 11Y70 Keywords: perfect number, 2-hyperperfect number, Euler’s totient function, Ore harmonic number 1 Introduction In this section, we aimed to provide general information on perfect numbers shortly. Here and throughout the paper we assume m, n, k, d, b are positive integers and p is prime. N is called perfect number, if it is equal to the sum of its proper divisors. The first few perfect numbers are 6, 28, 496, 8128,... since, 6 = 1+2+3 28 = 1+2+4+7+14 496 = 1+2+4+8+16+31+62+124+248 Euclid discovered the first four perfect numbers which are generated by the formula 2n−1(2n−1), called Euclid number. In his book ’Elements’ he presented the proof of the formula which gives an even perfect number whenever 2n −1is 1338 Recep G¨ur and Nihal Bircan prime. In order for 2n −1 to be a prime n must itself be a prime.
    [Show full text]
  • Identities for Near and Deficient Hyperperfect Numbers
    Received: 03.01.2016 Year: 2017, Pages: 01-12 Published: 13.04.2017 Original Article** Identities for Near and Deficient Hyperperfect Numbers Bhabesh Das1;* <[email protected]> Helen K.Saikia2 <[email protected]> 1Department of Mathematics,B.P.C.College,781127,Assam,India 2Department of Mathematics,Gauhati University,781014,Assam,India Abstaract − It is well-known that a positive integer n is said to be k−hyperperfect number if k + 1 k − 1 σ(n) = n + ; k k where k is a positive integer and σ(n) is the sum of all positive divisors of n. We call a number n is near k−hyperperfect number if k + 1 k − 1 σ(n) = n + + d k k and decient k−hyperperfect number if k + 1 k − 1 σ(n) = n + − d; k k where d is a proper divisor of n. In this paper, for any prime number q, we present two classes of near (q − 1)−hyperperfect number and one class of decient (q − 1)−hyperperfect number with two distinct prime factors and also present some numerical results. Keywords − Perfect number, Hyperperfect number, Near perfect number, Decient perfect number. **Edited by A. D. Godase (Editor-in-Chief). *Corresponding Author. Indian Journal in Number Theory, 2017, 01-12 2 1 Introduction For any positive integer n, divisor function σ(n) denote the sum of all positive divisors of n, X σ(n) = d: djn Denition 1.1. A positive integer n is called perfect number, if σ(n) = 2n. All known perfect numbers are even. The Euclid-Euler theorem gives the general form of even perfect numbers.
    [Show full text]
  • The Schnirelmann Density of the Set of Deficient Numbers
    THE SCHNIRELMANN DENSITY OF THE SET OF DEFICIENT NUMBERS A Thesis Presented to the Faculty of California State Polytechnic University, Pomona In Partial Fulfillment Of the Requirements for the Degree Master of Science In Mathematics By Peter Gerralld Banda 2015 SIGNATURE PAGE THESIS: THE SCHNIRELMANN DENSITY OF THE SET OF DEFICIENT NUMBERS AUTHOR: Peter Gerralld Banda DATE SUBMITTED: Summer 2015 Mathematics and Statistics Department Dr. Mitsuo Kobayashi Thesis Committee Chair Mathematics & Statistics Dr. Amber Rosin Mathematics & Statistics Dr. John Rock Mathematics & Statistics ii ACKNOWLEDGMENTS I would like to take a moment to express my sincerest appreciation of my fianc´ee’s never ceasing support without which I would not be here. Over the years our rela­ tionship has proven invaluable and I am sure that there will be many more fruitful years to come. I would like to thank my friends/co-workers/peers who shared the long nights, tears and triumphs that brought my mathematical understanding to what it is today. Without this, graduate school would have been lonely and I prob­ ably would have not pushed on. I would like to thank my teachers and mentors. Their commitment to teaching and passion for mathematics provided me with the incentive to work and succeed in this educational endeavour. Last but not least, I would like to thank my advisor and mentor, Dr. Mitsuo Kobayashi. Thanks to his patience and guidance, I made it this far with my sanity mostly intact. With his expertise in mathematics and programming, he was able to correct the direction of my efforts no matter how far they strayed.
    [Show full text]