DOCSLIB.ORG

Handbook of Number Theory I ( Sandor, Mitrinovic

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Handbook of Number Theory I ( Sandor, Mitrinovic Handbook of Number Theory I by József Sándor Babes-Bolyai University of Cluj, Cluj-Napoca, Romania Dragoslav S. Mitrinović formerly of the University of Belgrade, Servia and Borislav Crstici formerly of the Technical University of Timisoara, Romania A C.I.P. Catalogue record for this book is available from the Library of Congress. ISBN-10 1-4020-4215-9 (HB) ISBN-13 978-1-4020-4215-7 (HB) ISBN-10 1-4020-3658-2 (e-book) ISBN-13 978-1-4020-3658-3 (e-book) Published by Springer, P.O. Box 17, 3300 AA Dordrecht, The Netherlands. www.springeronline.com Printed on acid-free paper 1st ed. 1995. 2nd printing All Rights Reserved © 2006 Springer No part of this work may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, microfilming, recording or otherwise, without written permission from the Publisher, with the exception of any material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Printed in the Netherlands. TABLE OF CONTENTS PREFACE ....................................................................................... xxv BASIC SYMBOLS ............................................................................ 1 BASIC NOTATIONS.......................................................................... 2 Chapter I EULER’S ϕ-FUNCTION..................................................................... 9 § I. 1 Elementary inequalities for ␸ .............................................. 9 § I. 2 Inequalities for ␸(mn)....................................................... 9 § I. 3 Relations connecting ␸, ␴, d ............................................... 10 § I. 4 Inequalities for Jk , ␴k , ␺ k ................................................... 11 § I. 5 Unitary analogues of Jk , ␴k , d ............................................. 12 § I. 6 Composition of ␸, ␴, ␺ ..................................................... 13 § I. 7 Composition of ␴, ␸ ......................................................... 13 § I. 8 On the function n/␸(n) ...................................................... 14 § I. 9 Minimum of ␸(n)/n for consecutive values of n ....................... 15 § I.10 On ␸(n + 1)/␸(n)........................................................... 16 § I.11 On (␸(n + 1), ␸(n)) ......................................................... 18 § I.12 On (n, ␸(n)) ................................................................... 18 § I.13 The difference of consecutive totients ................................... 19 § I.14 Nonmonotonicity of ␸ .(Ameasure) .................................... 19 § I.15 Nonmonotonicity of Jk ..................................................... 20 § I.16 Number of solutions of ␸(x) = n! ........................................ 20 § I.17 Number of solutions of ␸(x) = m ........................................ 21 § I.18 Number of values of ␸ less than or equal to x ......................... 22 § I.19 On composite n with ␸(n)|(n − 1) (Lehmer’s conjecture) ........... 23 § I.20 Number of composite n ≤ x with ␸(n)|(n − 1) ........................ 24 § I.21 ␸(n) ........................................................................ 24 n≤x k § I.22 f · ␸(k) ............................................................ 25 k≤n n 3 § I.23 On ␸(n) − x2 ........................................................ 25 ␲2 n≤x § I.24 On ␸(n)/n ................................................................ 27 n≤x vi Table of Contents § k+1 I.25 On Jk (n) − x /(k + 1)␨(k + 1) ................................... 28 n≤x § I.26 An expansion of Jk .......................................................... 29 § /␸ I.27 On n≤x 1 (n) and related questions .................................. 29 § ␸ − I.28 p≤x (p 1) for p prime ............................................... 30 § ␸ , I.29 On n≤x ( f(n)) f a polynomial ....................................... 31 § ␸∗ , ␸ ␸ + I.30 n≤x (n) n≤x (n) (n k) and related results ................. 31 § I.31 Asymptotic formulae for generalized Euler functions ................ 32 § ␸ , = I.32 On (x n) m≤x,(m,n)=1 1 and on Jacobstahl’s arithmetic function ........................................................................ 33 § I.33 On the iteration of ␸ ........................................................ 34 § I.34 Iterates of ␸ and the order of ␸(k)(n)/␸(k+1)(n)........................ 35 § I.35 Normal order of ␻(␸(n)) ................................................... 36 Chapter II THE ARITHMETICAL FUNCTION d(n), ITS GENERALIZATIONS AND ITS ANALOGUES.................................................................................. 39 § II. 1 The divisor functions at consecutive integers .......................... 39 § II. 2 On d(n + i1) > ···> d(n + ir ) .......................................... 40 § II. 3 Relations connecting d, ␻, , dk ......................................... 41 § II. 4 On d(mn) ..................................................................... 42 § II. 5 An inequality for dk (n) ..................................................... 42 § II. 6 Majorization for log d(n)/ log 2 .......................................... 42 § II. 7 max d(n) and max(d(n), d(n + 1)) and generalizations .............. 44 n≤x n≤x § II. 8 Highly composite, superior highly composite, and largely composite numbers .......................................................... 45 § II. 9 Congruence property of d(n) .............................................. 47 § II.10 (x) = d(n) − x log x − (2␥ − 1)x ............................... 47 n≤x § II.11 d(p − 1), p prime ..................................................... 49 p≤x § II.12 k (x) = dk (n) − x · Pk−1(log x), k ≥ 2 ........................... 51 n≤x § 2 II.13 dk (n) ..................................................................... 55 n≤x § II.14 On (g ∗ dk )(n) .......................................................... 55 n≤x § II.15 3(x) .......................................................................... 56 § II.16 The divisor problem in arithmetic progressions ...................... 57 § II.17 On 1/dk (n) .............................................................. 59 n≤x Table of Contents vii § II.18 Average order of dk (n) over integers free of large prime factors ......................................................................... 60 § II.19 On a sum on dk and Legendre’s symbol ................................ 60 § II.20 A sum on dk , d and ␻ ...................................................... 61 § II.21 On d(n) · d(n + N) and related problems ......................... 61 n≤x § II.22 On dk (n) · d(n + 1) and related questions ......................... 63 n≤x § II.23 Iteration of d ................................................................. 65 § II.24 On d( f (n)) and d(d( f (n))), f a polynomial .......................... 66 § II.25 On d(n2 + a) and d(m2 + n2) ................................ 67 n≤x m,n≤x § II.26 d(| f (r, s)|), f (x, y)abinary cubic form .................... 68 | f (r,s)|≤N § II.27 Weighted divisor problem ................................................. 68 § II.28 On d(n − kt ) .......................................................... 69 k<n1/t § II.29 Divisor sums on squarefree or squarefull integers .................... 69 § II.30 Exponential divisors ....................................................... 71 § II.31 Bi-unitary divisors .......................................................... 72 § II.32 Sums over d(n) · ␻(n), d(n)/␻(n), ␻(d(n)), (d(n)) ................ 72 § II.33 d(a(n)), a(n) the number of abelian groups with n n≤x elements ...................................................................... 73 § II.34 d(n)inshort intervals ...................................................... 73 § II.35 Number of distinct values of d(n) for 1 ≤ n ≤ x ..................... 74 § II.36 On the distribution function of d(n) ..................................... 74 § II.37 On (nd(n), ␴(n)) = 1 ...................................................... 75 § II.38 Average value for the number of divisors of sums a + b ............ 75 Chapter III SUM-OF-DIVISORS FUNCTION, GENERALIZATIONS, ANALOGUES; PERFECT NUMBERS AND RELATED PROBLEMS ................................ 77 § III. 1 Elementary inequalities on ␴(n) and ␴(n)/n ......................... 77 § III. 2 On ␴(n)/n log log n ........................................................ 79 § ␴ / k III. 3 On k (n) n................................................................. 80 § III. 4 ␴(n), ␴(n), ␴(n) ................................... 81 n≤x n≤x,p|n n≤x,(n,k)=1 ␴(n) § III. 5 Sums over ............................................................ 82 n § III. 6 Sums over ␴k (n) ............................................................ 83 § III. 7 On sums over ␴−␣( f (n)), f a polynomial (0 < ␣ < 1) ............. 84 viii Table of Contents § III. 8 On ␴( f (n)), f a polynomial ......................................... 85 n≤x § III. 9 Sums on ␴␣(n), ␴␤(n + k)................................................. 85 § III.10 Inequalities connecting ␴k , d, ␥, .................................... 86 § III.11 Sums over ␴(p − 1), p a prime ......................................... 87 § III.12 On ␴(mn) ................................................................... 87 § III.13 On ␴(n) ≥ 4␸(n) .......................................................... 88 § III.14 On ␴(n + i)/␴(n + i − 1) and related theorems .................... 88 § III.15 On ␴(␴(n)); ␴∗(␴∗(n))
Load more

Recommended publications
  • Define Composite Numbers and Give Examples
    Define Composite Numbers And Give Examples Hydrotropic and amphictyonic Noam upheaves so injunctively that Hudson charcoal his nymphomania. immanently,Chase eroding she her shells chorine it transiently. bluntly, tameless and scenographic. Ethan bargees her stalagmometers Transponder much money frank had put up by our counselor will tell the numbers and composite number is called the whole or a number of improved methods capable of To give examples. Similarly, when subtraction is performed, the similar pattern is observed. Explicit Teach section and bill discuss the difference between composite and prime numbers. What bout the difference between a prime number does a composite number. That captures the hour well school is said a job enough definition because it. Cite Nimisha Kaushik Difference Between road and Composite Numbers. Write down the multiplication facts as you do this. When we talk getting the divisors of another prime number we had always talking a natural numbers whole numbers greater than 0 Examples of Prime Numbers 2. But opting out of some of these cookies may have an effect on your browsing experience. All of that the positive integer a paragraph in this is already registered with multiple. Are there for prime numbers? The side number is incorrect. Find our prime factorization of whole numbers. Example 11 is a prime number field the only numbers it quiz be divided by evenly is 1 and 11 What is Composite Number Composite numbers has. Lorem ipsum dolor in a composite and gives you know if you. See more ideas about surface and composite numbers prime and composite 4th grade.
    [Show full text]
  • On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function
    mathematics Article On Fixed Points of Iterations Between the Order of Appearance and the Euler Totient Function ŠtˇepánHubálovský 1,* and Eva Trojovská 2 1 Department of Applied Cybernetics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic 2 Department of Mathematics, Faculty of Science, University of Hradec Králové, 50003 Hradec Králové, Czech Republic; [email protected] * Correspondence: [email protected] or [email protected]; Tel.: +420-49-333-2704 Received: 3 October 2020; Accepted: 14 October 2020; Published: 16 October 2020 Abstract: Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest positive integer k such that Fk ≡ 0 (mod n). In this paper, we shall find all positive solutions of the Diophantine equation z(j(n)) = n, where j is the Euler totient function. Keywords: Fibonacci numbers; order of appearance; Euler totient function; fixed points; Diophantine equations MSC: 11B39; 11DXX 1. Introduction Let (Fn)n≥0 be the sequence of Fibonacci numbers which is defined by 2nd order recurrence Fn+2 = Fn+1 + Fn, with initial conditions Fi = i, for i 2 f0, 1g. These numbers (together with the sequence of prime numbers) form a very important sequence in mathematics (mainly because its unexpectedly and often appearance in many branches of mathematics as well as in another disciplines). We refer the reader to [1–3] and their very extensive bibliography. We recall that an arithmetic function is any function f : Z>0 ! C (i.e., a complex-valued function which is defined for all positive integer).
    [Show full text]
  • Prime Divisors in the Rationality Condition for Odd Perfect Numbers
    Aid#59330/Preprints/2019-09-10/www.mathjobs.org RFSC 04-01 Revised The Prime Divisors in the Rationality Condition for Odd Perfect Numbers Simon Davis Research Foundation of Southern California 8861 Villa La Jolla Drive #13595 La Jolla, CA 92037 Abstract. It is sufficient to prove that there is an excess of prime factors in the product of repunits with odd prime bases defined by the sum of divisors of the integer N = (4k + 4m+1 ℓ 2αi 1) i=1 qi to establish that there do not exist any odd integers with equality (4k+1)4m+2−1 between σ(N) and 2N. The existence of distinct prime divisors in the repunits 4k , 2α +1 Q q i −1 i , i = 1,...,ℓ, in σ(N) follows from a theorem on the primitive divisors of the Lucas qi−1 sequences and the square root of the product of 2(4k + 1), and the sequence of repunits will not be rational unless the primes are matched. Minimization of the number of prime divisors in σ(N) yields an infinite set of repunits of increasing magnitude or prime equations with no integer solutions. MSC: 11D61, 11K65 Keywords: prime divisors, rationality condition 1. Introduction While even perfect numbers were known to be given by 2p−1(2p − 1), for 2p − 1 prime, the universality of this result led to the the problem of characterizing any other possible types of perfect numbers. It was suggested initially by Descartes that it was not likely that odd integers could be perfect numbers [13]. After the work of de Bessy [3], Euler proved σ(N) that the condition = 2, where σ(N) = d|N d is the sum-of-divisors function, N d integer 4m+1 2α1 2αℓ restricted odd integers to have the form (4kP+ 1) q1 ...qℓ , with 4k + 1, q1,...,qℓ prime [18], and further, that there might exist no set of prime bases such that the perfect number condition was satisfied.
    [Show full text]
  • An Analysis of Primality Testing and Its Use in Cryptographic Applications
    An Analysis of Primality Testing and Its Use in Cryptographic Applications Jake Massimo Thesis submitted to the University of London for the degree of Doctor of Philosophy Information Security Group Department of Information Security Royal Holloway, University of London 2020 Declaration These doctoral studies were conducted under the supervision of Prof. Kenneth G. Paterson. The work presented in this thesis is the result of original research carried out by myself, in collaboration with others, whilst enrolled in the Department of Mathe- matics as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educational establishment. Jake Massimo April, 2020 2 Abstract Due to their fundamental utility within cryptography, prime numbers must be easy to both recognise and generate. For this, we depend upon primality testing. Both used as a tool to validate prime parameters, or as part of the algorithm used to generate random prime numbers, primality tests are found near universally within a cryptographer's tool-kit. In this thesis, we study in depth primality tests and their use in cryptographic applications. We first provide a systematic analysis of the implementation landscape of primality testing within cryptographic libraries and mathematical software. We then demon- strate how these tests perform under adversarial conditions, where the numbers being tested are not generated randomly, but instead by a possibly malicious party. We show that many of the libraries studied provide primality tests that are not pre- pared for testing on adversarial input, and therefore can declare composite numbers as being prime with a high probability.
    [Show full text]
  • Paul Erdős and the Rise of Statistical Thinking in Elementary Number Theory
    Paul Erd®s and the rise of statistical thinking in elementary number theory Carl Pomerance, Dartmouth College based on the joint survey with Paul Pollack, University of Georgia 1 Let us begin at the beginning: 2 Pythagoras 3 Sum of proper divisors Let s(n) be the sum of the proper divisors of n: For example: s(10) = 1 + 2 + 5 = 8; s(11) = 1; s(12) = 1 + 2 + 3 + 4 + 6 = 16: 4 In modern notation: s(n) = σ(n) − n, where σ(n) is the sum of all of n's natural divisors. The function s(n) was considered by Pythagoras, about 2500 years ago. 5 Pythagoras: noticed that s(6) = 1 + 2 + 3 = 6 (If s(n) = n, we say n is perfect.) And he noticed that s(220) = 284; s(284) = 220: 6 If s(n) = m, s(m) = n, and m 6= n, we say n; m are an amicable pair and that they are amicable numbers. So 220 and 284 are amicable numbers. 7 In 1976, Enrico Bombieri wrote: 8 There are very many old problems in arithmetic whose interest is practically nil, e.g., the existence of odd perfect numbers, problems about the iteration of numerical functions, the existence of innitely many Fermat primes 22n + 1, etc. 9 Sir Fred Hoyle wrote in 1962 that there were two dicult astronomical problems faced by the ancients. One was a good problem, the other was not so good. 10 The good problem: Why do the planets wander through the constellations in the night sky? The not-so-good problem: Why is it that the sun and the moon are the same apparent size? 11 Perfect numbers, amicable numbers, and similar topics were important to the development of elementary number theory.
    [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]
  • 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]
  • MORE-ON-SEMIPRIMES.Pdf
    MORE ON FACTORING SEMI-PRIMES In the last few years I have spent some time examining prime numbers and their properties. Among some of my new results are the a Prime Number Function F(N) and the concept of Number Fraction f(N). We can define these quantities as – (N ) N 1 f (N 2 ) 1 f (N ) and F(N ) N Nf (N 3 ) Here (N) is the divisor function of number theory. The interesting property of these functions is that when N is a prime then f(N)=0 and F(N)=1. For composite numbers f(N) is a positive fraction and F(N) will be less than one. One of the problems of major practical interest in number theory is how to rapidly factor large semi-primes N=pq, where p and q are prime numbers. This interest stems from the fact that encoded messages using public keys are vulnerable to decoding by adversaries if they can factor large semi-primes when they have a digit length of the order of 100. We want here to show how one might attempt to factor such large primes by a brute force approach using the above f(N) function. Our starting point is to consider a large semi-prime given by- N=pq with p<sqrt(N)<q By the basic definition of f(N) we get- p q p2 N f (N ) f ( pq) N pN This may be written as a quadratic in p which reads- p2 pNf (N ) N 0 It has the solution- p K K 2 N , with p N Here K=Nf(N)/2={(N)-N-1}/2.
    [Show full text]
  • Mathematical Gems
    AMS / MAA DOLCIANI MATHEMATICAL EXPOSITIONS VOL 1 Mathematical Gems ROSS HONSBERGER MATHEMATICAL GEMS FROM ELEMENTARY COMBINATORICS, NUMBER THEORY, AND GEOMETRY By ROSS HONSBERGER THE DOLCIANI MATHEMATICAL EXPOSITIONS Published by THE MArrHEMATICAL ASSOCIATION OF AMERICA Committee on Publications EDWIN F. BECKENBACH, Chairman 10.1090/dol/001 The Dolciani Mathematical Expositions NUMBER ONE MATHEMATICAL GEMS FROM ELEMENTARY COMBINATORICS, NUMBER THEORY, AND GEOMETRY By ROSS HONSBERGER University of Waterloo Published and Distributed by THE MATHEMATICAL ASSOCIATION OF AMERICA © 1978 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 73-89661 Complete Set ISBN 0-88385-300-0 Vol. 1 ISBN 0-88385-301-9 Printed in the United States of Arnerica Current printing (last digit): 10 9 8 7 6 5 4 3 2 1 FOREWORD The DOLCIANI MATHEMATICAL EXPOSITIONS serIes of the Mathematical Association of America came into being through a fortuitous conjunction of circumstances. Professor-Mary P. Dolciani, of Hunter College of the City Uni­ versity of New York, herself an exceptionally talented and en­ thusiastic teacher and writer, had been contemplating ways of furthering the ideal of excellence in mathematical exposition. At the same time, the Association had come into possession of the manuscript for the present volume, a collection of essays which seemed not to fit precisely into any of the existing Associa­ tion series, and yet which obviously merited publication because of its interesting content and lucid expository style. It was only natural, then, that Professor Dolciani should elect to implement her objective by establishing a revolving fund to initiate this series of MATHEMATICAL EXPOSITIONS.
    [Show full text]
  • Cullen Numbers with the Lehmer Property
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000–000 S 0002-9939(XX)0000-0 CULLEN NUMBERS WITH THE LEHMER PROPERTY JOSE´ MAR´IA GRAU RIBAS AND FLORIAN LUCA Abstract. Here, we show that there is no positive integer n such that n the nth Cullen number Cn = n2 + 1 has the property that it is com- posite but φ(Cn) | Cn − 1. 1. Introduction n A Cullen number is a number of the form Cn = n2 + 1 for some n ≥ 1. They attracted attention of researchers since it seems that it is hard to find primes of this form. Indeed, Hooley [8] showed that for most n the number Cn is composite. For more about testing Cn for primality, see [3] and [6]. For an integer a > 1, a pseudoprime to base a is a compositive positive integer m such that am ≡ a (mod m). Pseudoprime Cullen numbers have also been studied. For example, in [12] it is shown that for most n, Cn is not a base a-pseudoprime. Some computer searchers up to several millions did not turn up any pseudo-prime Cn to any base. Thus, it would seem that Cullen numbers which are pseudoprimes are very scarce. A Carmichael number is a positive integer m which is a base a pseudoprime for any a. A composite integer m is called a Lehmer number if φ(m) | m − 1, where φ(m) is the Euler function of m. Lehmer numbers are Carmichael numbers; hence, pseudoprimes in every base. No Lehmer number is known, although it is known that there are no Lehmer numbers in certain sequences, such as the Fibonacci sequence (see [9]), or the sequence of repunits in base g for any g ∈ [2, 1000] (see [4]).
    [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]
  • The Aliquot Constant We first Show the Following Result on the Geometric Mean for the Ordi- Nary Sum of Divisors Function
    THE ALIQUOT CONSTANT WIEB BOSMA AND BEN KANE Abstract. The average value of log s(n)/n taken over the first N even integers is shown to converge to a constant λ when N tends to infinity; moreover, the value of this constant is approximated and proven to be less than 0. Here s(n) sums the divisors of n less than n. Thus the geometric mean of s(n)/n, the growth factor of the function s, in the long run tends to be less than 1. This could be interpreted as probabilistic evidence that aliquot sequences tend to remain bounded. 1. Introduction This paper is concerned with the average growth of aliquot sequences. An aliquot sequence is a sequence a0, a1, a2,... of positive integers ob- tained by iteration of the sum-of-aliquot-divisors function s, which is defined for n> 1 by s(n)= d. d|n Xd<n The aliquot sequence with starting value a0 is then equal to 2 a0, a1 = s(a0), a2 = s(a1)= s (a0),... ; k we will say that the sequence terminates (at 1) if ak = s (a0)=1 for some k ≥ 0. The sequence cycles (or is said to end in a cycle) k l 0 if s (a0) = s (a0) for some k,l with 0 ≤ l<k, where s (n) = n by arXiv:0912.3660v1 [math.NT] 18 Dec 2009 definition. Note that s is related to the ordinary sum-of-divisors function σ, with σ(n)= d|n d, by s(n)= σ(n) − n for integers n> 1.
    [Show full text]