DOCSLIB.ORG

On Perfect Numbers and Their Relations 1 Introduction

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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. Moreover, the perfect numbers are all even and end with 6 or 8. In [5] the author provided detailed information on perfect numbers. In general, we can say that if ap − 1 is prime for some numbers a ≥ 2 and p ≥ 2, then a must equal to 2 and p must be a prime. This means that if we are interested in primes of the form ap − 1 we only need to consider the case that a = 2 and p is prime. Primes of the form 2p − 1 are called Mersenne primes which are available at [15], [16]. If N is an even perfect number, then N looks like N =2p−1(2p − 1) where 2p − 1 is a Mersenne prime. Up to know, only 47 Mersenne primes are known which means that there are 47 known even perfect numbers. There is a conjecture that there are infinitely many perfect numbers. To search for new ones is to keep on going. But to this day no one has been able to discover any odd perfect number. However, no one has yet been able to prove conclusively that none exist. In [8] the author proved any odd perfect number must have the form n =12m +1orn =36q + 9 shortly. In [6] the author proved that no odd perfect number exist in the interval [1, 10300] ⊂ N. We can also define perfect numbers as σ(N)=2N,(N ∈ N) where σ is a divisor function. If p is a prime number and k ≥ 1 than its only divisors are 1 and p. So, σ(p)=p + 1 and σ pk p p2 ... pk pk+1−1 . ( )=1+ + + + = p−1 Furthermore, if 2n+1 − 1=p, N =2np is perfect, then we have, σ(N)=(2n+1 − 1)(p +1)=2n+1p. For any prime p, we have φ(p)=p − 1 where φ is Euler’s totient function defined as the number of invertible elements in an complete residue system. Here are some properties of Euler’s totient function which we use to prove our results; φ(m) (i) If a and m are integers such that (a, m) = 1 then a ≡ 1 (mod m) (ii) If n ≥ 1 we have φ(d)=n d|n n ≥ φ n n. − 1 (iii) For 1 we have ( )= 1 p p|n k n , ..., n k . The harmonic mean of numbers 1 k is 1 +...+ 1 For example, the n1 nk harmonic mean of 1 and 2 is 2/(1 + 1/2) = 4/3. Such an integer is called Ore harmonic number or harmonic divisor number. According the theorem of Ore; every perfect number is harmonic. n is called superperfect number if σ(σ(n)) = 2n and every even superperfect number n must be a power of 2, that is, 2p−1 such that 2p − 1 is a Mersenne prime. On perfect numbers and their relations 1339 A unitary perfect number is an integer which is the sum of its positive proper unitary divisors, not including the number itself. (A divisor d of a number n is d n unitary divisor if and d share no common factors). T. Yamada [13] showed that 9 and 165 are all of the odd unitary superperfect numbers. A. Bege gave a table of k-hyperperfect numbers in [1] which defined n as; k− n k σ n − n − σ n k+1 n k−1 . hyperfect number if =1+ [ ( ) 1] and so ( )= k + k Also, they proved a conjecture which states that all 2-hyperferfect numbers are of the form n =(3k − 1).(3k − 2) where 3k − 2 is prime. In [7] the author computed all hyperperfect numbers less than 1011. σ σ n 3 n n If ( ( )) = 2 ( + 1), then is called super-hyperperfect number. In [1] the authors studied generalized perfect numbers, presented some conjectures and n p−1 p 3p−1 numerical results. They conjectured that, if =3 where and 2 are primes, then n is a super-hyperperfect number. In [11] the author studied on perfect numbers and their composition with arithmetical functions. 2 n is called multiplicatively e-perfect if Te(n)=n where Te(n) denote the prod- uct of exponential divisors of n. In [10] a characterization of multiplicatively e-perfect and similar numbers is given. An alternative proof for characteriza- tion of e-perfect and e-superperfect numbers can be found in [3]. For further information on perfect numbers see also [2], [4], [9], [12], [14]. 2 Main Results Theorem 2.1. If k ≥ 1, 1+2+4+... + k =2k − 1 where (2k − 1) is prime and k(2k − 1) is a perfect number, then φ(k[2k − 1]) = k(k − 1). (1) Moreover, if k[2k − 1] = 2n(2n+1 − 1) is an Euclid number, then φ(2n[2n+1 − 1]) = 2n(2n − 1). (2) Proof. Let k ≥ 1 , 1+2+4+... + k =2k − 1 and 2k − 1 is prime. Since φ(k[2k − 1]) is a multiplicative function and (k, 2k − 1) = 1, we can write φ(k[2k − 1]) = φ(k).φ(2k − 1). From hypothesis k is even and is of the form 2n (n ≥ 1). By using a property of Euler’s totient function, we can write, 1 k φ(k)=k.(1 − )= (3) 2 2 Since 2k − 1 is prime, φ(2k − 1) = 2k − 2 (4) From (3) and (4), we obtain 1340 Recep G¨ur and Nihal Bircan k φ(k[2k − 1]) = φ(k).φ(2k − 1) = (2k − 2) 2 φ(k[2k − 1]) = k(k − 1). Any even perfect number is an Euclid number, that is, it is of the form 2n(2n+1 − 1) where 2n+1 − 1 is prime. So, if k =2n and 2k − 1=2n+1 − 1is prime, then k[2k−1] is an Euclid number. So, φ(2n[2n+1 −1]) = 2n(2n −1). Proposition 2.2. If N>6 is a perfect number, then φ(N) is even and φ(N) is not a prime. Proof. Let N is a perfect number. From the result of Euclid theorem and theorem 2.1, N = k.(2k − 1) and φ(k[2k − 1]) = k(k − 1). Also, 2|k.(k − 1) so φ(N) is an even number and φ(6) = 2 and from hypothesis N>6soφ(N) > 2. Moreover, k|φ(N) and (k − 1)|φ(N)soφ(N) is not a prime. Corollary 2.3. If N is a perfect number and N = k.(2k − 1), then there is at least a natural number n which satisfies n|φ(N) and (n +1)|φ(N). Proof. It is clear from theorem 2.1. √ Proposition 2.4. If φ(N)=b and N is a perfect number, then 4b +1is a Mersenne prime. Proof. From the result of theorem 2.1, we can write b = k.(k − 1), b = k2 − k 1 1 b =(k − )2 − 2 4 2 1 1 b + = k − 4 2 1 1 ± b + = k − 4 2 (1 + 4b) 1 k = ± + √ 4 2 2k − 1=± 4b +1 From the√ result of theorem 2.1, (2k −1) is a Mersenne prime. So, it is positive. Thus, 4b + 1 is a Mersenne prime. Proposition 2.5. If N =2n(2n+1 − 1) is an Euclid number, then φ(N 2)=N.φ(N). On perfect numbers and their relations 1341 Proof. By using a property of Euler’s totient function and theorem 2.1, we can write 1 1 φ(N 2)=φ(22n(2n+1 − 1)2)=22n(2n+1 − 1)(2n+1 − 1). .(1 − ) 2 2n+1 − 1 =22n(2n+1 − 1)(2n − 1) =2n(2n+1 − 1)[2n(2n − 1)] = N.φ(N). Theorem 2.6. Let p is a Mersenne prime and p =2n+1 − 1. If N =2n(2n+1 − 1) is a perfect number, then 4p σ(N)= φ(N). p − 1 or 2n+2 − 2 σ(N)= φ(N). 2n − 1 Proof. From hypothesis and theorem 2.1, we can write φ N φ np n n − .
Load more

