DOCSLIB.ORG

Multiplicatively Perfect and Related Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Multiplicatively Perfect and Related Numbers Journal of Rajasthan Academy of Physical Sciences ISSN : 0972-6306; URL : http://raops.org.in Vol.15, No.4, December, 2016, 345-350 MULTIPLICATIVELY PERFECT AND RELATED NUMBERS Shikha Yadav* and Surendra Yadav** *Department of Mathematics and Astronomy, University of Lucknow, Lucknow- 226007, U.P., India E-mail: [email protected] **Department of Applied Mathematics, Babasaheb Bhimrao Ambedkar University, Lucknow-226025, U.P., India, E-mail: ssyp_ [email protected] Abstract: Sandor [4] has discussed multiplicatively perfect (푀perfect) and multiplicatively +perfect numbers (called as 푀 +perfect). In this paper, we have discussed a new perfect number called as multiplicatively – perfect numbers (also called as 푀 − perfect). Further we study about Abundant, Deficient, Harmonic and Unitary analogue of harmonic numbers. Keywords and Phrases: Multiplicatively perfect numbers, Abundant numbers, Deficient numbers, Harmonic numbers and unitary divisor. 2010 Mathematics Subject Classification: 11A25. 1. Introduction Sandor and Egri [3], Sandor [4] have defined multiplicatively perfect and multiplicatively + perfect numbers as follows, A positive integer 푛 ≥ 1 is called multiplicatively perfect if 푅 푛 = 푛2, (1) where, 푅 푛 is product of divisor function. Let 푑1, 푑2, 푑3, … 푑푟 are the divisors of 푛 then 푅 푛 = 푑1. 푑2. 푑3. … 푑푟 . 푑(푛 ) Also, 푅 푛 = 푛 2 (2) Let 푅+(푛) denotes the product of even divisors of 푛. We say that 푛 is 푀 + perfect number if 2 푅+ 푛 = 푛 . (3) Now, in this paper we define 푀 − perfect numbers as follows, let 푅− 푛 denotes the product of odd divisors of 푛 .We say that 푛 is 푀 − perfect if 346 Shikha Yadav and Surendra Yadav 2 푅− 푛 = 푛 . (4) Sandor and Egri[3] have discussed all forms of 푀perfect and 푀 +perfect numbers by following theorem. 3 Theorem 1.1 All 푀perfect numbers are of the form 푛 = 푝1푝2 or 푛 = 푝1 , where 푝1 ≠ 푝2 are arbitrary primes. 3 Theorem 1.2 All 푀 +perfect numbers are of the form 푛 = 8푝1푝2 or 푛 = 8푝1 , where 푝1 ≠ 푝2 are distinct odd primes. In this paper we discuss the form of 푀 − perfect numbers in section 2. Sandor and Egri [3] called 푛 to be nobly abundant if both 휎 푛 and 푑(푛) are abundant numbers. Similarly 푛 is called nobly deficient if both 휎 푛 and 푑(푛) are deficient, 푛 is called abundant if 휎 푛 > 2푛 and deficient if 휎 푛 < 2푛. Sandor and Egri [3] introduced a number 푛 ∈ 푁 is called harmonic number if 휎 푛 /푛푑(푛). Many results on harmonic numbers have been proved in Sandor and Egri[3] introduced by Cohen and Sorli [2] or Cohen and Deng [1]. Let 휎푒 (푛) and 푑푒 (푛) denotes the sum and product of all 푒 - divisors of 푛. Also that 휎푒 1 = 1, 푑푒 1 = 1 . Straus and Subbarao [5] called 푛 to be 푒- perfect if 휎푒 푛 = 2푛 . (5) Further, Sandor and Egri [3] introduced that 푛 is called 푒 -Harmonic of type 1, if 휎푒 (푛)/푛푑푒 푛 , (6) and 푒 -Harmonic of type 2, if 푝푒 (푛)/푛푑푒 (푛) where 푟 푎 −푑 푎 푎 푎 푖 푖 1 2 푟 푝푒 푛 = 푖=1( 푑푖/푎푖 푝푖 ) , 푛 = 푝1 . 푝2 … . 푝푟 (7) 푎−푑 푎 And 푝푒 푛 = 푑/푎 푝 , 푛 = 푝 . (8) Sandor defined that 푛 ∈ 푁 is Modified 푒 -perfect number if 푝푒 (푛)/푛 . (9) Sandor and Egri [3] defined Geometric numbers as follows, let 퐺(푛) is geometric mean of divisors of an integer 푛 given by 1 퐺 푛 = [푅 푛 ]푑 푛 . (10) A positive integer 푛 is called geometric number if 퐺 푛 is an integer.It is clear using (1.1) that 퐺 푛 = 푛 , (11) so all Geometric numbers are perfect squares. Multiplicatively Perfect and Related Numbers 347 In Mladen, Vassilev Missana and Krassimir Atanassov [6] definition of 푒-perfect number is given as follows: A positive integer 푛 is called 푒 -perfect number if 휎푒 푛 = 2푛 , (12) where 휎푒 푛 is the sum of all 푒 divisors of 푛. In Cohen and Sorli [2] many results on harmonic numbers has been given, if we consider unitary divisors of 푛 then unitary harmonic numbers can be defined as, A number 푛 ≥ 1 is called unitary harmonic if 휎∗(푛)/푛푑∗(푛) . (13) where 푑∗(푛) is the number of unitary divisors of 푛 which is defined as 푑∗ 푛 = 2푟 , (14) 훼1 훼2 훼푟 ∗ if 푛 = 푝1 . 푝2 … . 푝푟 , and 휎 (푛) is unitary divisor function. Now, 푅∗(푛) is the product of unitary divisors of 푛 which is defined as, 푑∗ (푛) 푅∗ 푛 = (푛) 2 . (15) Now, unitary geometric mean of a positive integer is defined as, 1 퐺∗ 푛 = (푅∗ 푛 )푑∗ (푛), (16) and a positive integer 푛 is called unitary geometric number if 퐺∗ 푛 is an integer so using (15), we have 퐺∗ 푛 = 푛 . (17) Hence a unitary geometric number is infact a perfect square. In section 2 we prove some results about the related numbers discussed as above in this section. 2. Results 3 Theorem 2.1 All 푀 − perfect numbers are of the form 푛 = 푝1푝2 or 푛 = 푝1 , where 푝1 ≠ 푝2 are distinct odd primes. Proof: Let 푛 = 2푘 푁 is a 푀 − perfect number, where 푁 is odd positive integer. Then all odd divisors 푑 of 푛 are 푑 = 푁1,where 푁1/푁 . Therefore, 푅− 푛 = 푁1/푁 푁1 = 푅 푁 . Using (1.4) we get 푅 푁 = 22푘 푁2 , because 푅 푁 is always odd as 푁 is odd 2 therefore 푘 = 0, so 푛 = 푁, this implies 푅 푁 = 푁 , thus 푁 is odd 푀 perfect number. 3 According to theorem (1.1), 푛 = 푝1푝2 or 푛 = 푝1 . Theorem 2.2 Let 푟 ≥ 3 and 푟 = 2푘 − 1 be a mersenne prime then 푛 = 2푟 has the property that 푑(푛) is deficient , 휎(푛) is abundant and if 푟 ≥ 7 then 푛 is deficient. If 푟 < 7 then 푛 is a perfect number. 348 Shikha Yadav and Surendra Yadav Proof: Let 푛 = 2푟 , where 푟 ≥ 3 and 푟 = 2푘 − 1 be a mersenne prime. Then, 휎 푑 푛 = 휎 4 = 7 < 2. 푑 푛 = 8, so, 휎 푑 푛 < 2푑 푛 . Hence 푑 푛 is deficient. Now, 휎 휎 푛 = 휎 휎 2푟 = 휎 휎 푟 휎(2) = 휎 3. 2푘 = 휎 3 휎 2푘 = 4(2푘+1 − 1). Since, 2 휎 2푟 =2휎 2 휎(푟)= 3. 2푘+1 < 4 2푘+1 − 1 , ∀ 푘 ≥ 2. Therefore, 휎 휎 푛 > 2휎 푛 . Hence, 휎(푛) is abundant. Since, 휎 푛 = 휎 2푟 = 3. 2푘 < 4 2푘 − 1 = 2푛, ∀ 푘 > 2. Therefore, 휎 푛 < 2푛 . Hence, 푛 is deficient. Since, 푟 = 3 and 푛 = 6 for 푘 = 2 therefore 푛 is a perfect number. Hence, for 푟 < 7, 푛 is a perfect number. Theorem 2.3 Let 푟 ≥ 3 and 푞 = 푟2 + 푟 + 1 is a prime then 푛 = 2푟2 has property that 휎(푛) is deficient, 푑(푛) is perfect and 푛 is abundant. Proof: Let 푛 = 2푟2 , 푟 ≥ 3 is a prime number. Then, 휎 푛 = 휎 2푟2 = 휎 2 휎 푟2 = 3 푟2 + 푟 + 1 = 3푞, where, 푞 = 푟2 + 푟 + 1 be a prime. Now, 휎 휎 푛 = 휎 3. 푞 = 휎 3 휎 푞 = 4 푞 + 1 = 4 푟2 + 푟 + 2 , and 2휎 푛 = 2휎 2푟2 = 2.3 푟2 + 푟 + 1 = 6 푟2 + 푟 + 1 . Since, it is clear that 4 푟2 + 푟 + 2 < 6 푟2 + 푟 + 1 . For 푟 ≥ 3. Therefore, 휎 휎 푛 < 2휎 푛 . Hence 휎 푛 is deficient. Since, 휎 푑 푛 = 휎 푑 2푟2 = 휎 푑 2 푑 푟2 = 휎 2.3 = 휎 6 = 12 = 2. 푑(2푟2)휎 푑 푛 = 2푑 푛 . Hence 푑 푛 is perfect. Since, 휎 2푟2 = 휎 2 휎 푟2 = 3 푟2 + 푟 + 1 > 4푟2, for 푟 ≥ 3. Therefore, 휎 푛 > 2푛 . Hence, 푛 is abundant. Preposition 2.1 If 푛 = 8 then 휎(푛) and 푑(푛) both are deficient i.e. 푛 = 8 is a nobly deficient number. Proof: Since, 휎 휎 8 = 휎 15 = 24 < 2휎 8 = 2.15 = 30, therefore, 휎 8 is deficient. Since, 휎 푑 8 = 휎 4 = 7 < 2푑 8 = 2.4 = 8, therefore, 푑 8 is deficient. Hence 푛 = 8 is nobly deficient. Theorem 2.5 All multiplicatively Perfect numbers of the form 푛 = 푝1푝2 are modified 푒-Perfect numbers. Proof: Using (8), since, 푝푒 푝1푝2 = 푝푒 푝1 푝푒 푝2 = 1, therefore, (9) holds true. Hence 푛 is a Modified 푒-Perfect number. Multiplicatively Perfect and Related Numbers 349 Theorem 2.6 All multiplicatively Perfect numbers of the form 푛 = 푝1푝2 are 푒-Harmonic of both types. Proof: If 푛 is product of distinct primes then 푛 is 푒-Harmonic of both types (proof has been given in Sandor and E. Egri [8]). Hence 푛 = 푝1푝2 is 푒-Harmonic of both types. Theorem 2.7 If 푝 is an arbitrary prime, then 푛 = 푝 is 푒-Harmonic of both types and modified 푒-Perfect. Proof: For, 푛 = 푝 , 푝푒 푝 = 1. Hence (9) holds true. Also by the proof given in Sandor and Egri [3], 푛 = 푝 is 푒-Harmonic of both types. Theorem 2.8 If 푛 = 푝훼 , where 훼 is an even positive integer.Then 푛 is a geometric number. Proof: Let 푛 = 푝훼 , where 훼 is an even positive integer. Let 훼 = 2푟, then 푛 = 푝2푟 using (1.1), we get 2푟+1 2푟+1 1 1 푅 푛 = (푝2푟 ) 2 , now using (1.10), we get 퐺 푛 = [(푝2푟 ) 2 ] 2푟+1 = (푝2푟 )2 = 푝푟 = 푝2푟 , which is always an integer.
Load more

