Tables of Aliquot Cycles

Total Page:16

File Type:pdf, Size:1020Kb

Tables of Aliquot Cycles 5/29/2017 Tables of Aliquot Cycles http://amicable.homepage.dk/tables.htm Go FEB MAY JUN f ❎ 117 captures 02 ⍰ ▾ About 28 May 2002 ‑ 2 May 2014 2012 2014 2015 this capture Tables of Aliquot Cycles Click on the number of known cycles to view the corresponding lists. Sociable Sociable Numbers Amicable Numbers Numbers Perfect Numbers of order four Type of other orders Known Last Known Last Known Last Known Last Cycles Update Cycles Update Cycles Update Cycles Update 28­Sep­ 01­Oct­ 13­Nov­ 11­Sep­ Ordinary 11994387 142 10 44 2007 2007 2006 2006 28­Sep­ 20­Nov­ 14­Jun­ 14­Dec­ Unitary 4911908 191 24 5 2007 2006 2005 1997 28­Sep­ 28­Sep­ 20­Nov­ 28­Sep­ Infinitary 11538100 5034 129 190 2007 2007 2006 2007 Exponential (note 3089296 28­Sep­ 371 20­Nov­ 38 15­Jun­ 12 06­Dec­ 2) 2007 2006 2005 1998 05­Feb­ 08­May­ 18­Oct­ 11­Mar­ Augmented 1931 2 0 note 1 2002 2003 1997 1998 05­Feb­ 06­Dec­ 06­Dec­ Augmented Unitary 27 0 0 2002 1998 1998 Augmented 10­Sep­ 06­Dec­ 06­Dec­ 425 0 0 Infinitary 2003 1998 1998 15­Feb­ 18­Oct­ 18­Oct­ 11­Mar­ Reduced 1946 0 1 0 2003 1997 1997 1998 Reduced Unitary 28 15­Feb­ 0 06­Dec­ 0 06­Dec­ http://web.archive.org/web/20140502102524/http://amicable.homepage.dk/tables.htm 1/3 5/29/2017 Tables of Aliquot Cycles http://amicable.homepage.dk/tables.htm2003 1998 Go 1998 FEB MAY JUN f ❎ 117 captures 10­Sep­ 06­Dec­ 06­Dec­ 02 ⍰ Reduced Infinitary 427 0 0 ▾ About 28 May 2002 ‑ 2 May 2014 2003 1998 1998 2012 2014 2015 this capture Note 1: All powers of 2 are augmented perfect numbers; no other augmented perfect numbers are known. Note 2: Multiplying all members of an exponential aliquot cycle by a squarefree number prime to all the members of the cycle yields a new exponential aliquot cycle. Cycles that can be constructed from other cycles this way aren't listed (nor counted). Some of the discoverer information in the lists might still be wrong. All kind of updates are welcome. A great thanks to David Moews for sending me a lot of discoverer information. Exhaustive limits This table indicates how far exhaustive searchs for the various kinds of cycles has been carried. For amicable numbers all pairs with smaller member below the limit are known. For sociable numbers all cycles with the member preceeding the largest member below the limit are known. Amicable Numbers Sociable Numbers Perfect Numbers Type Exhaustive below Exhaustive below Exhaustive below Ordinary 1014 51012 10300 Unitary 21012 21011 (21012) Infinitary 51012 21011 (51012) Exponential (41011) (41011) (41011) Augmented 1012 21011 (1012) Augmented Unitary 21011 21011 Augmented Infinitary 21011 21011 Reduced 1012 21011 1035 http://web.archive.org/web/20140502102524/http://amicable.homepage.dk/tables.htm 2/3 5/29/2017 Tables of Aliquot Cycles Reduced Unitary http://amicable.homepage.dk/tables.htm21011 21011 Go FEB MAY JUN f ❎ 117 captures 11 11 02 ⍰ Reduced Infinitary 210 210 ▾ About 28 May 2002 ‑ 2 May 2014 2012 2014 2015 this capture Links Perfect, amicable, and sociable numbers (how to have fun summing up divisors) by David Moews Amicable Pair, Sociable Numbers, Perfect Number, Unitary Amicable Pair, Unitary Sociable Numbers, Unitary Perfect Number, Infinitary Perfect Number, e­Perfect Number, Augmented Amicable Pair, Almost Perfect Number, Quasiamicable Pair, Quasiperfect Number by Eric W. Weisstein Aliquot Sequences by Wolfgang Creyaufmüller (same in German) Last update: 01­Oct­2007 Jan Munch Pedersen, [email protected] http://web.archive.org/web/20140502102524/http://amicable.homepage.dk/tables.htm 3/3.
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]
  • On the Largest Odd Component of a Unitary Perfect Number*
    ON THE LARGEST ODD COMPONENT OF A UNITARY PERFECT NUMBER* CHARLES R. WALL Trident Technical College, Charleston, SC 28411 (Submitted September 1985) 1. INTRODUCTION A divisor d of an integer n is a unitary divisor if gcd (d9 n/d) = 1. If d is a unitary divisor of n we write d\\n9 a natural extension of the customary notation for the case in which d is a prime power. Let o * (n) denote the sum of the unitary divisors of n: o*(n) = £ d. d\\n Then o* is a multiplicative function and G*(pe)= 1 + p e for p prime and e > 0. We say that an integer N is unitary perfect if o* (N) = 2#. In 1966, Sub- baro and Warren [2] found the first four unitary perfect numbers: 6 = 2 * 3 ; 60 = 223 - 5 ; 90 = 2 * 325; 87,360 = 263 • 5 • 7 • 13. In 1969s I announced [3] the discovery of another such number, 146,361,936,186,458,562,560,000 = 2183 • 5^7 • 11 • 13 • 19 • 37 • 79 • 109 * 157 • 313, which I later proved [4] to be the fifth unitary perfect number. No other uni- tary perfect numbers are known. Throughout what follows, let N = 2am (with m odd) be unitary perfect and suppose that K is the largest odd component (i.e., prime power unitary divisor) of N. In this paper we outline a proof that, except for the five known unitary perfect numbers, K > 2 2. TECHNIQUES In light of the fact that 0*(pe) = 1 + pe for p prime, the problem of find- ing a unitary perfect number is equivalent to that of expressing 2 as a product of fractions, with each numerator being 1 more than its denominator, and with the denominators being powers of distinct primes.
    [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]
  • 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]
  • 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
    [Show full text]
  • Universitatis Scientiarum Budapestinensis De Rolando Eötvös Nominatae Sectio Computatorica
    ANNALES Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae sectio computatorica TOMUS XXXIV. REDIGIT I. KÁTAI ADIUVANTIBUS N.L. BASSILY, A. BENCZÚR, BUI MINH PHONG, Z. DARÓCZY, J. DEMETROVICS, R. FARZAN, S. FRIDLI, J. GALAMBOS, J. GONDA, Z. HORVÁTH, K.-H. INDLEKOFER, A. IVÁNYI, A. JÁRAI, J.-M. DE KONINCK, A. KÓSA, M. KOVÁCS, L. KOZMA, L. LAKATOS, P. RACSKÓ, F. SCHIPP, P. SIMON, G. STOYAN, L. SZILI, P.D. VARBANETS, L. VARGA, F. WEISZ 2011 Jarai´ Antal RESULTS ON CLASSES OF FUNCTIONAL EQUATIONS TRIBUTE TO ANTAL JARAI´ by J´anos Acz´el and Che Tat Ng While individual noncomposite functional equations in several variables had been solved at least since d’Alembert 1747 [9] and Cauchy 1821 [8], results on broad classes of such equations began appearing in the 1950’s and 1960’s. On general methods of solution see e.g. Acz´el [1] and for uniqueness of solutions Acz´el [2, 3], Acz´el and Hossz´u [6], Miller [20], Ng [21, 22], followed by several others. – Opening up and cultivating the field of regularization is mainly J´arai’s achievement. By regularization we mean assuming weaker regularity condi- tions, say measurability, of the unknown function and proving differentiability of several orders, for whole classes of functional equations. Differentiability of the unknown function(s) in the functional equation often leads to differential equations that are easier to solve. For example, in Acz´el and Chung [5] it was shown that locally Lebesgue integrable solutions of the functional equation n m fi(x + λiy)= pk(x)qk(y) i=1 k=1 holding for x, y on open real intervals, with appropriate independence between the functions, are in fact differentiable infinitely many times.
    [Show 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 푅− 푛 = 푛 .
    [Show full text]
  • The Humble Sum of Remainders Function
    DRAFT VOL. 78, NO. 4, OCTOBER 2005 1 The Humble Sum of Remainders Function Michael Z. Spivey Samford University Birmingham, Alabama 35229 [email protected] The sum of divisors function is one of the fundamental functions in elementary number theory. In this note, we shine a little light on one of its lesser-known rela- tives, the sum of remainders function. We do this by illustrating how straightforward variations of the sum of remainders can 1) provide an alternative characterization for perfect numbers, and 2) help provide a formula for sums of powers of the first n posi- tive integers. Finally, we give a brief discussion of perhaps why the sum of remainders function, despite its usefulness, is less well known than the sum of divisors function. Some notation is in order. The standard notation for the sum of divisors function is σ(n): X σ(n) = d: djn We denote the sum of remainders function by ½(n), namely, Xn ½(n) = n mod d: d=1 Sums of remainders and perfect numbers A perfect number is a number equal to the sum of its positive divisors excluding itself. Another way to express this is that perfect numbers are those such that σ(n) = 2n. The three smallest perfect numbers are 6; 28, and 496. Euclid proved that every number of the form 2p¡1(2p ¡ 1); where p and 2p ¡ 1 are prime, is perfect. Euler proved the converse, that numbers of this form are the only even perfect numbers [3, p. 59]. One of the famous unsolved problems in number theory is whether or not there are any odd perfect numbers.
    [Show full text]
  • Copyrighted Material
    11194_Darling_c01_f.qxd 6/10/04 9:56 AM Page 3 A abacus The Chinese suan pan differs from the European aba- A counting frame that started out, several thousand years cus in that the board is split into two decks, with two ago, as rows of pebbles in the desert sands of the Middle beads on each rod in the upper deck and five beads, rep- East. The word appears to come from the Hebrew âbâq resenting the digits 0 through 4, on each rod in the bot- (dust) or the Phoenician abak (sand) via the Greek abax, tom. When all five beads on a rod in the lower deck are which refers to a small tray covered with sand to hold the moved up, they’re reset to the original position, and one pebbles steady. The familiar frame-supporting rods or bead in the top deck is moved down as a carry. When wires, threaded with smoothly running beads, gradually both beads in the upper deck are moved down, they’re emerged in a variety of places and mathematical forms. reset and a bead on the adjacent rod on the left is moved In Europe, there was a strange state of affairs for more up as a carry. The result of the computation is read off than 1,500 years. The Greeks and the Romans, and then from the beads clustered near the separator beam the medieval Europeans, calculated on devices with a between the upper and lower decks. In a sense, the aba- place-value system in which zero was represented by an cus works as a 5-2-5-2-5-2...–based number system in empty line or wire.
    [Show full text]
  • 1 Introduction
    Received: 09.11.2016 Year: 2017, Pages: 13-26 Published: 30.11.2017 Original Article** The Abundancy Index of Divisors of Spoof Odd Perfect Numbers Jose Arnaldo1;* <[email protected]> Bebita Dris2 <[email protected]> Department of Mathematics and Physics, Far Eastern University, Manila, Philippines Abstaract − We call n a spoof odd perfect number if n is odd and n = km for two integers k; m > 1 such that σ(k)(m + 1) = 2n, where σ is the sum-of-divisors function. In this paper, we show how results analogous to those of odd perfect numbers could be established for spoof odd perfect numbers (otherwise known in the literature as Descartes numbers). In particular, we predict that an analogue of the Descartes-Frenicle-Sorli conjecture for odd perfect numbers holds for spoof odd perfect numbers. Furthermore, we conjecture that the quasi-Euler prime of a spoof odd perfect number is also its largest quasi-prime factor. Keywords − Abundancy index, spoof odd perfect number, Descartes number. 1 Introduction If N is a positive integer, then we write σ(N) for the sum of the divisors of N. A number N is perfect if σ(N) = 2N. A number M is almost perfect if σ(M) = 2M − 1. It is currently unknown whether there are innitely many even perfect numbers, or whether any odd perfect numbers (OPNs) exist. On the other hand, it is known that powers of two (including 1) are almost perfect, although it is still an open problem to rule out other possible forms of even almost perfect numbers, and also, if 1 will be the only odd almost perfect number to be discovered".
    [Show full text]
  • Numbers 1 to 100
    Numbers 1 to 100 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Tue, 30 Nov 2010 02:36:24 UTC Contents Articles −1 (number) 1 0 (number) 3 1 (number) 12 2 (number) 17 3 (number) 23 4 (number) 32 5 (number) 42 6 (number) 50 7 (number) 58 8 (number) 73 9 (number) 77 10 (number) 82 11 (number) 88 12 (number) 94 13 (number) 102 14 (number) 107 15 (number) 111 16 (number) 114 17 (number) 118 18 (number) 124 19 (number) 127 20 (number) 132 21 (number) 136 22 (number) 140 23 (number) 144 24 (number) 148 25 (number) 152 26 (number) 155 27 (number) 158 28 (number) 162 29 (number) 165 30 (number) 168 31 (number) 172 32 (number) 175 33 (number) 179 34 (number) 182 35 (number) 185 36 (number) 188 37 (number) 191 38 (number) 193 39 (number) 196 40 (number) 199 41 (number) 204 42 (number) 207 43 (number) 214 44 (number) 217 45 (number) 220 46 (number) 222 47 (number) 225 48 (number) 229 49 (number) 232 50 (number) 235 51 (number) 238 52 (number) 241 53 (number) 243 54 (number) 246 55 (number) 248 56 (number) 251 57 (number) 255 58 (number) 258 59 (number) 260 60 (number) 263 61 (number) 267 62 (number) 270 63 (number) 272 64 (number) 274 66 (number) 277 67 (number) 280 68 (number) 282 69 (number) 284 70 (number) 286 71 (number) 289 72 (number) 292 73 (number) 296 74 (number) 298 75 (number) 301 77 (number) 302 78 (number) 305 79 (number) 307 80 (number) 309 81 (number) 311 82 (number) 313 83 (number) 315 84 (number) 318 85 (number) 320 86 (number) 323 87 (number) 326 88 (number)
    [Show full text]