DOCSLIB.ORG

The Schnirelmann Density of the Set of Deficient Numbers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

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. His never wavering confidence in me drove me through many a pot of coffee and finally paid off with this thesis. iii ABSTRACT The goal of this discussion is to determine the Schnirelmann density of the deficient numbers, which is not currently known. The Schnirelmann density for deficient numbers is defined as σpDq “ infrDpnq{ns, where Dpnq denotes the cardinality of the set of deficient numbers not exceeding n, and inf is the infimum operator. This density is of particular interest because of the useful properties that it possesses. The Schnirelmann density of the deficient numbers can be found by finding a local minimum density in an initial interval of the natural numbers and then lower- bounding the density over the rest of the set of natural numbers. The lower bound for the density of deficient numbers is equivalent to an upper bound for the density of the complement set of the deficient numbers, the non-deficient numbers. To achieve our goal we incorporate Felix Behrend’s procedure for bounding the density of the non-deficient numbers with some improvements to reduce the effects of the approximations he made. With this information about the two intervals, it is expected to arrive at the Schnirelmann density of deficient numbers. iv Contents Signature Page ii Acknowledgements iii Abstract iv List of Tables vii List of Figures viii 1 Exposition 1 1.1 Where did it all start? ......................... 1 1.2 Density in Mathematics ........................ 3 1.3 The Schnirelmann Density ....................... 5 1.4 More from the Number Theorist’s Handbook . 6 2 Developing The Bound 11 2.1 The Candidate Number ........................ 11 2.2 Bounding the Contributors ....................... 12 2.3 Calculating the Density of Non-Deficients . 17 2.4 Revisiting the Bound .......................... 19 v 3 Results and Interpretations 22 3.1 Initial Bounds: Behrend’s Result ................... 22 3.2 An Illustration of the Bounding Method . 24 3.3 The Refining Process .......................... 25 4 The Schnirelmann Density of Deficient Numbers 31 4.1 Improvements on Bound and Execution Time . 32 4.2 Second-Order Terms and Further Research . 35 Bibiliography 38 Appendices 39 A Deficient Data 39 B Programs 41 B.1 Program 1 ................................ 41 B.2 Program 2 ................................ 44 vi List of Tables 3.1 Conditions for improvement ...................... 26 3.2 Revised conditions for improvement . 28 3.3 Final conditions for improvement ................... 28 4.1 τ Specific Densities of Non-deficient Numbers . 31 4.2 Improved τ Specific Densities of Non-deficient Numbers . 34 4.3 Further Improved τ Specific Densities of Non-deficient Numbers . 34 A.1 Density of Deficient Numbers up to n ................. 39 A.2 Density of Deficient Numbers up to n continued ........... 40 vii List of Figures 2.1 Density of Deficient Numbers ..................... 11 3.1 Partition Scheme ............................ 24 3.2 Cardinality Partition Scheme up to n ................. 25 viii Chapter 1 Exposition 1.1 Where did it all start? Euclid (300 B.C.) made mention of different types of numbers in his thirteen- book treatise called The Elements. This collection of mathematics is considered by many to be one of the most influential works in the history of mathematics. In the Elements, Euclid realized the principles of what is now called Euclidean geometry from a small set of axioms. This collection contains works on perspective, conic sections, spherical geometry, number theory and rigor. Euclid talks about a specific type of number called perfect or complete. Nicomachus (100 C.E.) continued this discussion and categorized the natural numbers into three types.[1] These numbers have the property that the sum of their proper divisors either is greater than the number itself, is the number itself, or is less than number itself. The perfect numbers are the numbers where the sum of their proper divisors is the number itself. To understand mathematically and symbolically what a perfect number is, consider the following definition and developed notation. 1 (Note that N denotes the number theorist’s set of natural numbers, t1; 2; 3;::: u.) Notation. If n P N, let σpnq denote the sum of all the divisors of n, σpnq “ d. d|n ¸ Definition. If n P N and σpnq “ 2n, then n is perfect. Euclid’s Elements contains the first recorded mathematical result regarding per­ fect numbers. Proposition 36 of Book IX of the Elements states: For some k ¡ 1 with 2k ´1 prime, 2k´1p2k ´1q is a perfect number.[8] Using the k values t2; 3; 5; 7u, we find that the first four perfect numbers are 6; 28; 496 and 8;128. Notice that σp6q “ 1 ` 2 ` 3 ` 6 “ 12 “ 2p6q. A similar calculation verifies the membership of 28; 496 and 8;128 in the set of perfect numbers which will be notated P. It should be noted that the cardinality of this set is neither known to be finite nor infinite. For future use, it will be beneficial to have some general notation for sets of natural numbers and their corresponding cardinalities. Notation. Let S Ď N with S “ |S| the cardinality of S. We will use the notation Spnq if we desire the subset S X r1; ns and Spnq for the cardinality of Spnq. As one might observe, for the set of perfect numbers that Euclid’s formula pro­ vides, there is a sizeable subset of the natural numbers that is unaccounted for. Making use of the divisor function, σpnq, it is observed that the set of natural numbers, N, can be partitioned into three sets of numbers, each possessing a dis­ tinct divisor sum characteristic. The characteristics are σpnq ¡ 2n, σpnq “ 2n and σpnq ă 2n. We shall call these subsets the set of abundant numbers, per­ fect numbers and deficient numbers, respectively. We will use the notation Λ for 2 the abundant numbers and D for the deficient. Note that Λ Y P Y D “ N and Λpnq Y Ppnq Y Dpnq “ Npnq. To assert that D is a non-empty set that is infinite, consider the fact that for any prime number p, σppq “ p ` 1 ă 2p and hence D contains the infinite subset P, the set of prime numbers. To assert that Λ is an infinite set, consider that for any positive multiple mn of n P P where m ¡ 1, σpmnq ¡ 2n. (We know that σpnq “ d “ 2n. Regardless d|n ¸ of what factors n and m have in common, we have that σpmnq ¥ m ¨ d ` 1 ¥ d|n mp2nq ` 1 ¡ 2mn.) ¸ 1.2 Density in Mathematics In mathematics, the density of a subset of numbers contained in a larger set is de­ fined to be the ratio of the cardinality of the subset to the cardinality of the larger set if this ratio exists. It should be clear that the density of any subset of a set will have a value in the interval r0; 1s. In the case that both the subset and parent set are finite, the calculation is quite elementary. For example, one could ask what is the density of numbers that are even in the set t1; 2; 3; 4; 5; 6; 7; 8; 9; 10u? The elements of the set that are even are t2; 4; 6; 8; 10u and hence the answer to the question is exactly determined by the calculation: |t2; 4; 6; 8; 10u| 5 ““ 0:5: |t1; 2; 3; 4; 5; 6; 7; 8; 9; 10u| 10 In the case where the two sets are not finite, the ratio of cardinalities is in indeterminate form and determining the density is not elementary, so we need a 3 new definition for the density of a subset and as it pertains to this paper, a subset of natural numbers. To aid in the calculation process, let’s develop some working notation to handle potentially infinite sets. Notation. Let S Ď N. Denote the natural density of S by dpSq, where dpSq “ Spnq lim , provided the limit exists. nÑ8 n With this notation, we can determine the natural density of any subset, S, of natural Spnq Spnq numbers, provided dpSq “ dpSq where dpSq “ lim and dpSq “ lim .
Recommended publications
  • Arithmetic Equivalence and Isospectrality

    Arithmetic Equivalence and Isospectrality

    ARITHMETIC EQUIVALENCE AND ISOSPECTRALITY ANDREW V.SUTHERLAND ABSTRACT. In these lecture notes we give an introduction to the theory of arithmetic equivalence, a notion originally introduced in a number theoretic setting to refer to number fields with the same zeta function. Gassmann established a direct relationship between arithmetic equivalence and a purely group theoretic notion of equivalence that has since been exploited in several other areas of mathematics, most notably in the spectral theory of Riemannian manifolds by Sunada. We will explicate these results and discuss some applications and generalizations. 1. AN INTRODUCTION TO ARITHMETIC EQUIVALENCE AND ISOSPECTRALITY Let K be a number field (a finite extension of Q), and let OK be its ring of integers (the integral closure of Z in K). The Dedekind zeta function of K is defined by the Dirichlet series X s Y s 1 ζK (s) := N(I)− = (1 N(p)− )− I OK p − ⊆ where the sum ranges over nonzero OK -ideals, the product ranges over nonzero prime ideals, and N(I) := [OK : I] is the absolute norm. For K = Q the Dedekind zeta function ζQ(s) is simply the : P s Riemann zeta function ζ(s) = n 1 n− . As with the Riemann zeta function, the Dirichlet series (and corresponding Euler product) defining≥ the Dedekind zeta function converges absolutely and uniformly to a nonzero holomorphic function on Re(s) > 1, and ζK (s) extends to a meromorphic function on C and satisfies a functional equation, as shown by Hecke [25]. The Dedekind zeta function encodes many features of the number field K: it has a simple pole at s = 1 whose residue is intimately related to several invariants of K, including its class number, and as with the Riemann zeta function, the zeros of ζK (s) are intimately related to the distribution of prime ideals in OK .
  • Density Theorems for Reciprocity Equivalences. Thomas Carrere Palfrey Louisiana State University and Agricultural & Mechanical College

    Density Theorems for Reciprocity Equivalences. Thomas Carrere Palfrey Louisiana State University and Agricultural & Mechanical College

    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Louisiana State University Louisiana State University LSU Digital Commons LSU Historical Dissertations and Theses Graduate School 1989 Density Theorems for Reciprocity Equivalences. Thomas Carrere Palfrey Louisiana State University and Agricultural & Mechanical College Follow this and additional works at: https://digitalcommons.lsu.edu/gradschool_disstheses Recommended Citation Palfrey, Thomas Carrere, "Density Theorems for Reciprocity Equivalences." (1989). LSU Historical Dissertations and Theses. 4799. https://digitalcommons.lsu.edu/gradschool_disstheses/4799 This Dissertation is brought to you for free and open access by the Graduate School at LSU Digital Commons. It has been accepted for inclusion in LSU Historical Dissertations and Theses by an authorized administrator of LSU Digital Commons. For more information, please contact [email protected]. INFORMATION TO USERS The most advanced technology has been used to photo­ graph and reproduce this manuscript from the microfilm master. UMI films the text directly from the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be from any type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and improper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. Oversize materials (e.g., maps, drawings, charts) are re­ produced by sectioning the original, beginning at the upper left-hand corner and continuing from left to right in equal sections with small overlaps.
  • Input for Carnival of Math: Number 115, October 2014

    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.
  • 4 L-Functions

    4 L-Functions

    Further Number Theory G13FNT cw ’11 4 L-functions In this chapter, we will use analytic tools to study prime numbers. We first start by giving a new proof that there are infinitely many primes and explain what one can say about exactly “how many primes there are”. Then we will use the same tools to proof Dirichlet’s theorem on primes in arithmetic progressions. 4.1 Riemann’s zeta-function and its behaviour at s = 1 Definition. The Riemann zeta function ζ(s) is defined by X 1 1 1 1 1 ζ(s) = = + + + + ··· . ns 1s 2s 3s 4s n>1 The series converges (absolutely) for all s > 1. Remark. The series also converges for complex s provided that Re(s) > 1. 2 4 P 1 Example. From the last chapter, ζ(2) = π /6, ζ(4) = π /90. But ζ(1) is not defined since n diverges. However we can still describe the behaviour of ζ(s) as s & 1 (which is my notation for s → 1+, i.e. s > 1 and s → 1). Proposition 4.1. lim (s − 1) · ζ(s) = 1. s&1 −s R n+1 1 −s Proof. Summing the inequality (n + 1) < n xs dx < n for n > 1 gives Z ∞ 1 1 ζ(s) − 1 < s dx = < ζ(s) 1 x s − 1 and hence 1 < (s − 1)ζ(s) < s; now let s & 1. Corollary 4.2. log ζ(s) lim = 1. s&1 1 log s−1 Proof. Write log ζ(s) log(s − 1)ζ(s) 1 = 1 + 1 log s−1 log s−1 and let s & 1.
  • Jeff Connor IDEAL CONVERGENCE GENERATED by DOUBLE

    Jeff Connor IDEAL CONVERGENCE GENERATED by DOUBLE

    DEMONSTRATIO MATHEMATICA Vol. 49 No 1 2016 Jeff Connor IDEAL CONVERGENCE GENERATED BY DOUBLE SUMMABILITY METHODS Communicated by J. Wesołowski Abstract. The main result of this note is that if I is an ideal generated by a regular double summability matrix summability method T that is the product of two nonnegative regular matrix methods for single sequences, then I-statistical convergence and convergence in I-density are equivalent. In particular, the method T generates a density µT with the additive property (AP) and hence, the additive property for null sets (APO). The densities used to generate statistical convergence, lacunary statistical convergence, and general de la Vallée-Poussin statistical convergence are generated by these types of double summability methods. If a matrix T generates a density with the additive property then T -statistical convergence, convergence in T -density and strong T -summabilty are equivalent for bounded sequences. An example is given to show that not every regular double summability matrix generates a density with additve property for null sets. 1. Introduction The notions of statistical convergence and convergence in density for sequences has been in the literature, under different guises, since the early part of the last century. The underlying generalization of sequential convergence embodied in the definition of convergence in density or statistical convergence has been used in the theory of Fourier analysis, ergodic theory, and number theory, usually in connection with bounded strong summability or convergence in density. Statistical convergence, as it has recently been investigated, was defined by Fast in 1951 [9], who provided an alternate proof of a result of Steinhaus [23].
  • Natural Density and the Quantifier'most'

    Natural Density and the Quantifier'most'

    Natural Density and the Quantifier “Most” Sel¸cuk Topal and Ahmet C¸evik Abstract. This paper proposes a formalization of the class of sentences quantified by most, which is also interpreted as proportion of or ma- jority of depending on the domain of discourse. We consider sentences of the form “Most A are B”, where A and B are plural nouns and the interpretations of A and B are infinite subsets of N. There are two widely used semantics for Most A are B: (i) C(A ∩ B) > C(A \ B) C(A) and (ii) C(A ∩ B) > , where C(X) denotes the cardinality of a 2 given finite set X. Although (i) is more descriptive than (ii), it also produces a considerable amount of insensitivity for certain sets. Since the quantifier most has a solid cardinal behaviour under the interpre- tation majority and has a slightly more statistical behaviour under the interpretation proportional of, we consider an alternative approach in deciding quantity-related statements regarding infinite sets. For this we introduce a new semantics using natural density for sentences in which interpretations of their nouns are infinite subsets of N, along with a list of the axiomatization of the concept of natural density. In other words, we take the standard definition of the semantics of most but define it as applying to finite approximations of infinite sets computed to the limit. Mathematics Subject Classification (2010). 03B65, 03C80, 11B05. arXiv:1901.10394v2 [math.LO] 14 Mar 2019 Keywords. Logic of natural languages; natural density; asymptotic den- sity; arithmetic progression; syllogistic; most; semantics; quantifiers; car- dinality.
  • A Study of .Perfect Numbers and Unitary Perfect

    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 • , , •• , , , .
  • L-Functions and Densities

    L-Functions and Densities

    MATH 776 APPLICATIONS: L-FUNCTIONS AND DENSITIES ANDREW SNOWDEN 1. Dirichlet series P an A Dirichlet series is a series of the form n≥1 ns where the an are complex numbers. Q −s −1 An Euler product is a product of the form p fp(p ) , where the product is over prime numbers p and fp(T ) is a polynomial (called the Euler factor at p) with constant term 1. One can formally expand an Euler product to obtain a Dirichlet series. A Dirichlet series admits an Euler product if and only if an is a multiplicative function of n (i.e., anm = anam for (n; m) = 1) and n 7! apn satisfies a linear recursion for each prime p. P 1 Example 1.1. The Riemann zeta function is ζ(s) = n≥1 ns . It admits the Euler Q −s −1 product ζ(s) = p(1 − p ) . Example 1.2. Let K be a number field. The Dedekind zeta function of K is ζK (s) = P 1 a N(a)−s , where the sum is over all integral ideals a. Note that this is indeed a Dirichlet P an series, as it can be written in the form n≥1 ns where an is the number of ideals of norm n. Q −s −1 It admits the Euler product p(1 − N(p) ) , where the product is over all prime ideals. Q −s −1 Q f(pjp) Note this this can be written as p fp(p ) , where fp(T ) = pjp(1 − T ) and f(pjp) denotes the degree of the residue field extension, and thus indeed fits our definition of Euler product.
  • A Simple Information Theoretical Proof of the Fueter-Pólya Conjecture

    A Simple Information Theoretical Proof of the Fueter-Pólya Conjecture

    A simple information theoretical proof of the Fueter-P´olya Conjecture Pieter W. Adriaans ILLC, FNWI-IVI, SNE University of Amsterdam, Science Park 107 1098 XG Amsterdam, The Netherlands. Abstract We present a simple information theoretical proof of the Fueter-P´olya Conjec- ture: there is no polynomial pairing function that defines a bijection between the set of natural numbers N and its product set N2 of degree higher than 2. We show that the assumption that such a function exists allows us to con- struct a set of natural numbers that is both compressible and dense. This contradicts a central result of complexity theory that states that the density of the set of compressible numbers is zero in the limit. Keywords: Fueter P´olya Conjecture, Kolmogorov complexity, computational complexity, data structures, theory of computation. 1. Introduction and sketch of the proof The set of natural numbers N can be mapped to its product set by the two so-called Cantor pairing functions π : N2 ! N that defines a two-way polynomial time computable bijection: π(x; y) := 1=2(x + y)(x + y + 1) + y (1) The Fueter - P´olya theorem (Fueter and P´olya (1923)) states that the Cantor pairing function and its symmetric counterpart π0(x; y) = π(y; x) are the only possible quadratic pairing functions. The original proof by Fueter Email address: [email protected] (Pieter W. Adriaans) Preprint submitted to Information Processing Letters January 2, 2018 and P´olya is complex, but a simpler version was published in Vsemirnov (2002) (cf. Nathanson (2016)).
  • Arxiv:2106.08994V2 [Math.GM] 1 Aug 2021 Efc Ubr N30b.H Rvdta F2 If That and Proved Properties He Studied BC

    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.
  • Arxiv:2008.10398V1 [Math.NT] 24 Aug 2020 Children He Has

    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.
  • Integer Sequences

    Integer Sequences

    UHX6PF65ITVK Book > Integer sequences Integer sequences Filesize: 5.04 MB Reviews A very wonderful book with lucid and perfect answers. It is probably the most incredible book i have study. Its been designed in an exceptionally simple way and is particularly just after i finished reading through this publication by which in fact transformed me, alter the way in my opinion. (Macey Schneider) DISCLAIMER | DMCA 4VUBA9SJ1UP6 PDF > Integer sequences INTEGER SEQUENCES Reference Series Books LLC Dez 2011, 2011. Taschenbuch. Book Condition: Neu. 247x192x7 mm. This item is printed on demand - Print on Demand Neuware - Source: Wikipedia. Pages: 141. Chapters: Prime number, Factorial, Binomial coeicient, Perfect number, Carmichael number, Integer sequence, Mersenne prime, Bernoulli number, Euler numbers, Fermat number, Square-free integer, Amicable number, Stirling number, Partition, Lah number, Super-Poulet number, Arithmetic progression, Derangement, Composite number, On-Line Encyclopedia of Integer Sequences, Catalan number, Pell number, Power of two, Sylvester's sequence, Regular number, Polite number, Ménage problem, Greedy algorithm for Egyptian fractions, Practical number, Bell number, Dedekind number, Hofstadter sequence, Beatty sequence, Hyperperfect number, Elliptic divisibility sequence, Powerful number, Znám's problem, Eulerian number, Singly and doubly even, Highly composite number, Strict weak ordering, Calkin Wilf tree, Lucas sequence, Padovan sequence, Triangular number, Squared triangular number, Figurate number, Cube, Square triangular