Recommended publications
  • 9N1.5 Determine the Square Root of Positive Rational Numbers That Are Perfect Squares
    9N1.5 Determine the square root of positive rational numbers that are perfect squares. Square Roots and Perfect Squares The square root of a given number is a value that when multiplied by itself results in the given number. For ​ ​ example, the square root of 9 is 3 because 3 × 3 = 9 . Example Use a diagram to determine the square root of 121. Solution Step 1 Draw a square with an area of 121 units. Step 2 Count the number of units along one side of the square. √121 = 11 units √121 = 11 units The square root of 121 is 11. This can also be written as √121 = 11. A number that has a whole number as its square root is called a perfect square. Perfect squares have the ​ ​ unique characteristic of having an odd number of factors. Example Given the numbers 81, 24, 102, 144, identify the perfect squares by ordering their factors from smallest to largest. Solution The square root of each perfect square is bolded. Factors of 81: 1, 3, 9, 27, 81 ​ ​ Since there are an odd number of factors, 81 is a perfect square. Factors of 24: 1, 2, 3, 4, 6, 8, 12, 24 Since there are an even number of factors, 24 is not a perfect square. Factors of 102: 1, 2, 3, 6, 17, 34, 51, 102 Since there are an even number of factors, 102 is not a perfect square. Factors of 144: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144 ​ ​ Since there are an odd number of factors, 144 is a perfect square.
    [Show full text]
  • Grade 7/8 Math Circles the Scale of Numbers Introduction
    Faculty of Mathematics Centre for Education in Waterloo, Ontario N2L 3G1 Mathematics and Computing Grade 7/8 Math Circles November 21/22/23, 2017 The Scale of Numbers Introduction Last week we quickly took a look at scientific notation, which is one way we can write down really big numbers. We can also use scientific notation to write very small numbers. 1 × 103 = 1; 000 1 × 102 = 100 1 × 101 = 10 1 × 100 = 1 1 × 10−1 = 0:1 1 × 10−2 = 0:01 1 × 10−3 = 0:001 As you can see above, every time the value of the exponent decreases, the number gets smaller by a factor of 10. This pattern continues even into negative exponent values! Another way of picturing negative exponents is as a division by a positive exponent. 1 10−6 = = 0:000001 106 In this lesson we will be looking at some famous, interesting, or important small numbers, and begin slowly working our way up to the biggest numbers ever used in mathematics! Obviously we can come up with any arbitrary number that is either extremely small or extremely large, but the purpose of this lesson is to only look at numbers with some kind of mathematical or scientific significance. 1 Extremely Small Numbers 1. Zero • Zero or `0' is the number that represents nothingness. It is the number with the smallest magnitude. • Zero only began being used as a number around the year 500. Before this, ancient mathematicians struggled with the concept of `nothing' being `something'. 2. Planck's Constant This is the smallest number that we will be looking at today other than zero.
    [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]
  • Representing Square Numbers Copyright © 2009 Nelson Education Ltd
    Representing Square 1.1 Numbers Student book page 4 You will need Use materials to represent square numbers. • counters A. Calculate the number of counters in this square array. ϭ • a calculator number of number of number of counters counters in counters in in a row a column the array 25 is called a square number because you can arrange 25 counters into a 5-by-5 square. B. Use counters and the grid below to make square arrays. Complete the table. Number of counters in: Each row or column Square array 525 4 9 4 1 Is the number of counters in each square array a square number? How do you know? 8 Lesson 1.1: Representing Square Numbers Copyright © 2009 Nelson Education Ltd. NNEL-MATANSWER-08-0702-001-L01.inddEL-MATANSWER-08-0702-001-L01.indd 8 99/15/08/15/08 55:06:27:06:27 PPMM C. What is the area of the shaded square on the grid? Area ϭ s ϫ s s units ϫ units square units s When you multiply a whole number by itself, the result is a square number. Is 6 a whole number? So, is 36 a square number? D. Determine whether 49 is a square number. Sketch a square with a side length of 7 units. Area ϭ units ϫ units square units Is 49 the product of a whole number multiplied by itself? So, is 49 a square number? The “square” of a number is that number times itself. For example, the square of 8 is 8 ϫ 8 ϭ .
    [Show full text]
  • Figurate Numbers
    Figurate Numbers by George Jelliss June 2008 with additions November 2008 Visualisation of Numbers The visual representation of the number of elements in a set by an array of small counters or other standard tally marks is still seen in the symbols on dominoes or playing cards, and in Roman numerals. The word "calculus" originally meant a small pebble used to calculate. Bear with me while we begin with a few elementary observations. Any number, n greater than 1, can be represented by a linear arrangement of n counters. The cases of 1 or 0 counters can be regarded as trivial or degenerate linear arrangements. The counters that make up a number m can alternatively be grouped in pairs instead of ones, and we find there are two cases, m = 2.n or 2.n + 1 (where the dot denotes multiplication). Numbers of these two forms are of course known as even and odd respectively. An even number is the sum of two equal numbers, n+n = 2.n. An odd number is the sum of two successive numbers 2.n + 1 = n + (n+1). The even and odd numbers alternate. Figure 1. Representation of numbers by rows of counters, and of even and odd numbers by various, mainly symmetric, formations. The right-angled (L-shaped) formation of the odd numbers is known as a gnomon. These do not of course exhaust the possibilities. 1 2 3 4 5 6 7 8 9 n 2 4 6 8 10 12 14 2.n 1 3 5 7 9 11 13 15 2.n + 1 Triples, Quadruples and Other Forms Generalising the divison into even and odd numbers, the counters making up a number can of course also be grouped in threes or fours or indeed any nonzero number k.
    [Show full text]
  • Multiplication Fact Strategies Assessment Directions and Analysis
    Multiplication Fact Strategies Wichita Public Schools Curriculum and Instructional Design Mathematics Revised 2014 KCCRS version Table of Contents Introduction Page Research Connections (Strategies) 3 Making Meaning for Operations 7 Assessment 9 Tools 13 Doubles 23 Fives 31 Zeroes and Ones 35 Strategy Focus Review 41 Tens 45 Nines 48 Squared Numbers 54 Strategy Focus Review 59 Double and Double Again 64 Double and One More Set 69 Half and Then Double 74 Strategy Focus Review 80 Related Equations (fact families) 82 Practice and Review 92 Wichita Public Schools 2014 2 Research Connections Where Do Fact Strategies Fit In? Adapted from Randall Charles Fact strategies are considered a crucial second phase in a three-phase program for teaching students basic math facts. The first phase is concept learning. Here, the goal is for students to understand the meanings of multiplication and division. In this phase, students focus on actions (i.e. “groups of”, “equal parts”, “building arrays”) that relate to multiplication and division concepts. An important instructional bridge that is often neglected between concept learning and memorization is the second phase, fact strategies. There are two goals in this phase. First, students need to recognize there are clusters of multiplication and division facts that relate in certain ways. Second, students need to understand those relationships. These lessons are designed to assist with the second phase of this process. If you have students that are not ready, you will need to address the first phase of concept learning. The third phase is memorization of the basic facts. Here the goal is for students to master products and quotients so they can recall them efficiently and accurately, and retain them over time.
    [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]
  • Newsletter No. 31 March 2004
    Newsletter No. 31 March 2004 Welcome to the second newsletter of 2004. We have lots of goodies for you this month so let's get under way. Maths is commonly said to be useful. The variety of its uses is wide but how many times as teachers have we heard students exclaim, "What use will this be when I leave school?" I guess it's all a matter of perspective. A teacher might say mathematics is useful because it provides him/her with a livelihood. A scientist would probably say it's the language of science and an engineer might use it for calculations necessary to build bridges. What about the rest of us? A number of surveys have shown that the majority of us only need to handle whole numbers in counting, simple addition and subtraction and decimals as they relate to money and domestic measurement. We are adept in avoiding arithmetic - calculators in their various forms can handle that. We prefer to accept so-called ball-park figures rather than make useful estimates in day-to-day dealings and computer software combined with trial-and-error takes care of any design skills we might need. At the same time we know that in our technological world numeracy and computer literacy are vital. Research mathematicians can push boundaries into the esoteric, some of it will be found useful, but we can't leave mathematical expertise to a smaller and smaller proportion of the population, no matter how much our students complain. Approaching mathematics through problem solving - real and abstract - is the philosophy of the nzmaths website.
    [Show full text]
  • Randell Heyman School of Mathematics and Statistics, University of New South Wales, Sydney, New South Wales, Australia [email protected]
    #A67 INTEGERS 19 (2019) CARDINALITY OF A FLOOR FUNCTION SET Randell Heyman School of Mathematics and Statistics, University of New South Wales, Sydney, New South Wales, Australia [email protected] Received: 5/13/19, Revised: 9/16/19, Accepted: 12/22/19, Published: 12/24/19 Abstract Fix a positive integer X. We quantify the cardinality of the set X/n : 1 n X . We discuss restricting the set to those elements that are prime,{bsemiprimec or similar. } 1. Introduction Throughout we will restrict the variables m and n to positive integer values. For any real number X we denote by X its integer part, that is, the greatest integer b c that does not exceed X. The most straightforward sum of the floor function is related to the divisor summatory function since X = 1 = ⌧(n), n nX6X ⌫ nX6X k6XX/n nX6X where ⌧(n) is the number of divisors of n. From [2, Theorem 2] we infer X = X log X + X(2γ 1) + O X517/1648+o(1) , n − nX6X ⌫ ⇣ ⌘ where γ is the Euler–Mascheroni constant, in particular γ 0.57722. ⇡ Recent results have generalized this sum to X f , n nX6X ✓ ⌫◆ where f is an arithmetic function (see [1], [3] and [4]). In this paper we take a di↵erent approach by examining the cardinality of the set X S(X) := m : m = for some n X . n ⇢ ⌫ Our main results are as follows. INTEGERS: 19 (2019) 2 Theorem 1. Let X be a positive integer. We have S(X) = p4X + 1 1. | | − j k Theorem 2.
    [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]
  • Arxiv:2106.08994V2 [Math.GM] 1 Aug 2021 Efc Ubr N30b.H Rvdta F2 If That and Proved Properties He Studied BC
    Measuring Abundance with Abundancy Index Kalpok Guha∗ Presidency University, Kolkata Sourangshu Ghosh† Indian Institute of Technology Kharagpur, India Abstract A positive integer n is called perfect if σ(n) = 2n, where σ(n) denote n σ(n) the sum of divisors of . In this paper we study the ratio n . We de- I → I n σ(n) fine the function Abundancy Index : N Q with ( ) = n . Then we study different properties of Abundancy Index and discuss the set of Abundancy Index. Using this function we define a new class of num- bers known as superabundant numbers. Finally we study superabundant numbers and their connection with Riemann Hypothesis. 1 Introduction Definition 1.1. A positive integer n is called perfect if σ(n)=2n, where σ(n) denote the sum of divisors of n. The first few perfect numbers are 6, 28, 496, 8128, ... (OEIS A000396), This is a well studied topic in number theory. Euclid studied properties and nature of perfect numbers in 300 BC. He proved that if 2p −1 is a prime, then 2p−1(2p −1) is an even perfect number(Elements, Prop. IX.36). Later mathematicians have arXiv:2106.08994v2 [math.GM] 1 Aug 2021 spent years to study the properties of perfect numbers. But still many questions about perfect numbers remain unsolved. Two famous conjectures related to perfect numbers are 1. There exist infinitely many perfect numbers. Euler [1] proved that a num- ber is an even perfect numbers iff it can be written as 2p−1(2p − 1) and 2p − 1 is also a prime number.
    [Show full text]
  • Arxiv:2008.10398V1 [Math.NT] 24 Aug 2020 Children He Has
    JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000{000 S 0894-0347(XX)0000-0 RECURSIVELY ABUNDANT AND RECURSIVELY PERFECT NUMBERS THOMAS FINK London Institute for Mathematical Sciences, 35a South St, London W1K 2XF, UK Centre National de la Recherche Scientifique, Paris, France The divisor function σ(n) sums the divisors of n. We call n abundant when σ(n) − n > n and perfect when σ(n) − n = n. I recently introduced the recursive divisor function a(n), the recursive analog of the divisor function. It measures the extent to which a number is highly divisible into parts, such that the parts are highly divisible into subparts, so on. Just as the divisor function motivates the abundant and perfect numbers, the recursive divisor function motivates their recursive analogs, which I introduce here. A number is recursively abundant, or ample, if a(n) > n and recursively perfect, or pristine, if a(n) = n. There are striking parallels between abundant and perfect numbers and their recursive counterparts. The product of two ample numbers is ample, and ample numbers are either abundant or odd perfect numbers. Odd ample numbers exist but are rare, and I conjecture that there are such numbers not divisible by the first k primes|which is known to be true for the abundant numbers. There are infinitely many pristine numbers, but that they cannot be odd, apart from 1. Pristine numbers are the product of a power of two and odd prime solutions to certain Diophantine equations, reminiscent of how perfect numbers are the product of a power of two and a Mersenne prime.
    [Show full text]