Recommended publications
  • 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]
  • Primality Testing for Beginners
    STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker http://dx.doi.org/10.1090/stml/070 Primality Testing for Beginners STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell Gerald B. Folland (Chair) Serge Tabachnikov The cover illustration is a variant of the Sieve of Eratosthenes (Sec- tion 1.5), showing the integers from 1 to 2704 colored by the number of their prime factors, including repeats. The illustration was created us- ing MATLAB. The back cover shows a phase plot of the Riemann zeta function (see Appendix A), which appears courtesy of Elias Wegert (www.visual.wegert.com). 2010 Mathematics Subject Classification. Primary 11-01, 11-02, 11Axx, 11Y11, 11Y16. For additional information and updates on this book, visit www.ams.org/bookpages/stml-70 Library of Congress Cataloging-in-Publication Data Rempe-Gillen, Lasse, 1978– author. [Primzahltests f¨ur Einsteiger. English] Primality testing for beginners / Lasse Rempe-Gillen, Rebecca Waldecker. pages cm. — (Student mathematical library ; volume 70) Translation of: Primzahltests f¨ur Einsteiger : Zahlentheorie - Algorithmik - Kryptographie. Includes bibliographical references and index. ISBN 978-0-8218-9883-3 (alk. paper) 1. Number theory. I. Waldecker, Rebecca, 1979– author. II. Title. QA241.R45813 2014 512.72—dc23 2013032423 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given.
    [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]
  • 2017 Grand Lodge of Minnesota Annual Communication Proceedings
    2017 PROCEEDINGS The Grand Lodge A.F. and A.M. Minnesota Robert L. Darling, Grand Master Link to interactive index page 2017 ANNUAL PROCEEDINGS GRAND LODGE A. F. & A. M. of MINNESOTA 11501 Masonic Home Drive Bloomington, MN 55437-3699 952-948-6700 800-245-6050 952-948-6710 Fax E-Mail:[email protected] www.mn-masons.org 2017 ANNUAL PROCEEDINGS 3 ROBERT L. DARLING GRAND MASTER 4 GRAND LODGE OF MINNESOTA BIOGRAPHY GRAND MASTER ROBERT L. DARLING Robert L. Darling, “Bob”, was born on February 17, 1956 in Mattoon, Illinois. His parents were Russell D. and Theresa D. Darling. They lived in Greenup, Illinois. The family moved from Greenup to Decatur, Illinois and then to Maroa, Illinois where he attended the Maroa Elementary and Maroa-Forsyth High School. After graduating from the high school in mid-year, Bob enrolled and attended Illinois State University located in Normal, Illinois. In December 1976, he graduated with a B.S. Degree in Industrial Technology. Bob has worked for numerous companies including Caterpillar Inc. in Decatur, Illinois; Baldwin Associates, Clinton, Illinois; Schrock Cabinets/An Electrolux Company, Arthur, Illinois, Electrolux Home Products, St. Cloud, Minnesota. He is currently employed with the State of Minnesota, Department of Labor and Industry, OSHA Enforcement as a Safety Investigator Principal, and has worked there since 2003. Bob has been a Master Mason for 29 years. He was initiated on November 23, 1987; passed to a Fellowcraft on December 12, 1987; and was raised to the Sublime Degree of a Master Mason on January 9, 1988 by Maroa Lodge No.
    [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]
  • Euclid's Number Theory
    Euclid of Alexandria, II: Number Theory Euclid of Alexandria, II: Number Theory Waseda University, SILS, History of Mathematics Euclid of Alexandria, II: Number Theory Outline Introduction Euclid’s number theory The overall structure Definitions for number theory Theory of prime numbers Properties of primes Infinitude of primes Euclid of Alexandria, II: Number Theory Introduction Concepts of number § The natural numbers is the set N “ t1; 2; 3;::: u. § The whole numbers is the set W “ t0; 1; 2; 3;::: u. § The integers is the set of positive and negative whole numbers Z “ t0; 1; ´1; 2; ´2;::: u. § The rational numbers is the set Q, of numbers of the form p{q, where p; q P Z,1 but q ‰ 0. § The real numbers, R, is the set of all the values mapped to the points of the number line. (The definition is tricky.) § An irrational number is a number that belongs to the reals, but is not rational. 1The symbol P means “in the set of,” or “is an element of.” Euclid of Alexandria, II: Number Theory Introduction The Greek concept of number § Greek number theory was exclusively interested in natural numbers. § In fact, the Greek also did not regard “1” as a number, but rather considered it the unit by which other numbers are numbered (or measured). § We can define Greek natural numbers as G “ t2; 3; 4;::: u. (But we can do most Greek number theory with N, so we will generally use this set, for simplicity.) Euclid of Alexandria, II: Number Theory Introduction Number theory before Euclid § The semi-legendary Pythagorus himself and other Pythagoreans are attributed with a fascination with numbers and with the development of a certain “pebble arithmetic” which studied the mathematical properties of numbers that correspond to certain geometry shapes (figurate numbers).
    [Show full text]
  • Euclid's Proof of the Infinitude of Primes
    Euclid’s Proof of the Infinitude of Primes: Distorted, Clarified, Made Obsolete, and Confirmed in Modern Mathematics REINHARD SIEGMUND-SCHULTZE n this article1 I reflect on the recurrent theme of Michael Hardy and Catherine Woodgold (henceforth modernizing historical mathematical proofs, vocabulary, H&W) entitled ‘‘Prime Simplicity’’ appeared in this journal II and symbolism, and the extent to which this modern- in 2009. H&W discuss Euclid’s proof mainly from the ization serves to clarify, is able to preserve, or is bound to point of view of its distortion by modern authors who distort the original meaning. My example is also a quite often claim that it had the form of a reductio ad recurrent one: Euclid’s proof of the infinitude of primes absurdum.3 in book IX, theorem 20 of his Elements. Elementary My article, on the other hand, aims at a systematic pre- number theory is a very appropriate field for discussing sentation and logical analysis of Euclid’s proof (as it is such general historiographic questions on a nontechnical preserved in the critical editions by Euclid scholars) and, level.2 Indeed, a widely quoted and stimulating article by above all, at a more detailed discussion of its interpretation 1I dedicate this article to Walter Purkert (Bonn), the coordinator and very active force behind the excellent Felix Hausdorff edition soon to be completed, on the occasion of his 70th birthday in 2014. 2Mesˇ trovic´ (2012) contains many details on modern proofs of the infinitude of primes but is less interested in Euclid’s original theorem and its modern variants.
    [Show full text]
  • Eureka Issue 61
    Eureka 61 A Journal of The Archimedeans Cambridge University Mathematical Society Editors: Philipp Legner and Anja Komatar © The Archimedeans (see page 94 for details) Do not copy or reprint any parts without permission. October 2011 Editorial Eureka Reinvented… efore reading any part of this issue of Eureka, you will have noticed The Team two big changes we have made: Eureka is now published in full col- our, and printed on a larger paper size than usual. We felt that, with Philipp Legner Design and Bthe internet being an increasingly large resource for mathematical articles of Illustrations all kinds, it was necessary to offer something new and exciting to keep Eu- reka as successful as it has been in the past. We moved away from the classic Anja Komatar Submissions LATEX-look, which is so common in the scientific community, to a modern, more engaging, and more entertaining design, while being conscious not to Sean Moss lose any of the mathematical clarity and rigour. Corporate Ben Millwood To make full use of the new design possibilities, many of this issue’s articles Publicity are based around mathematical images: from fractal modelling in financial Lu Zou markets (page 14) to computer rendered pictures (page 38) and mathemati- Subscriptions cal origami (page 20). The Showroom (page 46) uncovers the fundamental role pictures have in mathematics, including patterns, graphs, functions and fractals. This issue includes a wide variety of mathematical articles, problems and puzzles, diagrams, movie and book reviews. Some are more entertaining, such as Bayesian Bets (page 10), some are more technical, such as Impossible Integrals (page 80), or more philosophical, such as How to teach Physics to Mathematicians (page 42).
    [Show full text]
  • On the Composition of Some Arithmetic Functions, II
    On the composition of some arithmetic functions, II. J´ozsefS´andor Department of Mathematics and Computer Science, Babe¸s-Bolyai University, Cluj-Napoca e-mail: [email protected], [email protected] Abstract We study certain properties and conjuctures on the composition of the arithmetic functions σ, ϕ, ψ, where σ is the sum of divisors function, ϕ is Euler’s totient, and ψ is Dedekind’s function. AMS subject classification: 11A25, 11N37. Key Words and Phrases: Arithmetic functions, Makowski-Schinzel conjuncture, S´andor’s conjuncture, inequalities. 1 Introduction P Let σ(n) denote the sum of divisors of the positive integer n, i.e. σ(n) = d/n d, where by convention σ(1) = 1. It is well-known that n is called perfect if σ(n) = 2n. Euclid and Euler ([10], [21]) have determined all even perfect numbers, by showing that they are of the form n = 2k(2k+1 − 1), where 2k+1 − 1 is a prime (k ≥ 1). The primes of the form 2k+1 − 1 are the so-called Mersenne primes, and at this moment there are known exactly 41 such primes (for the recent discovery of the 41th Mersenne prime, see the site www.ams.org). Probably, there are infinitely many Mersenne primes, but the proof of this result seems unattackable at present. On the other hand, no odd perfect number is known, and the existence of such numbers is one of the most difficult open problems of Mathematics. D. Suryanarayana [23] defined the notion of superperfect number, i.e. number n with property σ(σ(n)) = 2n, and he and H.J.
    [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]
  • Introduction to the Theory of Numbers (Chicago University Press, 1929 : Introduction)
    AN INTRODUCTION TO THE THEORY OF NUMBERS AN INTRODUCTION TO THE THEORYOFNUMBERS BY G. H. HARDY AND E. M. WRIGHT Principal and Vice-Chancellor of the University of Aberdeen FOURTH EDITION OX.FORD AT THE CLARENDON PRESS Ox@d University Press, Ely House, London W. 1 OLASOOWNEW YORK TORONTOMELBOURNE WELLINGTON CAPETOWN IBADAN NAIROBI DAR ES SALAAMI.USAKA ADDISABABA DELEI BOMBAYC.4I.CUTTA MADRAS KARACHI LAHOREDACCA KUALALUMPUR SINOAPORE HONO RONO TOKYO ISBN 0 19 853310 7 Fi& edition 1938 Second edition xg45 Third edition 1954 Fourth edition 1960 rg6z (with corrections) 1965 (with corrections) 1968 (with cowectiona) =97=> 1975 Printed in Great B&ain at the University Press, Oxford by Vivian Ridler Printer to the University PREFACE TO THE FOURTH EDITION APART from the provision of an index of names, the main changes in this edition are in the Notes at the end of each chapter. These have been revised to include references to results published since the third edition went to press and to correct omissions. Therc are simpler proofs of Theorems 234, 352, and 357 and a new Theorem 272. The Postscript to the third edition now takes its proper place as part of Chapter XX. 1 am indebted to several correspondents who suggested improvements and corrections. 1 have to thank Dr. Ponting for again reading the proofs and Mrs. V. N. R. Milne for compiling the index of names. E. M. W. ABERDEEN July 1959 PREFACE TO THE FIRST EDITION THIS book has developed gradually from lectures delivered in a number of universities during the last ten years, and, like many books which have grown out of lectures, it has no very definite plan.
    [Show full text]