Handbook of number theory

HANDBOOK OF NUMBER THEORY II by J. Sándor Babes¸-Bolyai University of Cluj Department of Mathematics and Computer Scien...

Author: Jozsef Sandor | Borislav Crstici

209 downloads 1686 Views 2MB Size Report

This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form

DOWNLOAD PDF

HANDBOOK OF NUMBER THEORY II by J. Sándor Babes¸-Bolyai University of Cluj Department of Mathematics and Computer Science Cluj-Napoca, Romania

and B. Crstici formerly the Technical University of Timis¸oara Timis¸oara Romania

KLUWER ACADEMIC PUBLISHERS DORDRECHT / BOSTON / LONDON

A C.I.P. Catalogue record for this book is available from the Library of Congress.

ISBN 1-4020-2546-7 (HB) ISBN 1-4020-2547-5 (e-book) Published by Kluwer Academic Publishers, P.O. Box 17, 3300 AA Dordrecht, The Netherlands. Sold and distributed in North, Central and South America by Kluwer Academic Publishers, 101 Philip Drive, Norwell, MA 02061, U.S.A. In all other countries, sold and distributed by Kluwer Academic Publishers, P.O. Box 322, 3300 AH Dordrecht, The Netherlands.

Printed on acid-free paper

All Rights Reserved 2004 Kluwer Academic Publishers 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. C

Printed in the Netherlands.

Contents PREFACE

7

BASIC SYMBOLS

9

BASIC NOTATIONS 1

10

PERFECT NUMBERS: OLD AND NEW ISSUES; PERSPECTIVES 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Some historical facts . . . . . . . . . . . . . . . . . . . 1.3 Even perfect numbers . . . . . . . . . . . . . . . . . . . 1.4 Odd perfect numbers . . . . . . . . . . . . . . . . . . . 1.5 Perfect, multiperfect and multiply perfect numbers . . . 1.6 Quasiperfect, almost perfect, and pseudoperfect numbers . . . . . . . . . . . . . . . . . . . . . . . . . . 1.7 Superperfect and related numbers . . . . . . . . . . . . 1.8 Pseudoperfect, weird and harmonic numbers . . . . . . . 1.9 Unitary, bi-unitary, infinitary-perfect and related numbers 1.10 Hyperperfect, exponentially perfect, integer-perfect and γ -perfect numbers . . . . . . . . . . . . . . . . . . 1.11 Multiplicatively perfect numbers . . . . . . . . . . . . . 1.12 Practical numbers . . . . . . . . . . . . . . . . . . . . . 1.13 Amicable numbers . . . . . . . . . . . . . . . . . . . . 1.14 Sociable numbers . . . . . . . . . . . . . . . . . . . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

15 15 16 20 23 32

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

36 38 42 45

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

50 55 58 60 72

References 2

77

GENERALIZATIONS AND EXTENSIONS OF THE ¨ MOBIUS FUNCTION 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

99 99

CONTENTS

2.2

2.3

2.4

2.5

Möbius functions generated by arithmetical products (or convolutions) . . . . . . . . . . . . . . . . . . . . . . . . 1 Möbius functions defined by Dirichlet products . . . . 2 Unitary Möbius functions . . . . . . . . . . . . . . . 3 Bi-unitary Möbius function . . . . . . . . . . . . . . 4 Möbius functions generated by regular convolutions . 5 K -convolutions and Möbius functions. B convolution . 6 Exponential Möbius functions . . . . . . . . . . . . . 7 l.c.m.-product (von Sterneck-Lehmer) . . . . . . . . . 8 Golomb-Guerin convolution and Möbius function . . . 9 max-product (Lehmer-Buschman) . . . . . . . . . . . 10 Infinitary convolution and Möbius function . . . . . . 11 Möbius function of generalized (Beurling) integers . . 12 Lucas-Carlitz (l-c) product and Möbius functions . . . 13 Matrix-generated convolution . . . . . . . . . . . . . Möbius function generalizations by other number theoretical considerations . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Apostol’s Möbius function of order k . . . . . . . . . 2 Sastry’s Möbius function . . . . . . . . . . . . . . . . 3 Möbius functions of Hanumanthachari and Subrahmanyasastri . . . . . . . . . . . . . . . . . . . 4 Cohen’s Möbius functions and totients . . . . . . . . . 5 Klee’s Möbius function and totient . . . . . . . . . . . 6 Möbius functions of Subbarao and Harris; Tanaka; and Venkataraman and Sivaramakrishnan . . . . . . . 7 Möbius functions as coefficients of the cyclotomic polynomial . . . . . . . . . . . . . . . . . . . . . . . Möbius functions of posets and lattices . . . . . . . . . . . . . 1 Introduction, basic results . . . . . . . . . . . . . . . 2 Factorable incidence functions, applications . . . . . . 3 Inversion theorems and applications . . . . . . . . . . 4 Möbius functions on Eulerian posets . . . . . . . . . . 5 Miscellaneous results . . . . . . . . . . . . . . . . . . Möbius functions of arithmetical semigroups, free groups, finite groups, algebraic number fields, and trace monoids . . . 1 Möbius functions of arithmetical semigroups . . . . . 2 Fee abelian groups and Möbius functions . . . . . . . 3 Möbius functions of finite groups . . . . . . . . . . . 2

. . . . . . . . . . . . . .

. . . . . . . . . . . . . .

. . . . . . . . . . . . . .

106 106 110 111 112 114 117 119 121 122 124 124 125 127

. . . . . . . . .

129 129 130

. . . . . . . . .

132 134 135

. . .

136

. . . . . . .

. . . . . . .

. . . . . . .

138 139 139 143 145 146 148

. . . .

. . . .

. . . .

148 148 151 154

CONTENTS

4 5

Möbius functions of algebraic number and function-fields . . . . . . . . . . . . . . . . . . . . . . . . Trace monoids and Möbius functions . . . . . . . . . . . .

References 3

159 161 163

THE MANY FACETS OF EULER’S TOTIENT 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 The infinitude of primes . . . . . . . . . . . . . . . . 2 Exact formulae for primes in terms of ϕ . . . . . . . . 3 Infinite series and products involving ϕ, Pillai’s (Cesàro’s) arithmetic functions . . . . . . . 4 Enumeration problems on congruences, directed graphs, magic squares . . . . . . . . . . . . . . . . . 5 Fourier coefficients of even functions (mod n) . . . . . 6 Algebraic independence of arithmetic functions . . . . 7 Algebraic and analytic application of totients . . . . . 8 ϕ-convergence of Schoenberg . . . . . . . . . . . . . 3.2 Congruence properties of Euler’s totient and related functions . 1 Euler’s divisibility theorem . . . . . . . . . . . . . . . 2 Carmichael’s function, maximal generalization of Fermat’s theorem . . . . . . . . . . . . . . . . . . . . 3 Gauss’ divisibility theorem . . . . . . . . . . . . . . . 4 Minimal, normal, and average order of Carmichael’s function . . . . . . . . . . . . . . . . . . . . . . . . . 5 Divisibility properties of iteration of ϕ . . . . . . . . . 6 Congruence properties of ϕ and related functions . . . 7 Euler’s totient in residue classes . . . . . . . . . . . . 8 Prime totatives . . . . . . . . . . . . . . . . . . . . . 9 The dual of ϕ, noncototients . . . . . . . . . . . . . . 10 Euler minimum function . . . . . . . . . . . . . . . . 11 Lehmer’s conjecture, generalizations and extensions . 3.3 Equations involving Euler’s and related totients . . . . . . . . 1 Equations of type ϕ(x + k) = ϕ(x) . . . . . . . . . . 2 ϕ(x + k) = 2ϕ(x + k) = ϕ(x) + ϕ(k) and related equations . . . . . . . . . . . . . . . . . . . . . . . . 3 Equation ϕ(x) = k, Carmichael’s conjecture . . . . . 4 Equations involving ϕ and other arithmetic functions . 5 The composition of ϕ and other arithmetic functions . 6 Perfect totient numbers and related results . . . . . . . 3

. . . . . . . . .

179 179 180 180

. . .

181

. . . . . . .

. . . . . . .

183 184 185 186 187 188 188

. . . . . .

189 191

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

193 195 201 204 206 208 210 212 216 216

. . . . .

. . . . .

. . . . .

221 225 230 234 240

. . . . . . .

CONTENTS

3.4

3.5

3.6

3.7

The totatives (or totitives) of a number . . . . . . . . . . . . . . 1 Historical notes, congruences . . . . . . . . . . . . . . 2 The distribution of totatives . . . . . . . . . . . . . . . 3 Adding totatives . . . . . . . . . . . . . . . . . . . . . 4 Adding units (mod n) . . . . . . . . . . . . . . . . . . 5 Distribution of inverses (mod n) . . . . . . . . . . . . Cyclotomic polynomials . . . . . . . . . . . . . . . . . . . . . 1 Introduction, irreducibility results . . . . . . . . . . . . 2 Divisibility properties . . . . . . . . . . . . . . . . . . 3 The coefficients of cyclotomic polynomials . . . . . . . 4 Miscellaneous results . . . . . . . . . . . . . . . . . . . Matrices and determinants connected with ϕ . . . . . . . . . . . 1 Smith’s determinant . . . . . . . . . . . . . . . . . . . 2 Poset-theoretic generalizations . . . . . . . . . . . . . . 3 Factor-closed, gcd-closed, lcm-closed sets, and related determinants . . . . . . . . . . . . . . . . . . . 4 Inequalities . . . . . . . . . . . . . . . . . . . . . . . . Generalizations and extensions of Euler’s totient . . . . . . . . . 1 Jordan, Jordan-Nagell, von Sterneck, Cohen-totients . . 2 Schemmel, Schemmel-Nagell, Lucas-totients . . . . . . 3 Ramanujan’s sum . . . . . . . . . . . . . . . . . . . . . 4 Klee’s totient . . . . . . . . . . . . . . . . . . . . . . . 5 Nagell’s, Adler’s, Stevens’, Kesava Menon’s totients . . 6 Unitary, semi-unitary, bi-unitary totients . . . . . . . . . 7 Alladi’s totient . . . . . . . . . . . . . . . . . . . . . . 8 Legendre’s totient . . . . . . . . . . . . . . . . . . . . . 9 Euler totients of meet semilattices and finite fields . . . 10 Nonunitary, infinitary, exponential-totients . . . . . . . 11 Thacker’s, Leudesdorf’s, Lehmer’s, Golubev’s totients. Square totient, core-reduced totient, M-void totient, additive totient . . . . . . . . . . . . . . . . . . . . . . 12 Euler totients of arithmetical semigroups, finite groups, algebraic number fields, semigroups, finite commutative rings, finite Dedekind domains . . . . . . . . . . . . . .

. . . . . . . . . . . . . .

. . . . . . . . . . . . . .

242 242 246 248 249 250 251 251 253 256 261 263 263 266

. . . . . . . . . . . . .

. . . . . . . . . . . . .

270 273 275 275 276 277 278 278 281 282 283 285 287

. .

289

. .

292

References 4

295

SPECIAL ARITHMETIC FUNCTIONS CONNECTED WITH THE DIVISORS, OR WITH THE DIGITS OF A NUMBER 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

329 329

CONTENTS

4.2

4.3

Special arithmetic functions connected with the divisors of a number . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Maximum and minimum exponents . . . . . . . . . . 2 The product of exponents . . . . . . . . . . . . . . . . 3 Arithmetic functions connected with the prime power factors . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Other functions; the derived sequence of a number . . 5 The consecutive prime divisors of a number . . . . . . 6 The consecutive divisors of an integer . . . . . . . . . 7 Functional limit theorems for the consecutive divisors 8 Miscellaneous arithmetic functions connected with divisors . . . . . . . . . . . . . . . . . . . . . . . . . 9 Arithmetic functions of consecutive divisors . . . . . . 10 Hooley’s function . . . . . . . . . . . . . . . . . . 11 Extensions of the Erdös conjecture (theorem) . . . . . 12 The divisors in residue classes and in intervals . . . . 13 Divisor density and distribution (mod 1) on divisors . 14 The fractal structure of divisors . . . . . . . . . . . . 15 The divisor graphs . . . . . . . . . . . . . . . . . . . Arithmetic functions associated to the digits of a number . . . 1 The average order of the sum-of-digits function . . . . 2 Bounds on the sum-of-digits function . . . . . . . . . 3 The sum of digits of primes . . . . . . . . . . . . . . 4 Niven numbers . . . . . . . . . . . . . . . . . . . . . 5 Smith numbers . . . . . . . . . . . . . . . . . . . . . 6 Self numbers . . . . . . . . . . . . . . . . . . . . . . 7 The sum-of-digits function in residue classes . . . . . 8 Thue-Morse and Rudin-Shapiro sequences . . . . . . 9 q-additive and q-multiplicative functions . . . . . . . 10 Uniform - and well - distributions of αsq (n) . . . . . . 11 The G-ary digital expansion of a number . . . . . . . 12 The sum-of-digits function for negative integer bases . 13 The sum-of-digits function in algebraic number fields . 14 The symmetric signed digital expansion . . . . . . . . 15 Infinite sums and products involving the sum-of-digits function . . . . . . . . . . . . . . . . . . . . . . . . . 16 Miscellaneous results on digital expansions . . . . . .

References

. . . . . . . . .

330 330 332

. . . . .

. . . . .

. . . . .

334 336 337 342 343

. . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . . . . . . . . . . . . . . .

345 349 360 363 363 366 367 369 371 371 376 379 381 383 384 387 390 401 410 414 417 418 421

. . . . . .

423 427 433

5

CONTENTS

5

STIRLING, BELL, BERNOULLI, EULER AND EULERIAN NUMBERS 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.2 Stirling and Bell numbers . . . . . . . . . . . . . . . . . . . . 1 Stirling numbers of both kinds, Lah numbers . . . . . 2 Identities for Stirling numbers . . . . . . . . . . . . . 3 Generalized Stirling numbers . . . . . . . . . . . . . 4 Congruences for Stirling and Bell numbers . . . . . . 5 Diophantine results . . . . . . . . . . . . . . . . . . . 6 Inequalities and estimates . . . . . . . . . . . . . . . 5.3 Bernoulli and Euler numbers . . . . . . . . . . . . . . . . . . 1 Definitions, basic properties of Bernoulli numbers and polynomials . . . . . . . . . . . . . . . . . . . . 2 Identities . . . . . . . . . . . . . . . . . . . . . . . . 3 Congruences for Bernoulli numbers and polynomials. Eulerian numbers and polynomials . . . . . . . . . . . 4 Estimates and inequalities . . . . . . . . . . . . . . .

. . . . . . . . .

459 459 459 459 464 469 488 507 508 525

. . . . . .

525 534

. . . . . .

539 574

. . . . . . . . .

. . . . . . . . .

References

585

Index

619

6

Preface The aim of this book is to systematize and survey in an easily accessible manner the most important results from some parts of Number Theory, which are connected with many other fields of Mathematics or Science. Each chapter can be viewed as an encyclopedia of the considered field, with many facets and interconnections with virtually almost all major topics as Discrete mathematics, Combinatorial theory, Numerical analysis, Finite difference calculus, Probability theory; and such classical fields of mathematics as Algebra, Geometry, and Mathematical analysis. Some aspects of Chapter 1 and 3 on Perfect numbers and Euler’s totient, have been considered also in our former volume ”Handbook of Number Theory” (Kluwer Academic Publishers, 1995), in cooperation with the late Professor D. S. Mitrinović of Belgrade University, as well as Professor B. Crstici, formerly of Timis¸oara Technical University. However, there were included mainly estimates and inequalities, which are indeed very useful, but many important relations (e.g. congruences) were left out, giving a panoramic view of many other parts of Number Theory. This volume aims also to complement these issues, and also to bring to the attention of the readers (specialists or not) the hidden beauty of many theories outside a given field of interest. This book focuses too, as the former volume, on some important arithmetic functions of Number Theory and Discrete mathematics, such as Euler’s totient ϕ(n) and its many generalizations; the sum of divisors function σ (n) with the many old and new issues on Perfect numbers; the Möbius function, along with its generalizations and extensions, in connection with many applications; the arithmetic functions related to the divisors, consecutive divisors, or the digits of a number. The last chapter shows perhaps most strikingly the cross-fertilization of Number theory with Combinatorics, Numerical mathematics, or Probability theory. The style of presentation of the material differs from that of our former volume, since we have opted here for a more flexible, conversational, survey-type method. Each chapter is concluded with a detailed and up-to-date list of References, while at the end of the book one can find an extensive Subject index.

7

PREFACE

We have used a wealth of literature, consisting of books, monographs, journals, separates, reviews from Mathematical Reviews and from Zentralblatt für Mathematik, etc. This volume was not possible to elaborate without the kind support of many people. The author is indebted to scientists all over the world, for providing him along the years reprints of their papers, books, letters, or personal communications. Special thanks are due to Professors A. Adelberg, G. Andrews, T. Agoh, R. Askey, H. Alzer, J.-P. Allouche, K. Atanassov, E. Bach, A. Blass, W. Borho, P. B. Borwein, D. W. Boyd, D. Berend, R. G. Buschman, A. Balog, A. Baker, B. C. Berndt, R. de la Bretèche, B. C. Carlson, C. Cooper, G. L. Cohen, M. Deaconescu, R. Dussaud, M. Drmota, J. Désarménien, K. Dilcher, P. Erdös, P. D. T. A. Elliott, M. Eie, S. Finch, K. Ford, J. B. Friedlander, J. Fehér, A. A. Gioia, A. Grytczuk, K. Györy, J. Galambos, J. M. DeKoninck, P. J. Grabner, H. W. Gould, E.-U. Gekeler, P. Hagis, Jr., D. R. Heath-Brown, H. Harborth, P. Haukkanen, A. Hildebrand, A. Hoit, F. T. Howard, L. Habsieger, J. J. Holt, A. Ivić, H. Iwata, K.-H. Indlekofer, F. Halter-Koch, H.-J. Kanold, M. Kishore, I. Kátai, P. A. Kemp, E. Krätzel, T. Kim, G. O. H. Katona, P. Leroux, A. Laforgia, A. T. Lundell, F. Luca, D. H. Lehmer, A. Makowski, M. R. Murthy, V. K. Murthy, P. Moree, H. Maier, E. Manstaviˇcius, N. S. Mendelsohn, J.-L. ˇ Porubský, L. Nicolas, E. Neuman, W. G. Novak, H. Niederhausen, C. Pomerance, S. Panaitopol, J. E. Peˇcarić, Zs. Páles, A. Peretti, H. J. J. te Riele, B. Rizzi, D. Redmond, N. Robbins, P. Ribenboim, I. Z. Ruzsa, H. N. Shapiro, M. V. Subbarao, A. Sárközy, ˇ at, J. O. Shallit, K. B. Stolarsky, A. Schinzel, R. Sivaramakrishnan, J. Surányi, T. Sal´ B. E. Sagan, I. Sh. Slavutskii, F. Schipp, V. E. S. Szabó, L. Tóth, G. Tenenbaum, R. F. Tichy, J. M. Thuswaldner, Gh. Toader, R. Tijdeman, N. M. Temme, H. Tsumura, R. Wiegandt, S. S. Wagstaff, Jr., Ch. Wall, B. Wegner, M. Wójtowicz. The author wishes to express his gratitude also to a number of organizations whom he received advice and support in the preparation of this material. These are the Mathematics Department of the Babes¸-Bolyai University, the Alfred Rényi Institute of Mathematics (Budapest), the Domus Hungarica Foundation of Hungary, and the Sapientia Foundation of Cluj, Romania. The gratefulness of the author is addressed to the staff of Kluwer Academic Publishers, especially to Mr. Marlies Vlot, Ms. Lynn Brandon and Ms. Liesbeth Mol for their support while typesetting the manuscript. The camera-ready manuscript for the present book was prepared by Mrs. Georgeta Bonda (Cluj) to whom the author expresses his gratitude. The author

8

Basic Symbols f (x) = O(g(x)) or f (x) g(x)

For a range of x-values, there is a constant A such that the inequality | f (x)| ≤ Ag(x) holds over the range

f (x) g(x)

g(x) f (x) (or g(x) = O( f (x)))

f (x) = o(g(x))

f (x) ∼ g(x)

f (x) = 0 (g(x) = 0 for x large). x→∞ g(x) The same meaning is used when x → ∞ is replaced by x → α for any fixed α lim

f (x) = 1 (g(x) = 0 for x large). x→∞ g(x) The same meaning when x → ∞ is replaced with x → α lim

f (x) g(x)

There are c1 , c2 such that c1 g(x) ≤ f (x) ≤ c2 g(x) for sufficiently large x (g(x) > 0)

f (x) = (g(x))

f (x) = O(g(x)) does not hold

9

Basic Notations ϕ(n) Jk (n) Sk (n) C(n, r ) ϕ(x, n) ϕ ∗ (n), ϕ∞ (n), ϕe (n) σ (n) d(n) ω(n), (n) σk (n) σ ∗ (n), σ ∗∗ (n), σ∞ (n), σe (n), σ # (n) ψ(n) P(n) λ(n) s(n) = σ (n) − n, s ∗ (n) = σ ∗ (n) − n µ(n) µ∗ (n), µ∗∗ (n), µ(e) (n) µk (n) µ A (n) ϕ(G) µG (n), µ(G)

Euler’s totient function Jordan’s totient Schemmel’s totient Ramanujan’s sum Legendre totient unitary, infinitary, exponential totient sum of divisors function number of divisors function number of distinct, resp. total number, of prime factors of n sum of kth powers of divisors of n unitary, bi-unitary, infinitary, exponential, nonunitary sum of divisors functions Dedekind’s arithmetical function greatest prime factor of n Liouville’s function; or Carmichael’s function sum of aliquot, resp. unitary aliquot, divisors of n Möbius function unitary, bi-unitary, exponential Möbius functions Möbius function of order k Narkiewicz Möbius function Euler’s totient of a group G Möbius function of an arithmetical semigroup G, resp. of a group G

10

BASIC NOTATIONS

µ(x, y), µ)k(P), µ M (t) µ K (a) T ∗ (n), T ∗∗ (n), Te (n)

n (x) Vϕ (n) E(n) ζ (s) =

∞

n −s (Re s > 1)

Möbius functions of posets, resp. of a trace monoid M Möbius function of an algebraic number field unitary, bi-unitary, exponential analogs of the product of divisors of n cyclotomic polynomial valence function of ϕ (i.e. number of solutions of ϕ(x) = n) Euler minimum function; or Erdös’ function Riemann’s zeta function

n=1

S(n) H (n) h(n) (n) ω(v) ρ(v) H1 (n), H1 (n) H2 (n) T (n) n

F(n) = 22 + 1 t (n) sq (n), s(n) tq,m , tn a(n) = (−1)e(n) (−1)z(n) N (xn ) D N (xn ), D d(A) EX, VX

Smarandache function; or Schinzel-Szekeres function maximum exponent of n, or harmonic numbers minimum exponent of n Hooley’s function Buchstab function Dickman function DeKoninck-Ivić function Tenenbaum’s function product of divisors of n; or sum of iterated totients; or tangent numbers Fermat numbers set of totatives of n sum of digits of n in base q, resp. base 10 Thue-Morse sequences Rudin-Shapiro sequence Zeckendorf sequence discrepancy, resp. uniform discrepancy of the sequence (xn ) (asymptotic) density of A expactation, resp. variance of the random variable X

11

BASIC NOTATIONS

dim X dim f X φ(u) Bn , Bn , Bn∗ B(n) S(n, k), s(n, k) s ∗ (n, k) Sr (n, k) St (n, k), st (n, k), ST (n, k), sT (n, k) S(n, k, λ|θ ) S(n, k|θ ), s(n, k|θ ) S(n, k, α), S(n, k; α, β, γ ) d(n, k), b(n, k) S[n, k], s[n, k] s ∗ [n, k] S p,q [n, k], s p,q [n, k] [n] = [n]q , [n] p,q xa,b (n) P(n, k) = k!S(n, k) S(x, y), s(x, y) Bn, Bn Bn (z) Bχn E n , E n , E n∗ , E n E n (q), E n|k (q), Hk (u, q) Gn βk (q), βk,χ (q) Hk,χ (u, q)

Hausdorff dimension fractal dimension normal distribution function Bernoulli numbers Bell numbers Stirling numbers unsigned Stirling numbers of the first kind r -Stirling numbers Stirling numbers associated to the sequence t, resp. matrix T Howard’s degenerate weighted Stirling numbers Carlitz’ degenerate Stirling numbers Dickson-Stirling numbers; resp. Hsu-Shiue-Stirling numbers associated Stirling numbers q-Stirling numbers signless q-Stirling numbers of the first kind p, q-Stirling numbers q-analogue, resp. p, q-analogue of the integer n general factorial numbers number of preferential arrangements Stirling numbers of the real numbers x, y conjugate, resp. universal-Bernoulli numbers Bernoulli numbers of higher order generalized Bernoulli numbers (χ a character) Euler numbers q-Euler numbers Genocchi numbers q-Bernoulli, resp. generalized q-Bernoulli-numbers generalized q-Euler numbers

12

BASIC NOTATIONS

q(a, p), q(a, m) wp n (q) β Bn∗ (q) ζq (s), ζq (s, x) L q (s, χ) G(x, q) A(n, k), a(n, k) Bn,k (q), Am,n (q) A(n, k, α) A− (n, k) m ak,n m E(m, k) = k a|b, a b a ≡ b (mod n) c a ≡ (mod n) b d n! = 1 · 2 . . . n !n = 0! + 1! + · · · + (n − 1)! (a, b) [a, b] (x) exp(z) [x] or [x]∗ {x} = x − [x] p q n nk n = k q k Fn , L n ν p (n) [ai, j ]m×n f ∗g f g, f g

Fermat and Euler quotients Wilson quotient modified q-Bernoulli numbers p-adic q-Bernoulli numbers q-Riemann ζ -function, resp, q-Hurwitz ζ -function q − L-series q − log −-function Eulerian numbers q-Eulerian numbers Dickson-Eulerian numbers signed Eulerian numbers generalized Eulerian numbers second order Eulerian numbers a divides b, a does not divide b n divides (a − b) for integers a, b n|(ad − bc) for (b, n) = (d, n) = 1 factorial of n left-factorial of n g.c.d. of a and b, or an ordered pair l.c.m. of a and b Euler’s gamma function ez integer part of x fractional part of x Legendre (or Jacobi) symbol binomial coefficient q-binomial coefficient Fibonacci, resp. Lucas - numbers p-adic order of n m × n matrix of components ai j Dirichlet convolution unitary, resp. bi-unitary convolution

13

BASIC NOTATIONS

f ∗ A g, f ◦ g f ∗ex g, f ∇g, ( f ∗ g)∞ f ♦g, f #g f ∗l−c g f ∗G g

regular (Narkiewicz) resp. K (Davison) - convolution (or composition of functions) exponential, Golomb resp. infinitary-convolution max-product, resp. Cauchy product Lucas-Carlitz product matrix-generated convolution

14

Chapter 1

PERFECT NUMBERS: OLD AND NEW ISSUES; PERSPECTIVES

1.1

Introduction

The aim of this chapter is to survey the most important and interesting notions, results, extensions, generalizations related to perfect numbers. Many old, as well as new open problems will be stated, which will motivate - we do hope - many further research. This is one of the oldest subjects of Mathematics, with a considerable history. Some basic historical facts will be presented, as this will underline too our strong opinion on the role of perfect numbers in the development of Mathematics. It is sufficient to only mention here Fermat’s ”little theorem” of considerable importance in Number theory, Algebra, and more recently in Criptography. This theorem states that for all primes p and all positive integers a, p divides a p − a. Fermat discovered this result by studying perfect numbers, and trying to elaborate a theory of these numbers. One more example is the theory of primes in special sequences, and generally the classical theory of primes. Even perfect numbers involve the so called ”Mersenne primes”, of great importance in many parts of Number theory. Currently, about 39 such primes are known (39 as of 14-XI-2001, see e.g. http://www.stormloader.com/ajy/perfect/html), giving 39 known perfect numbers, all even. Recently (at the end of 2003) the 40th perfect number has been discovered. No odd perfect numbers are known, but we shall see on the part containing this theme, the most important and up-to-date results obtained along the centuries. An extension 15

CHAPTER 1

of perfect numbers are the ”amicable numbers” having a same old history, with considerable interest for many mathematicians. Many results, more generalizations, connections, analogies will be pointed out. Here the theory is filled again by a lot of unsolved problems. Along with the extensions of the notion of divisibility, there appeared many new notions of perfect numbers. These are e.g. the unitary perfect-, nonunitary perfect, biunitary perfect-, exponential perfect-, infinitary perfect-, hyperperfect-, integer perfect-, etc., numbers. On the other hand, there appeared also the necessity of studying, by analogy with the classical case, such notions as: superperfect-, almost perfect-, quasiperfect-, pseudoperfect (or semi-perfect), multiplicatively perfect, etc., numbers. Some authors use different terminologies, so one aim is also to fix in the literature the exact terminologies and notations. Our aim is also to include results and references from papers published in certain little known journals (or unpublished results, obtained by personal communication to the authors).

1.2

Some historical facts

It is not exactly known when perfect numbers were first introduced, but it is quite possible that the Egypteans would have come across such numbers, given the way their methods of calculation worked (”unit fractions”, ”Egyptean fractions”). These numbers were studied by their mystical properties by Pythagoras, and his followers. For the Pythagorean school the ”parts” of a number are their divisors. A number which can be built up from their parts (i.e. summing their divisors) should be indeed wonderful, perfectly made by the God. God created the world in six days, and the number of days it takes the Moon to travel round the Earth is nothing else than 28. (For the number mysticism by Pythagoras’ school see U. Dudley [85]). These are the first two perfect numbers. The four perfect numbers 6, 28, 496 and 8128 seem to have been known from ancient times, and there is no record of these discoveries. The first recorded result concerning perfect numbers which is known occurs in Euclid’s ”Elements” (written around 300BC), namely in Proposition 36 of Book IX: ”If as many numbers as we please beginning from a unit be set out continuously in double proportion, until the sum of all becomes a prime, and if the sum multiplied into the last make some number, the product will be perfect.” Here ”double proportion” means that each number of the sequence is twice the preceding number. Since 1 + 2 + 4 + · · · + 2k−1 = 2k − 1, the proposition states that: If, for some k > 1, 2k − 1 is prime, then 2k−1 (2k − 1) is perfect. 16

(1)

PERFECT NUMBERS

Here we wish to mention another source for perfect numbers (usually overlooked by the Historians of mathematics) in ancient times, namely Plato’s Republic, where the so-called periodic perfect numbers were introduced. It is remarkable that 2000 years later when Euler proves the converse of (1) (published posthumously, see [97]) he makes no references to Euclid. However, Euler makes reference to Plato’s periodic perfect numbers. M. A. Popov [243] says that Euler’s proof was probably inspired by Plato. Another early reference seems to be at Euphorion (see J. L. Lightfoot [191]) a poet of the third century, B.C. The following significant study of perfect numbers was made by Nichomachus of Gerasa. Around 100 AD he wrote his famous ”Introductio Arithmetica” [227], which gives a classification of numbers into three classes: abundant numbers which have the property that the sum of their aliquot parts is greater than the number, deficient numbers which have the property that the sum of their aliquot parts is less than the number, and perfect numbers. Nicomachus used this classification also in moral terms, or biological analogies: ”... in the case of too much, is produced excess, superfluity, exaggerations and abuse; in the case of too little, is produced wanting, defaults, privations and insufficiencies...” ”... abundant numbers are like an animal with ten mouths, or nine lips, and provided with three lines of teeth; or with a hundred arms...” ”... deficient numbers are like animals with a single eye,... one armed or one of his hands, less than five fingers, or if he does not have a tongue.” In the book by Nicomachus there appear five unproved results concerning perfect numbers: (a) the n-th perfect number has n digits; (b) all perfect numbers are even; (c) all perfect numbers end in 6 and 8 alternately; (d) every perfect number is of the form 2k−1 (2k − 1), for some k > 1, with 2k − 1 = prime; (e) there are infinitely many perfect numbers. Despite the fact that Nicomachus offered no justification of his assertions, they were taken as fact for many years. The discovery of other perfect numbers disproved immediately assertions (a) and (c). On the other hand, assertions (b), (d), (e) remain unproved practically even in our days. The Arab mathematicians were also fascinated by perfect numbers and Thabit ibn Quarra wrote ”Treatise on amicable numbers” in which he examined when numbers of the form 2n p ( p prime) can be perfect. He proved also ”Thabit’s rule” (see the section with amicable numbers). Ibn al-Haytham proved a partial converse to Euclid’s proposition (1), in the unpublished work ”Treatise on analysis and synthesis” (see [247]).

17

CHAPTER 1

Among the Arab mathematicians who take up the Greek investigation of perfect numbers with great enthusiasm was Ismail ibn Ibrahim ibn Fallus (1194-1239) who wrote a treatise based on Nicomachus’ above mentioned text. He gave also a table of ten numbers claiming to be perfect. The first seven are correct, and in fact these are indeed the first seven perfect numbers. For details of this work see the papers by S. Brentjes [36], [37]. The fifth perfect number was rediscovered by Regiomontanus during his stay at the University of Vienna, which he left in 1461 (see [235]). It has also been found in a manuscript written by an anonymous author around 1458, while the fifth and sixth perfect numbers have been found in another manuscript by the some author, shortly after 1460. The fifth perfect number is 33550336, and the sixth is 8589869056. These show that Nicomachus’ first claims (a) and (c) are false, since the fifth perfect number has 8 digits, and the fifth and sixth perfect numbers both ended in 6. In 1536 Hudalrichus Regius published ”Utriusque Arithmetices” in which he found the first prime p ( p = 11) such that 2 p−1 (2 p − 1) = 2047 = 23 · 89 is not perfect. In 1603 Cataldi found the factors of all numbers up to 800 and also a table of all primes up to 750. He used his list of primes to check that 219 − 1 = 524287 was prime, so he had found the seventh perfect number 137438691328. Among the many mathematicians interested in perfect numbers one should mention Descartes, who in 1638 in a letter to Mersenne wrote ([72]): ”... Perfect numbers are very few... as few are the perfect men...” In this sense see also a Persian manuscript [331]. ”I think I am able to prove there are no even numbers which are perfect apart from those of Euclid; and that there are no odd perfect numbers, unless they are composed of a single prime number, multiplied by a square whose root is composed of several other prime number. But I can see nothing which would prevent one from finding numbers of this sort... But, whatever method one might use, it would require a great deal of time to look for these numbers...” The next major contribution was made by Fermat [225], [313]. He told Roberval in 1636 that he was working on the topic and, although the problems were very difficult, he intended to publish a treatise on the topic. The treatise would never been written, perhaps because Fermat didn’t achieve the substantial results he had hoped. In June 1640 Fermat wrote a letter to Mersenne telling him about his discoveries on perfect numbers. Shortly after writing to Mersenne, Fermat wrote to Frenicle de Bessy, by generalizing the results in the earlier letter. In his investigations Fermat used three theorems: (a) if n is composite, then 2n − 1 is composite; (b) if n is prime, a n − a is multiple of n; (c) if n is prime, p is a divisor of 2n − 1, then p − 1 is a multiple of n.

18

PERFECT NUMBERS

Using his ”Little theorem”, Fermat showed that 223 − 1 was composite and also 237 − 1 is composite, too. Mersenne was very interested in the results that Fermat sent him on perfect numbers. In 1644 he published ”Cogitata physica mathematica”, in which he claimed that 2 p−1 (2 p − 1) is perfect for p = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127, 257 and for no other value of p up to 257. It is remarkable that among the 47 primes p between 19 and 258 for which 2 p − 1 is prime, for 42 cases Mersenne was right. Primes of the form 2 p − 1 are called Mersenne primes. (For a recent table of known Mersenne primes, see the site http://www.utm.edu/research/primes/mersenne/index.html). The next mathematician who made important contributions was Euler. In 1732 he proved that the eighth perfect number was 230 (231 − 1). It was the first seen perfect number discovered for 125 years. But the major contributions by Euler were obtained in two unpublished manuscripts during his life. In one of them he proved the converse of Euclid’s statement: All even perfect number are of the form 2 p−1 (2 p − 1).

(2)

By quoting R. C. Vaughan [314]: ”we have an example of a theorem that took 2000 years to prove... But pure mathematicians are used to working on a vast time scale...” Euler’s results on odd perfect numbers and amicable numbers will be considered later. After Euler’s discovery of primality of 231 − 1, the search for perfect numbers had now become an attempt to check whether Mersenne was right with his claims. The first error in Mersenne’s list was discovered in 1876 by Lucas, who showed that 267 − 1 is composite. But 2127 − 1 is a Mersenne prime, so he obtained a new perfect number (but not the nineth, but as later will be obvious the twelfth). Lucas made also a theoretical discovery too, which later modifed by Lehmer will be the basis of a computer search for Mersenne primes. In 1883 Pervusin showed that 261 − 1 is prime, thus giving the nineth perfect number. In 1911, resp. 1914 Powers proved that 289 − 1 resp. 2101 − 1 are primes. 288 (289 − 1) was in fact the last perfect number discovered by hand calculations, all others being found using theoretical elements or a computer. In fact computers have led to a revival of interest in the discovery of Mersenne primes, and therefore of perfect numbers. The first significant results on odd perfect numbers were obtained by Sylvester. In his opinion (see e.g. [317]): ”... the existence of an odd perfect number its escape, so to say, from the complex web of conditions which hem it in on all sides - would be little short of a miracle...” 19

CHAPTER 1

In 1888 he proved that any odd perfect number must have at least 4 distinct prime factors. Later, in the same year he improved his result for five factors. The developments, as well as recent results will be studied separately. Finally, we shall include here for the sake of completeness all known perfect numbers along with the year of discovery and the discoverer (s). Let Pk be the kth perfect number. Then Pk = 2 p−1 (2 p − 1) = A p , where 2 p − 1 is a Mersenne prime. P1 = A2 = 6, P2 = A3 = 28, P3 = A5 = 496, P4 = A7 = 8128, P5 = A13 (1456, anonymous), P6 = A17 (1588 Cataldi), P7 = A19 (1588, Cataldi), P8 = A31 (1772, Euler), P9 = A61 (1883, Pervushin), P10 = A89 (1911, Powers), P11 = A107 (1914, Powers), P12 = A127 (1876, Lucas), P13 = A521 (1952, Robinson), P14 = A607 (1952, Robinson), P15 = A1279 (1952, Robinson), P16 = A2203 (1952, Robinson), P17 = A2281 (1952, Robinson), P18 = A3217 (1957, Riesel), P19 = A4253 (1961, Hurwitz), P20 = A4423 (1961, Hurwitz), P21 = A9689 (1963, Gillies), P22 = A9941 (1963, Gillies), P23 = A11213 (1963, Gillies), P24 = A19937 (1971, Tuckerman), P25 = A21701 (1978, Noll and Nickel), P26 = A23209 (1979, Noll), P27 = A44497 (1979, Nelson and Slowinski), P28 = A86243 (1982, Slowinski), P29 = A110503 (1988, Colquitt and Welsh), P30 = A132049 (1983, Slowinski), P31 = A216091 (1985, Slowinski), P32 = A756839 (1992, Slowinski and Gage), P33 = A859433 (1994, Slowinski and Gage), P34 = A1257787 (1996, Slowinski and Gage), P35 = A1398269 (1996, Armengaud, Woltman, et al. (GIMPS)), P36 = A2976221 (1997, Spence, Woltman, et al. (GIMPS)), P37 = A3021377 (1998, Clarkson, Woltman, Kurowski et al. (GIMPS, Primenet)), P38 = A6972593 (1999, Hajratwala, Woltman, Kurowki et al. (GIMPS, Primenet)), P?? = A13466917 (2001, Cameron, Woltman, Kurowski, et al.). Recently, M. Shafer (see http://mathworld.wolfram.com) has announced the discovery of the 40th Mersenne prime, giving A20996011 . The full values of the first seventeen perfect numbers are written also in the note by H. S. Uhler [312] from 1954. For a quick perfect number analyzer by Brendan McCarthy see the applet at http://ccirs.camosun.bc.ca/∼jbritton/jbperfect/htm. The 39th Mersenne prime is of course, a very large prime, having a number of 4053946 digits (it seems that it is the largest known prime). There have been discovered also very large primes of other forms. For example, in 2002, Muischnek and Gallot discovered the prime number 105747665536 + 1. For the largest known primes of various forms see the site: http://www.utm.edu/research/primes/largest.html.

1.3

Even perfect numbers

Let σ (n) denote the sum of all positive divisors of n. Then n is perfect if σ (n) = 2n 20

(1)

PERFECT NUMBERS

As we have seen in the Introduction, all known perfect numbers are even, and by the Euclid-Euler theorem n can be written as n = 2k−1 (2k − 1),

(2)

where 2k − 1 is a prime (called also as ”Mersenne prime”). Actually k must be prime. The first two perfect numbers, namely 6 and 28 are perhaps the most ”human” since are closely related to our life (number of days of a week, of a month, of a woman cycle, etc.). The famous mathematician and computer scientist D. Knuth in his interesting homepage (http://www-csfaculty.stanford.edu/∼knuth/retd.htm) on the occasion of his retirement says: ”... I’m proud of the 28 students for whom I was a dissertation advisor (see vita); and I know that 28 is a perfect number...” 28 is in fact the single even perfect number of the form x3 + 1

(3)

(x positive integer), proved by A. Makowski [205]. As corollaries of this fact Makowski deduces that the single even perfect number (4) of the form n n + 1 is 28; and that there is no even perfect number of the form nn

...n

+ 1,

(5)

where the number of n’s is ≥ 3. By generalization, A. Rotkiewicz [263] proves that 28 is the single even perfect number of the form a n + bn , where (a, b) = 1 and n > 1.

(6)

If n > 2 and (a, b) = 1, he proves also that there is no even perfect number of the form a n − bn . (7) Not being aware of Rotkiewicz’s result (6), T. N. Sinha [288] has rediscovered it in 1974. The numbers 6 and 28 are the only couple of perfect numbers of the form n − 1 n(n + 1) , where n > 1; and this is obtained for n = 7. This is a result of L. and 2 Jones [157]. (8) We note that this result applies the Euclid-Euler theorem (representation of even perfect numbers), as well as a theorem by Euler on the form of odd perfect numbers (see the next section). 21

CHAPTER 1

As for the digits of even perfect numbers, as already Nicomachus (see section 2) remarked, the last digits are always 6 or 8 (but not in alternate order, as he thought), proved rigorously by E. Lucas in 1891 (see [84], p. 27, and also [138]). (9) Let us now sum the digits of any even perfect number (except 6), then sum the digits of the resulting number,..., etc., repeating this process until we get a single digit. Then this single digit will be one. (10) See [332] for this result, with a proof. Let A(n) be the set of prime divisors of n > 1. If n is an even perfect number, then it is immediate that A(n) = A(σ (n)). (11) Now, an interesting fact, due to C. Pomerance [240] states that, reciprocally, if (11) holds true for a number n, then n must be even perfect. For the additive representation of even perfect numbers, by an interesting result by R. L. Francis [103] any even perfect number > 28 can be represented as the sum of at least two perfect numbers. (12) For the values of other arithmetic functions at even perfect numbers we quote the following result of S. M. Ruiz [264]: Let S(n) be the Smarandache function, defined by S(n) = min{k ∈ N : n|k!}.

(13)

Then if n is even perfect, then one has S(n) = M p

(14)

where M p = 2 p − 1 is the Mersenne prime in the known form of n. For a simple proof, see J. Sándor [272]. In [272] there is proved also that S(M p ) ≡ 1 (mod p), and that if 22 p + 1 is prime too, then S(24 p − 1) = 22 p + 1 ≡ 1 (mod 4 p). For the values of Euler’s function on even perfect numbers, see S. Asadulla [8]. For perfect numbers concerning a Fibonacci sequence, see [234]. F. Luca [197] proved also that there are no perfect Fibonacci or Lucas numbers. In [198] he proved that there are only finitely many multiply perfect numbers in these sequences. K. Ford [102] considered numbers n such that d(n) and σ (n) are both perfect numbers (called ”sublime numbers”). There are only two known such numbers, namely n = 12 and n = 2126 (261 − 1)(231 − 1)(219 − 1)(27 − 1)(25 − 1)(23 − 1). It is not known if any odd sublime number exists. D. Iannucci (see his electronic paper ”The Kaprekar numbers”, J. Integer Sequences, 3(2000), article 00.1.2) proved that every even perfect number is a Kaprekar number in the binary base, e.g. (28)2 = 11100 and 11002 = 1100010000 with 100 + 010000 = 11100 (703 in base 10 is Kaprekar means that 7032 = 494209 where 494 + 209 = 703). 22

PERFECT NUMBERS

We wish to mention also some new proofs of the Euler theorem on the form of an even perfect number. In standard textbooks, usually it is given Euler’s proof, in a slightly simplified form given by L. E. Dickson in 1913 ([82], [80]). An earlier proof was given by R. D. Carmichael [43]. A new proof has been published by Gy. Kisgergely [174] in a paper written in Hungarian. Another proof, due to J. Sándor ([271], [273]) is based on the simple inequality σ (ab) ≥ aσ (b)

(15)

with equality only for a = 1. This method enabled him also to obtain a new proof on the form of even superperfect numbers (see later). For even perfect numbers see a paper by S. J. Bezuska and M. J. Kenney [24] (where 36 perfect numbers are mentioned (up to 1997!)). See also G. L. Cohen [56].

1.4

Odd perfect numbers

There is a good account of results until 1957 in the paper by P. J. McCarthy [46]. The first important result on odd perfect numbers was obtained by Euler [98] when he proved that such a number n should have the representation n = p α q1 1 . . . qr2βr 2β

(1)

where p, qi (i = 1, r ) are distinct odd primes and p ≡ 1 (mod 4), α ≡ 1 (mod 4). Here p α is called the Euler factor of n. Another noteworthy result, mentioned also in the Introduction is due to J. J. Sylvester [310] who proved that we must have r ≥ 4 and that r ≥ 5 if n ≡ 0 (mod 3). (2) The modern revival of interest in the problem of odd perfect numbers seems to have been begun by R. Steurwald [296] who proved that n cannot be perfect if β1 = · · · = βr = 1.

(3)

A. Brauer [33] and H.-J. Kanold [159] proved the same if β1 = 2 and β2 = · · · = βr = 1

(4)

In [158] Kanold proved that n is not perfect if β1 = · · · = βr = 2

(5)

2βi + 1 (i = 1, r ) have as a common factor 9, 15, 21, or 33.

(6)

and also if the

23

CHAPTER 1

Similarly, he proved [165] that n cannot be perfect if β1 = β2 = 2, β3 = · · · = βr = 1; and if α = 5 and βi = 1 or 2 (i = 1, r ). (7) He obtained similar results in [161]. P. J. McCarthy [47] proved that if n is perfect and prime to 3, and β2 = · · · = βr = 1, then q1 ≡ 1

(mod 3)

(8)

In 1971 W. L. McDaniel [76] improved result (6) by proving that 3 cannot be a common divisor of 2βi + 1 (i = 1, r ). (9) A year later, P. Hagis, Jr. and W. L. McDaniel [133] showed that n cannot be perfect if β1 = · · · = βr = 3. (10) We note here that in the above papers the theory of cyclotomic polynomials, as well as diophantine equations are widely used. Some computations use modern computers, too. It is of interest to note that in the proof of (10) the following results due to U. Kühnel [184], resp. H.-J. Kanold [158] are used: If n is odd perfect, then 105 n; (11) If n is odd perfect, and if in (1) s is a common factor of 2βi + 1 (i = 1, r ), then (12) s 4 |n. Another refinement of Euler’s theorem is due to J. A. Ewell [99]. If the prime q1 , . . . , qr (together with their corresponding exponents) are relabeled as p1 , p2 , . . . , pk , h 1 , h 2 , . . . , h t so that pi (i = 1, k) are of the form ≡ 1 (mod 4) and each h j ( j = 1, t) are of the form ≡ −1 (mod 4), say n = pα

k

pi2αi

i=1

t

2β j

hj

(13)

j=1

then: (i) the ordered set A(k) = {α1 , . . . , αk } contains an even number of odd numbers, provided α and p belong to the same residue class (mod 8); (ii) A(k) contains an odd number of odd numbers, provided that α and p belong to different classes (mod 8). (14) Of a similar nature are also the following theorems due to G. L. Cohen and R. J. Williams [67]: If n is an odd perfect number, then in (1) if we assume that β1 = · · · = βr = β, then we must have β ∈ {6, 8, 11, 14, 18}; (15) If n is as above and β1 = · · · = βr = 1, then β1 ∈ {5, 6}; 24

(16)

PERFECT NUMBERS

They obtain also (independently) a simpler proof of result (14). The theorem of Sylvester on the lower bounds for r in (1) has been improved by several authors. I. S. Gradstein [110], U. Kühnel [184] and G. C. Webber [324] proved that in (2) r ≥ 5 holds without any condition. (17) Recall, that r = ω(n) − 1. The result r ≥6 (18) has been discovered by N. Robbins [259] and C. Pomerance [237]; while the strongest result known today, namely r ≥7 (19) is due to P. Hagis, Jr. [120] and J. E. Z. Chein [51]. For a new, algorithmic approach, see G. L. Cohen and R. M. Sorli [On the number of distinct prime factors of an odd perfect number, J. Discr. Algorithms 1(2003), 2135]. Result (2) of Sylvester has been sharpened to r ≥ 8 if n ≡ 0

(mod 3)

(20)

r ≥ 10 if n ≡ 0

(mod 3)

(21)

by H.-J. Kanold [160] and to

by M. Kishore [179]. P. Hagis, Jr. [123] proved the same for (n, 3) = 1. For a survey of earlier results, see D. S. Mitrinović - J. Sándor [218] (see p. 100-102). E. Catalan proved in 1888 (see [84]) that if an odd perfect number is not divisible by 3, 5 or 7, it has at least 26 distinct prime factors, and thus has at least 45 digits. T. Pepin showed in 1897 (see [84]) that an odd perfect number relatively prime to 3 · 7, 3 · 5 or 3 · 5 · 7 contains at least 11, 14, or 19 distinct prime factors, respectively; and cannot have the form 5(mod6). In the above mentioned paper [160] Kanold proved also that an odd perfect number must have at least a prime divisor greater than or equal to 61. (22) J. B. Muskat [223] in 1966 proved that an odd perfect number n is divisible by a prime power > 1012 . (23) C. Pomerance [238] proved that the second largest prime divisor of n must be at least 139. (24) and in 1980 P. Hagis, Jr. [121], improved this to 1000. (25) Related to the largest prime factor of an odd perfect number n, this is greater than 100129 25

(26)

CHAPTER 1

as shown by P. Hagis, Jr. and W. J. Daniel [134]; and improved to 300000

(27)

by J. T. Condict [68]. Result (25) on the second largest prime factor has been recently improved to 10000

(28)

by D. E. Iannucci [150]. Ianucci further [151] obtained for the third largest prime factor the lower bound 100 (29) Iannucci and Sorli [153] proved that if n is odd perfect, then (n) ≥ 37, (n) being the total number of prime factors of n. Kanold’s result (22) was subsequently improved. As a corollary of a general result (which we shall state later) N. Robbins [260] proved that if an odd perfect number n is divisible by 17, then n must have a prime factor not smaller than 577. (30) The strongest result was due to P. Hagis, Jr. and G. L. Cohen [132] who obtained, without any condition the lower bound 106

(31)

Very recently, this has been improved to 107 by P. M. Jenkins [155]. See also A. Grytczuk and M. Wójtowicz [113] on the magnitude of perfect numbers. Related to the lower bounds of odd perfect numbers, a substantial result was obtained in 1973 by P. Hagis, Jr. [119], giving the lower bound 1050 . This was subsequently improved to 10160 by R. P. Brent and G. L. Cohen [34], to 10300 by Brent, Cohen and H. J. J. te Riele [35]. In a recent paper by S. Davis [79] a rationality condition for the existence of odd perfect numbers is used to derive an upper bound for the density of odd integers such that σ (n) could be equal to 2n, where n belongs to a fixed interval with a lower limit greater than 10300. Bounds of a general nature were first considered by Kanold. In [158] he proved that if n given by (1) is odd perfect, then the largest prime divisor of n is greater then 2 · max{α + 1, 2βi + 1 : i = 1, r }

(32)

In [160] he proved that if n is odd perfect and p is a Gaussian prime, then α < a(a − 1) ≤ r (r − 1)

(33)

where a is the number of qi such that qi ≡ 1 (mod p). In [165] a similar result runs as follows: 26

PERFECT NUMBERS

Suppose n is odd perfect and that ( p − 1, 2βi + 1) = 1, i = 1, r . Let a be as 3a(a − 1) 2β , when pa−1 σ (qi i ) above. Then 1 < a < r and α ≤ min a(a − 2), 4 (a − 1)(3a − 2) for any i = 1, r ; and α ≤ , otherwise. (34) 4 A complicated lower bound has been given by N. Robbins [260]. Suppose u is an odd prime. Let a1 (u) < a2 (u) < . . . be those primes p such that (i) p ≡ 2u 2k − 1 (mod 4u 2k ) for some integer k; (ii) 105 ( p + 1); (iii) 165 ( p + 1). Let V (u) be the set of all primes v such that v ≡ 1 (mod u). For each v ∈ V (u), let v = max{v ∗ : v ∗ ∈ V (u), v ∗ |φu (v)}, where φn (t) denotes the n-th cyclotomic polynomial evaluated at t. Let w(v) = max{v, v }. Let b1 (u) < b2 (u) < . . . be all the distinct w(v) such that v ∈ V (u). Finally, let X (u) be the set of all primes x such that (i) x ≡ 2u 2k−1 (mod 4u 2k−1 ) for some integer k; (ii) 105 (x 2u − 1)/(x − 1); (iii) 165 (x 2u − 1)/(x − 1). For each x ∈ X (u), let v = max{v ∗ : v ∗ ∈ V (u), v ∗ |φu (x)}, v = max{v ∗ : ∗ v ∈ V (u), v ∗ |φu (−x)}. Let y(x) = max{x, v, v }. Let c1 (u) < c2 (u) < . . . be all the distinct y(x) such that x ∈ X (u). Put L(u) = min{a1 (u), b1 (u), c1 (u)}.

(35)

Now, if n given by (1) is an odd perfect number and u is a Fermat prime such that u ||n, then m

M(n) ≥ L(u)

(36)

M(n) = max{ p, q1 , . . . , qr }

(37)

where

For an example, the values of an (3), an (5), an (17), bn (3), bn (5), bn (17), cn (3), cn (5), cn (17), consider the tables: n 1 2 3 4 5 6 an (3) 17 89 197 233 449 521 an (5) 149 349 449 1249 1549 1949 an (17) 577 1733 8669 14449 19073 22541 27

CHAPTER 1

n 1 2 3 4 5 6 bn (3) 19 61 67 79 97 127 bn (5) 1381 2221 3221 bn (17) < 1031

n 1 2 3 4 5 6 cn (3) 271 821 919 1021 1087 1093 cn (5) 400291 cn (17) < 1031 Various bounds for the prime factors of an odd perfect number have been deduced. Let p1 be the least prime factor of n given by (1). Then Cl. Servais [283] proved first that p1 ≤ r + 1 = ω(n) = A (38) where ω(n) = A denotes the number of distinct prime factors of n. For a recent extension of the Servais result see [23]. In 1952 O. Grün [112] improved this to 2 A+2 3

p1
1

(55)

Some words on the density of odd perfect numbers: In 1954 Kanold [166] proved that this density is 0. This follows also from a result by B. Volkmann [315]. Stronger results have been obtained in the following years by B. Hornfeck [146] who showed that for V (x) = car d{n ≤ x : n perfect} (56) one has V (x) < x 1/2

(57)

A year later [147] he showed that V (x) 1 lim sup √ ≤ √ x x→∞ 2 5 30

(58)

PERFECT NUMBERS

Kanold [169] improved these to V (x) < c

x 1/4 log x log log x

(59)

while Hornfeck and E. Wirsing [148], resp. Wirsing [328] proved that c log x log log log x V (x) < exp log log x and

c log x V (x) < exp log log x

(60)

(61)

It follows from this result that even if some odd perfect numbers do exist, at least they are less numerous than, for example, the primes. In particular, the sum of the reciprocals of the perfect numbers is a convergent series. Finally, we wish to point out some new issues on odd perfect number, along with some open problems. By writing n = p α M 2 , where p ≡ α ≡ 1 (mod 4), clearly if one has

σ (M 2 ) = p α ,

σ ( p α ) = 2M 2 ,

(62) (63)

then n is odd perfect. In 1977 D. Suryanarayana [309] raised the question, that should every odd perfect number (which necessarily has the form (62)) also necessarily satisfy the relations (63)? This was answered in the negative by G. G. Dandapat, J. L. Hunsucker and C. Pomerance [74], and also later by E. Z. Chen utilizing a deep result of Ljunggern. D. Suryanarayana [309] raised also the following problem. If n = p α M 2 is an odd perfect number so that p ≡ α ≡ 1 (mod 4) and ( p, M) = 1, does it necessarily follow that there exist a divisor d|M such that σ (d 2 ) = p α M 2 /d 2 and σ ( p α M 2 /d 2 ) = 2d 2 ?

(64)

This problem is still open. Another open problem by Suryanarayana is that: is it true that every odd perfect number is of the form mσ (m) for some odd integer m; if so, is (m, σ (m)) = 1 necessarily? (65)

31

CHAPTER 1

M. V. Subbarao [301] raises the problem: Does every odd perfect number n (if such exist) have the representation 1 n = mσ (m)? 2

(66)

Another question: whenever n given by (66) is perfect, does it follow that n is odd and (m, σ (m)) = 1? (67) C. W. Anderson (see [239]) has conjectured that the set of rational numbers that arise as σ (n)/n for some n, is a recursive set. (68)

1.5

Perfect, multiperfect and multiply perfect numbers

First we wish to mention that the notion of a perfect number has been extended to Gaussian integers (see R. Spira [292], W. L. McDaniel [77], M. Hausman [141], D. S. Mitrinović – J. Sándor [218]) to real quadratic fields (see E. Bedocchi [15]), or generally to unique factorization domains (see W. L. McDaniel [78]). A number n is called multiperfect, if there exist a positive integer k ≥ 1 such that σ (n) = kn (1) In this case n is called also as k-perfect number. The union of all k-perfect numbers when k ∈ N is the set of multiply perfect numbers. Thus n is called multiply perfect when n|σ (n) (2) In the sections with perfect numbers (when k = 2 in (1)) we sometimes mentioned that some results which were true for perfect numbers do hold also for multiperfect numbers. (For the history of multiply perfect and multiperfect numbers up to 1907, see Dickson [84].) For example, the famous Dickson theorem 4.(50) holds true also for k-perfect number, as proved by H.-J. Kanold [168]. A positive integer n is called primitive if cannot be written in the form m = st, where s is an even perfect number and (s, t) = 1. Kanold proved that for any k there are only a finitely many primitive k-perfect numbers with a fixed number of distinct prime factors. (3) C. Pomerance [239] proved that for every k ≥ 1 (even rational number) and every non-negative integer K , there is an effectively computable number N (k, K ) such that if ω(n) = K and n is primitive k-perfect, then n ≤ N (k, K ). 32

(4)

PERFECT NUMBERS

Here ω(n) denotes, as usual, the number of distinct prime divisors of n. Let A(n) be the set of all prime divisors of n. In 1998 W. Carlip, E. Jacobson and L. Somer [42] proved the following theorem: For fixed integers k and t, there exist at most finitely many squarefree integers n such that car d A(N ) ≤ t and n is k − perfect.

(5)

P. J. McCarthy [48] has shown that if n is k-perfect, then ω(n) ≥ k 2 − 1

(6)

For some improvements, see W. L. McDaniel [75]. McDaniel shows also that there exists no odd k-perfect numbers with k odd of the form m α , where m is an integer, and α + 1 is a prime, the square of a prime, or the cube of a prime. (7) It is not known if there exist odd k-perfect numbers, but actually up to recently (February 2002) we have a total of 5040 known k-perfect numbers. There are 39 2-perfect (i.e. classical perfect), 6 3-perfect, 36 4-perfect, 65 5-perfect, 245 6-perfect, 516 7-perfect, 1134 8-perfect, 923 10-perfect and 1 11-perfect numbers. For details regarding the discoverers see the site http://www.homes/unibielefeld.de/achim/mpn.html by A. Flammenkamp. P. Hagis Jr. and G. L. Cohen [130] have shown that the largest prime factor of a k-perfect number is at least 100129, (8) while the second largest prime factor is ≥ 1009.

(9)

Later, Hagis Jr. [125] proved that the third largest divisor is ≥ 101

(10)

The density of k-perfect numbers is 0, as first was shown by Kanold, but in 1957 Hornfeck and Wirsing proved that P(x) = o(x ε )

(11)

for any ε > 0, where P(x) denotes the number of k-perfect numbers not exceeding x. In fact in the book by Erdös and Graham [92] one can read that Wirsing can show that P(x) < cx c log log x log x/ log log x (12) with c, c > 0 constants. (Here k > 0 can be even rational number.) 1 in the case of an odd perfect number have been Various bounds for S = p p/n included in section 4 (see 4.44). G. L. Cohen [55] in 1980 proved the following: 33

CHAPTER 1

Let n be k-perfect. Then

 if k is odd  log k, log k log k <S< , if k is even  3 log 3/2 3 log 4/3

(13)

for n odd; and

1 log k/2 1 log 2k/3 + <S< + 2 3 log 3/2 2 3 log 4/3 log k , due to A. Krawczyk [183]. if n is even. These improve S > 2 M. Bencze [19] proved that

r ( r 3/2 − 1) < S < r (1 − r 6/k 2 ) for n even;

√ 3r r ( k 2 − 1) < S < r (1 − r 8/(kπ 2 )) for n odd

(14)

(15) (16)

where r = ω(n). A considerable interest has been devoted to triperfect numbers, i.e. to the case k = 3 in (1). R. Steuerwald [297] proved that if 6|n and n is triperfect, then the prime divisors 2 and 3 appear at the first power, the other prime divisor at a higher power. n G. L. Cohen [55] showed that if 2||n and n is triperfect, then is an odd perfect 2 number. If 2a ||n and 3|n, then a ≡ 3 (mod 4) (except if n = 120); if 2a ||n, then a ≡ 5 (mod 6) (except if n = 672). If 3b ||n, then b ≡ 3 (mod 4) and b ≡ 5 (mod 6). An odd triperfect number must be a square. In 1970 McDaniel [75], and independently Cohen [55] (but 10 years later) proved that for odd triperfect numbers n ω(n) ≥ 9

(17)

E. A. Bugulov [39] showed in fact ω(n) ≥ 11;

(18)

this has been rediscovered by M. Kishore [180]. In 1983 H. Reidling [248] showed ω(n) ≥ 12,

(19)

and this has been again rediscovered by Kishore [181]. In 1982 W. E. Beck and R. M. Najar [14] obtained for an odd triperfect number n the lower bound (20) n > 1050 34

PERFECT NUMBERS

This was improved to n > 1060

(21)

n > 1070

(22)

by L. B. Alexander [4], and to by Cohen and Hagis, Jr. [130]. As we mentioned, an odd triperfect number must be a square: D. Iannucci [152] proves that the square root of an odd triperfect number cannot be squarefree number. (23) The important theorem by Touchard (see 4.48) can be extended in some cases also to multiperfect numbers. J. A. Holdener [145] proves that if n is odd k-perfect, where k is not divisible by 3 or 4, then n≡1

(mod 12) or n ≡ 9 (mod 36).

(24)

Now certain facts on multiply perfect numbers. (Remark that many authors confuse the words ”multiperfect” and ”multiply perfect”. Clearly if n is k-perfect, then it is multiply perfect. But the converse is not true.) R. D. Carmichael [44] found all multiply perfect numbers less than 109 . These are: 1, 6, 28, 120, 496, 672, 8128, 30240, 32760, 523776, 2178540, 23569920, 33550336, 45532800, 142990848, 459818240 (this corrected list appears in [9]). (25) Since, as we mentioned before, there are more than 5040 multiperfect numbers, and these are also multiply perfect numbers, today (in the computer era) we know multiply perfect numbers having about 10000 digits. However, it is not known whether or not there are infinitely many such numbers. See also R. K. Guy [114]. The estimate 4.(60) for the number of perfect numbers ≤ x holds true essentially also for multiply perfect numbers, so for these numbers m(x) one has c log x log log x log x m(x) = O exp (26) log log x due to Hornfeck and Wirsing [148]. We now study some miscellaneous results related to multiply perfect numbers. H. Harboth [140] takes in place of σ (n) the value S(n) = the sum of all possible sums of distinct divisors of n (in fact one obtains S(n) = σ (n) · 2d(n)−1 , where d(n) is the number of divisors of n). She proves that n|S(n) for infinitely many n

(27)

thus the open question above is solved in the case considered here. In a difficult proposed problem, C. Pomerance [242] considers multiply perfect numbers of the form n!, and shows that this is possible only for n ∈ {1, 3, 5}. (28) 35

CHAPTER 1

L. Cheng [52] has proved that n = 23 · 3 · 5, 25 · 3 · 7 and 25 · 33 · 5 · 7 are the only integers satisfying σ (n) = ω(n) · n. (29) For multiply perfect numbers in Lucas sequences see [194]. Finally, let us stop at certain problems relating complexity theory of algorithms. Gill’s complexity class ([107]) BPP is the class of languages recognized in polynomial time by a probabilistic Turing machine, with two-sided error probability bounded by a constant away from 1/2. Now Theorem 8 of [9] states that the set of multiply perfect numbers is in BPP. (30) Bach, Miller and Shallit prove the similar result for perfect numbers, as well as amicable numbers. (31) For algorithmic number theory, see [10].

1.6

Quasiperfect, almost perfect, and pseudoperfect numbers

A number n is called quasiperfect, if σ (n) = 2n + 1

(1)

No such numbers are known, but necessary conditions have been obtained by various authors. P. Cattaneo [50] proved that if n is quasiperfect and r |σ (n), then r ≡ 1 or 3

(mod 8)

(2)

If p 2α ||n and q|(2α + 1), then (q − 1)( p + 1) ≡ 0 or 4

(mod 16)

(3)

Cattaneo proved also that an odd quasiperfect number must be a perfect square. (4) H. L. Abbott, C. E. Aull, E. Brown and D. Suryanarayana [1] as well as G. L. Cohen [57] deduced other conditions. For example, in [57] it is shown that there is no quasiperfect number of the forms m 4 or m 6 (in this last case one suppose also (m, 3) = 1) (5) It is shown also that there are no quasiperfect numbers of the form 32a m 2b where 3 m, a ≡ 2

(mod 8) and b ≡ 0

If a number of the form

r

6qi +2

pi

(mod 5) or b ≡ 0

(mod 11)

(6)

( pi primes) is quasiperfect, then

i=1

r ≥ 230876 36

(7)

PERFECT NUMBERS

Abbott, Aull, Brown and Suryanarayana [1] showed that a quasiperfect number n must have at least five distinct divisors and n > 1020

(8)

M. Kishore [175] improved this to ω(n) ≥ 6 and n > 1030

(9)

while Cohen and Hagis, Jr. [61] obtained the refinement ω(n) ≥ 7 and n > 1035

(10)

When 3 n, this has been earlier obtained by Jerrard and Temperley [156]. Kanold [172] proved that there are only finitely many quasiperfect numbers n for which ω(n) < K (11) where K is a fixed constant. 1 2M + log . For a positive integer M, let λ(M) = p σ (M) p/M 1 . If n is quasiperfect, then Let S = p p/n (i) if p1 = 5, then S < λ(56 ) (12) (ii) if p1 ≥ 7, then S < log 2 (13) (iii) if p1 = 3, p2 = 5, then S < λ(34 · 56 ) (14) (iv) if p1 = 3, p2 ≥ 7, then S < λ(34 ) (15) Here p1 < p2 are the least two prime divisors of n. These results are due to Cohen [55]. Let n be quasiperfect and let p1 < · · · < pr be its prime divisors. Kishore [178] proves that i−1 (16) pi < 22 (r − i + 1) for 2 ≤ i ≤ 6 A. Makowski [203] has investigated the solutions of the equation σ (n) = 2n + 2 If 2k − 3 = prime, then n = 2k−1 (2k − 3) is a solution. We note that 2k − 3 are primes e.g. for k = 2, 3, 4, 5, 6, 9, 10, 12, 14, 20, etc. A solution of other type is n = 650. We now introduce almost perfect numbers. A number n is called so, if one has σ (n) = 2n − 1 37

(17)

CHAPTER 1

Again, we should note that in the literature ”almost perfect” sometimes means quasiperfect in the sense of (1), or almost perfect, in the sense of (17) (see e.g. [156], [71]). S. Singh [287] calls almost perfect numbers ”slightly defective” while quasiperfect numbers ”slightly excessive”. It is easy to check that powers of 2 satisfy (17); no other almost perfect numbers are known. An infinite class of numbers which are not almost perfect is given by J. T. Cross [71] as follows: Let p denote an odd prime. If 2m+1 > p, then no multiple (18) of 2m p is almost perfect. In 1978 M. Kishore [176] proved that if n is an odd almost perfect number, then ω(n) ≥ 6

(19)

Cross [71] notes that the argument by Jerrard and Temperley [156] can be modified to show that if 3 n, then ω(n) ≥ 7 (20) for such numbers. An analogous result to (16) in case of almost perfect numbers is i−1

pi < 22 (r − i + 1), 2 ≤ i ≤ 5

(21)

p6 < 23775427335(r − 5)

(22)

and due to Kishore [178]. An odd almost perfect number n should be a perfect square, and if p1a1 ||n, where p1 = 3 is the least prime divisor of n, then a1 ≥ 12. (23) For this result, see also [176].

1.7

Superperfect and related numbers

A number n is called superperfect (after D. Suryanarayana [307]) if σ (σ (n)) = 2n

(1)

Suryanarayana and Kanold [171] have determined the general form of even superperfect numbers. These can be written as n = 2k (k ≥ 1), where 2k+1 − 1 is prime

(2)

New proofs of (2) have been obtained by G. Lord [193] and J. Sándor ([271], [273]). The odd superperfect numbers are not known, but they must be perfect squares (3) 38

PERFECT NUMBERS

as proved by Kanold [307]. According to Guy [114] (p. 65), Dandepat et al. proved that if n is odd superperfect, then n or σ (n) is divisible by at least three distinct primes. (4) Suryanarayana [308] shows that odd numbers of this type cannot have the form p 2α ( p prime). (5) Hunsucker and Pomerance [149] give the lower bound 7 · 1024

(6)

for the odd superperfect numbers. D. Bode [26] obtained that the number of even superperfect numbers less than x is o(log x/ log log x)

(7)

By iterating the composition of σ , Bode [26] showed also that there are no even m-superperfect numbers for m ≥ 3, in the sense that σ (m) (n) = 2n

(8)

where σ (m) (n) = σ (. . . σ (n) . . .). m times

For a new proof, see Lord [193]. J. McCranie [70] has shown that there are no m-superperfect numbers less than 4.29 × 109 for any m ≥ 3. Sándor [270] considered the perfect number analogue for the composition of some arithmetic functions. He reproved (2) by showing that σ (σ (n)) ≥ 2n for all even n

(9)

with equality only for n = 2k , with 2k+1 − 1 prime. Let ψ be the Dedekind arithmetic function, defined by 1 ψ(n) = n (n > 1), ψ(1) = 1. 1+ p p/n Then, an improvement of (9) is the inequality σ (σ (n)) ≥ ψ(σ (n)) ≥ 2n for even n,

(10)

where the last equality holds only for n = 2k , with 2k+1 − 1 prime. Superperfect number are called σ ◦ σ -perfect numbers, while numbers with property ψ(σ (n)) = 2n 39

(11)

CHAPTER 1

are called ψ ◦ σ -perfect numbers. All even perfect numbers of this type are determined. Equation (11) has at least an odd solution n = 3. Let n be an odd solution of (11). Then (see [270]) (a) n ≡ −1 (mod 3), (b) n ≡ 7 (mod 12) (c) n ≡ −4 (mod 21), n ≡ 10 (mod 21) (d) 2α · 3β σ (n) for all α, β ≥ 1. (12) Related to σ ◦ ψ-perfect numbers, i.e. satisfying σ (ψ(n)) = 2n

(13)

Sándor proves that the only even solution is n = 2. One has σ (ψ(n)) ≥ 2n

m+1 for n even, m

(14)

with n = 2a , where m denotes the greatest odd divisor of n. If n is an odd σ ◦ ψperfect number, and p is an odd prime having the property σ ( p + 1) > 2 p, then p n (particularly 3, 5, 7, 11, 17, 19 n). (15) It is conjectured that (13) doesn’t have odd solutions. In connection to Bode’s result, Sándor [270] proves that for any m ≥ 3, there are no ψ ◦ ψ ◦ · · · ◦ ψ −perfect numbers (16) m

The problem of ”ψ-superperfect” numbers is completely settled as followed: The only solution of equation ψ(ψ(n)) = 2n

(17)

is n = 3. But there are many ”ψ-triperfect” numbers as the even solutions of ψ(ψ(n)) = 3n

(18)

are n = 2k , where k > 1. Let ϕ be the Euler totient. Sándor [270] proves that there are no ψ ◦ ϕ-perfect numbers which are odd. (19) If n is even, and the greatest odd divisor of n is ψ ◦ ϕ-deficient, then n is also ψ ◦ ϕ-deficient (i.e. (ψ ◦ ϕ)(n) < 2n). Here it is conjectured also that ψ(ϕ(m)) ≥ m for any odd m 40

(20)

PERFECT NUMBERS

Related to ψ-multiperfect numbers the following result is true (Sándor [269]). We say that n is ω-multiple of m (see Ch. Wall [318]) if m|n and the sets of prime factors of m resp. n are identical. Let us now suppose that the least solution of equation ψ(n) = kn (21) is a squarefree number n k . Then all solutions of (21) are the ω-multiples of n. Let us call n quasi-superperfect if σ (σ (n)) = 2n + 1

(22) (23)

Clearly the Mersenne primes are such; it is not known if there are others. Subbarao [301] proves that if a prime p satisfies (23) then p is a Mersenne prime, otherwise (24) σ ( p) = 2r M 2 , where M has at leat two prime divisors. Generally, if n satisfies (23), then n must be odd, and σ (a) must be of the form σ (n) = 2r M 2 , where M is an odd integer.

(25)

Subbarao proves also that there is no odd perfect number of the form n = 1 mσ (m) for which σ (m) is a power of n and with m quasi-superperfect (i.e. m 2 satisfying (23)). (26) He raises the following open problem: if m is quasi-superperfect, is the number 1 (27) n given by n = mσ (m) a perfect number? 2 The almost superperfect numbers are defined by σ (σ (n)) = 2n − 1

(28)

We cannot decide if there exist such numbers, in fact no reference to this question we were able to find in the literature. (The analogous question, however, for unitary divisors, as we will see in a further section, is much easier). Another generalization of superperfect numbers has been considered by G. L. Cohen and H. J. J. te Riele [64]. They call a number n (m, k)-perfect if σ (m) (n) = kn

(29)

The classical perfect numbers are then the (1,2)-perfect, the k-multiperfect numbers are (1, k)-perfect, the superperfect numbers are (2,2)-perfect, the m-superperfect numbers are (m, 2)-perfect. They give a table of all (2, k)-perfect numbers up to 109 . They gave a table for all (3, k)-perfect and (4, k)-perfect numbers up to 2 · 108 in 41

CHAPTER 1

1995 [63]. It is interesting to note that no new (1,3)-perfect numbers have been found in the last 350 years, nor any new (1,4)-perfect numbers in the last 70 years. For (2, k)-perfect numbers they prove the following general result: suppose l is an odd (2, k)-perfect number. For any a such that 2a |kσ (σ (2a )) and such that σ (2a ) and σ (l) are relative prime, the number 2a l is (2, 2−a kσ (σ (2a )))-perfect. (30) For example, for p > 2, 2 p−1 · 3 · 5 · 7 · 132 · 31 is (2,12)-perfect. They conjecture that all numbers n are (m, k)-perfect for some m, k; and verified it for all n ≤ 1000. (31) There are also some theoretical results supporting conjecture (31). Here one has to do with the properties relating to the iteration of σ . P. Erdös [90] asked if (σ (m) (n))1/m has a limit as m → ∞. He conjectures that it is infinite for each n > 1. (32) Erdös, Granville, Pomerance and Spiro [93] poses five new open problems, as follows: (i) For any n > 1, σ (m+1) (n)/σ (m) (n) → 1 as m → ∞ (33) (ii) For any n > 1, σ (m+1) (n)/σ (m) (n) → ∞ as m → ∞ (34) (iii) For any n > 1, there is m with n|σ (m) (n) (35) (iv) For any n, l > 1 there is m with l|σ (m) (n) (36) (v) For any n 1 , n 2 > 1, there are m 1 , m 2 with σ (m 1 ) (n 1 ) = σ (m 2 ) (n 2 ). (37) Cohen and te Riele [64] give some computational evidence to indicate that statements (32), (34), (35), (36) are true, while (33) and (36) are false. A. Schinzel [281] asks if lim inf σ (m) (n)/n < ∞ n→∞

(38)

for each m, and observe that it follows for m = 2 from a deep theorem of A. Rényi. A. Makowski and A. Schinzel [207] gave an elementary proof that for m = 2 the limit is 1. The result is also true for m = 3, proved by H. Maier [202]. (39) Makowski [206] showed earlier this result by assuming the infinitude of Mersenne primes. He proves also that (38) is true if one assumes a general hypothesis H due to Schinzel [282]. (40) For the iteration properties of s(n) = σ (n) − n, as well as divisibility and congruence properties of σ (m) (n), see the surveys in Mitrinović-Sándor [218] (pp. 92-94). We will return later on the iteration of s(n) when studying sociable numbers.

1.8

Pseudoperfect, weird and harmonic numbers

W. Sierpinski [286] called a number pseudoperfect if it was the sum of the some its distinct divisors. E.g. 20 = 1+4+5+10 is pseudoperfect but 8 not. Some authors use the ”semiperfect” terminology (see e.g. A. and E. Zachariou [330]). 42

PERFECT NUMBERS

Numbers n with the property σ (n) > 2n are called abundant (for their properties, see Mitrinović-Sándor [218], and for a recent survey, see Sándor [274]. In [218] and [274] one can find results also on deficient numbers, defined by σ (n) < 2n). A number is called primitive abundant if it is abundant, but all its proper divisors are deficient; and primitive pseudoperfect if it is pseudoperfect, but none of its proper divisors are. C. Pomerance [236] called n a harmonic number, if the harmonic mean of all the divisors of n is an integer (equivalently, σ (n) divides nd(n); where d(n) is the number of divisors of n). These numbers were considered first by O. Ore [228], and some author call them ”Ore numbers”. Finally, S. J. Benkovski [21] called a number weird, if it is abundant but not pseudoperfect. Now some results on these numbers. Erdös (see [114], p. 46) has shown that the density of pseudoperfect numbers exists, (1) and says that probably there are integers n which are not pseudoperfect, but for which n = ab, with a abundant and b having many prime factors. (2) H. Abbott (see [114], p. 46) lets l = l(n) (where n ≥ 3) be the least integer for which there are n integers 1 ≤ a1 < a2 < · · · < an = l such that each ai divides s= ai (so that s is pseudoperfect). Then

for all n ≥ 3; and

l(n) > n c1 log log n (c1 > 0 constant),

(3)

l(n) < n c2 log log n (c2 > 0, constant),

(4)

for infinitely many n. A. and E. Zachariou [330] note that every multiple of a pseudoperfect number is pseudoperfect. (5) All numbers 2m p with m ≥ 1 and p a prime between 2m and 2m+1 are primitive pseudoperfect, but there are such numbers not of this form, e.g. 770. (6) There are infinitely many primitive pseudoperfect numbers that are not harmonic numbers. The smallest odd primitive pseudoperfect number is 945. (7) P. Erdös (see [114], p. 47) can show that the number of odd primitive pseudoperfect numbers is infinite. (8) Benkovski and Erdös [22] showed that the density of weird numbers is positive. (9) Some very large weird numbers were found by S. Kravitz [182]. There are 24 primitive weird numbers less than a million (70, 836, 4030, 5830,...). Nonprimitive weird numbers include numbers of form 70 p, where p > 144 is a prime, or 836 p with p = 421, 487, 491 or ≥ 577; also 7192 · 31. (10) Benkovski and Erdös [22] posed some open problems on weird numbers: are there infinitely many primitive abundant numbers which are weird? (11) 43

CHAPTER 1

Is every odd abundant number pseudoperfect (thus not weird)? (12) Can σ (n) be arbitrarily large for weird n? (13) They conjecture ”no”. For primitive weird numbers, see also [230]. Clearly, a pseudoperfect number is a perfect one, too. The similar statement for harmonic numbers is due to Ore [228]: n perfect ⇒ n harmonic. (14) Ore proved that a harmonic number has at least two distinct prime factors, (15) and Pomerance [236] (see also D. Callan [41]) proved that the only harmonic numbers with two distinct prime factors are the even perfect numbers. (16) M. Garcia [105] extended the list of harmonic numbers to include all 45 which are < 107 , and he found more than 200 larger ones. The least one, apart from 1 and the perfect numbers, is 140. (17) 9 All 130 harmonic numbers up to 2 · 10 are listed in G. L. Cohen [59], (18) and R. M. Sorli (see Cohen and Sorli [66]) has continued the list to 1010 . (19) Kanold [170] has shown that the density of harmonic numbers is 0. (20) Ore [228] conjectured that every harmonic number is even, but this probably is very difficult. Indeed, this result, if true, would imply that there are no odd perfect numbers. See also W. H. Mills [215], who proved that if there exists an odd harmonic number n, then n has a prime-power factor greater than 107 . Related to Pomerance’s result (16) one can ask: if a harmonic number has three distinct divisors, is it even? (21) In 1998 G. L. Cohen and D. Moujie [62] have introduced a generalization of harmonic numbers. A number n > 1 is called k-harmonic if Hk =

n k d(n) σk (n)

is an integer. Here k ≥ 1 denotes a positive integer, and σk (n) =

(22)

d k denotes

d/n

the sum of kth powers of divisors of n. The number n is called power-harmonic if it is k-harmonic for some k ≥ 1. A power-harmonic number is proper, it if is kharmonic for some k ≥ 2. No k-harmonic number with k ≥ 2 is known. However, Cohen and Moujie are able to prove some necessary conditions. For example, if n is power-harmonic, then has at least two distinct prime factors. (23) This generalizes Ore’s result (15). If n is k-harmonic, then Hk (n) ≤ d(n) − 1

(24)

For even k-harmonic numbers the following is true: Let n = 2a p b ( p odd prime) be a proper k-harmonic number. If k is even, then b ≡ 7 (mod 8); if k is odd then b is odd and ( p + 1)(b + 1) ≡ 0 (mod 16) (25) 44

PERFECT NUMBERS

If n is a proper k-harmonic number, then d(n) > 1 +

k−1 k ·2 , k+1

(26)

and if n is a proper power-harmonic number, then d(n) ≥ 60

(27)

Also, if n is a proper power-harmonic number, then n > 1010

(28)

Finally, we note that W. Butske et al. [40] have considered primary pseudoperfect number n which is a product of distinct primes and which satisfies 1 1 + = 1. The first few such numbers are 2, 6, 42, 1806, 47058,... n p p/n

1.9

Unitary, bi-unitary, infinitary-perfect and related numbers

n = 1. Let σ ∗ (n) denote A divisor d of n is called a unitary divisor, if d, d the sum of unitary divisors of n. It is known that (see E. Cohen [53], and see also [279] for various divisibility notions, convolutions and arithmetic functions) σ ∗ is multiplicative and σ ∗ ( p α ) = p α + 1 for any prime power α. Also σ ∗ (1) = 1. In 1966 M. V. Subbarao and L. J. Warren [303] introduced the unitary perfect numbers n satisfying σ ∗ (n) = 2n (1) They found the first four unitary perfect numbers, namely 6, 60, 90, 87360,

(2)

and in 1975 Ch. Wall [319], [321] discovered the fifth, namely 218 · 3 · 54 · 7 · 11 · 13 · 19 · 37 · 79 · 109 · 157 · 313

(3)

Subbarao and Warren proved that there are no odd solutions of (1). This was shown independently also by K. Nageswara Rao [224]. No other unitary perfect numbers than the five given by (2) and (3) are known, but if n = 2a m (m odd ) would be a new one, then Subbarao et al. [302] showed that one must have a > 10 and ω(m) > 6 (4) 45

CHAPTER 1

Later, Wall [323] improved this to ω(m) > 8,

(5)

while in [322] he proved that any new unitary perfect number has a prime power unitary divisor larger than 215 (6) H. A. M. Frei [104] has shown that if n = 2m p1a1 . . . prar is unitary perfect with (n, 3) = 1, then m > 144, r > 144, and n > 10440 (6 ) It is not known if there are infinitely many unitary perfect numbers. Subbarao (see [300]) has conjectured that there are only finitely many. It is also not known whether there exists at least a unitary perfect number not divisible by 3. (7) (see [303]), or a k-unitary perfect number for k ≥ 3, where σ ∗ (n) = kn, (8) see [289]. P. Hagis [124] proved that if (8) holds and n contains t distinct odd divisors, then k = 4 or 6 implies n > 10110 , t ≥ 51 and 249 |n. (9) (10) If k ≥ 8, then n > 10663 and t ≥ 247, while k ≥ 5, odd, imply n > 10461 and t ≥ 166, 2166 |n. (11) a In 1989 S. W. Graham [111] proved the following result: If n = 2 m is a unitary perfect number, where m is an odd squarefree number, then either a = 1 and m = 3, a = 2 and m = 3 · 5, or a = 6 and m = 3 · 5 · 7 · 13 (thus there are only three such numbers). (12) J. De Boer [129] proved that if n = 29 · 32 m is unitary perfect, with (m, 6) = 1 and squarefree, then a = 1 and m = 5. On unitary abundant numbers, see [274]. A divisor d of n is called a bi-unitary divisor if the greatest common unitary n divisor of d and is 1. Let σ ∗∗ (n) be the sum of bi-unitary divisors of n. Wall [320] d call n bi-unitary perfect, if σ ∗∗ (n) = 2n (13) It is not difficult to verify that σ ∗∗ is multiplicative and σ ∗∗ ( p α ) = σ ( p α ) = and σ ∗∗ ( p α ) =

p α+1 − 1 if α is odd, p−1

p α+1 − 1 − p α/2 , if α is even p−1 46

(14)

PERFECT NUMBERS

Hence

σ ∗∗ (n) ≤ σ (n)

(15)

with equality only if every prime which divides n does so an odd number of times. Wall proves that there are only three bi-unitary perfect numbers, namely 6, 60, 90. (16) Hagis [126] introduced bi-unitary multiply perfect numbers by n|σ ∗∗ (n)

(13 )

and proved that there are no odd numbers of this type. There are 17 numbers n < 107 satisfying (13’) (three of them are the numbers from (16)). W. E. Beck and R. M. Najar [13] essentially have determined all unitary quasiperfect numbers satisfying σ ∗ (n) = 2n + 1

(17)

as well as all unitary almost perfect numbers such that σ ∗ (n) = 2n − 1 They proved that there are no unitary quasiperfect numbers, and that n = 1 and n = 2 are the all possible unitary almost perfect numbers.

(18) (19)

(20) A. Bege [16] has proved that there are no bi-unitary quasiperfect numbers, i.e. numbers n satisfying σ ∗∗ (n) = 2n + 1. J. Sándor [270] (see pp. 11-12) showed there are no unitary quasi superperfect numbers n satisfying σ ∗ (σ ∗ (n)) = 2n + 1 (21) and that the only unitary almost superperfect number n, i.e. such that σ ∗ (σ ∗ (n)) = 2n − 1

(22)

are n = 1 and n = 3. Sitaramaiah and Subbarao [290] rediscovered this result. They study more profoundly the unitary superperfect numbers n with σ ∗ (σ ∗ (n)) = 2n

(23)

The first ten such numbers are 2, 9, 165, 238, 1640, 4320, 10250, 10824, 13500 and 23760. There are not known odd unitary superperfect numbers other than 9 and 165, and Sitaramaiah and Subbarao conjecture that the set of such numbers is finite. (24) 47

CHAPTER 1

In fact 165 is the single such number, having three distinct prime factors. (25) 238 is the only even unitary superperfect number such that n has three prime factors, while σ ∗ (n) two. (26) ∗ If n is an odd unitary superperfect number not divisible by 3, then 3|σ (n); in such a case n must be squarefree, ω(n) even, and ω(n) ≥ 52. (27) We quote one more result: All n ≤ 108 such that n|σ ∗ (σ ∗ (n)) (28) (which could be called as ”unitary multiply superperfect numbers”) are determined; there are 29 such numbers. S. Ligh and Ch. R. Wall [190] have introduced ”nonunitary divisors” and nonunitary perfect numbers. d is a nonunitary divisor of n, if n = cd, with (c, d) > 1. Let σ # (n) be the sum of nonunitary divisors of n. It is immediate that σ # (n) = σ (n) − σ ∗ (n),

(29)

and that σ # is not multiplicative. A number n is called nonunitary perfect, if σ # (n) = n

(30)

All known nonunitary perfect numbers are even. P. Hagis, Jr. [129] prove that σ # (n) is odd iff n = 2α M 2 , where M > 1 is odd and α ≥ 0. (31) As a corollary we get that an odd nonunitary perfect number must be a perfect square. (32) Another result by Hagis says that an odd nonunitary perfect number n must have at least four distinct prime factors, and n > 1015 . If 3 n, then ω(n) ≥ 7. (33) 2 4 4 If 2 · 5 · 7|n, then for such numbers one has also 3 ||n and 5 · 7 |n. Also p n if 11 ≤ p ≤ 271. (34) G. L. Cohen [58] calls a unitary divisor d of n as 1-ary divisor, and he calls d a k-ary divisor of n (for k > 1), and writes d|k n, if the greatest (k − 1)-ary divisor of d n n = 1 for 1-ary divisors d. He also calls p x an infinitary and is 1. Note that d, d d (35) divisor of p y (y > 0, p prime) if p x | y−1 p y , and writes p x |∞ p y . r y p j j , for distinct primes p1 , . . . , pr , and Let d be a divisor of n and write n = d=

r

j=1 x

p j j (where 0 ≤ x j ≤ y j , j = 1, r ). Then d is an infinitary divisor of n if

j=1 x

y

p j j |∞ p j j for each k = 1, r . 48

(36)

PERFECT NUMBERS

It is interesting to note that, by writing the binary representations x = xj2j and y − x = z j 2 j (where the sums are finite, j ≥ 0, each x j and z j is 0 or 1, and trailing zeros are allowed where required), then xjzj = 0 (37) p x |∞ p y iff Another interesting characterization (see [58]) is the following: y x y is odd, (38) p |∞ p iff x y = C yx denotes a binomial coefficient. where x Let σ∞ (n) be the sum of all infinitary divisors of n. Then σ∞ is a multiplicative function, and j σ∞ ( p α ) = (1 + p 2 ), where y = yj2j (39) y j =1

The number n is called infinitary perfect, resp. infinitary k-perfect if σ∞ (n) = 2n,

(40)

σ∞ (n) = kn (k ≥ 2)

(41)

resp. There are no odd infinitary perfect or k-perfect numbers, and Cohen conjectures that there are no infinitary perfect or k-perfect numbers not divisible by 3. (42) Cohen gives a number of 14 infinitary perfect, 13 infinitary 3-perfect, 7 infinitary 4-perfect, 2 infinitary 5-perfect numbers. Pedersen [231] found 139 new infinitary (43) perfect numbers. Cohen proves also that the only infinitary perfect numbers not divisible by 8 are 6, 60 and 90. (44) We note that D. Suryanarayana [306] and K. Alladi [6] have given different generalizations from above for unitary divisors, thus obtaining other notions of k-ary divisors. (45) ∗ ∗ A number n is called unitary harmonic if σ (n)|nd (n) (46) i.e. if the unitary harmonic mean H ∗ (n) = nd ∗ (n)/σ ∗ (n) is an integer. The main properties of unitary harmonic numbers were studied by Hagis and Lord [135], but it was earlier introduced also by N. Nageswara Rao [224] who showed that if n is unitary perfect, then it is also unitary harmonic. (47) Ch. R. Wall [Unitary harmonic numbers, Fib. Quart. 21(1983), 18-25] has proved that there are 23 unitary harmonic numbers n with ω(n) ≤ 4, and 43 unitary harmonic numbers n ≤ 106 . 49

CHAPTER 1

Let H ∗ (x) be the counting function of unitary harmonic numbers. Then for ε > 0 and large x one has (48) H ∗ (x) < 2.2x 1/2 · 2(1+ε) log x/ log log x a result due to Hagis and Lord [135]. Hagis and Cohen [131] study infinitary harmonic numbers, i.e. those numbers n for which (49) σ∞ (n)|nd∞ (n) where d∞ (n) and σ∞ (n) denote the number, resp., sum of infinitary divisors of n. Let H∞ (n) = nd∞ (n)/σ∞ (n). They show that if n is infinitary perfect, then it is also infinitary harmonic. (50) If Sc is the set of all positive integers such that H∞ (n) = c, then Sc is finite (or empty) for every real number c. (51) For the counting function H∞ (x) of infinitary harmonic function exactly the same estimate as (48) holds: H∞ (x) < 2.2x 1/2 · 2(1+ε) log x log log x

1.10

(52)

Hyperperfect, exponentially perfect, integer-perfect and γ -perfect numbers

In 1975 D. Minoli and R. Bear [217] have generalized the concept of perfect number, by introducing the hyperperfect numbers. An integer n > 1 is k-hyperperfect if n = 1 + k[σ (n) − n − 1] (1) When k = 1, this gives the perfect numbers. It easily follows that for k ≥ 2 all k-hyperperfect numbers are odd. For example 21, 2133, 19521 are 2-hyperperfect, 325 is 3-hyperperfect, 301 and 16513 are 6hyperperfect, 697 is 12-hyperperfect (see [217]). (2) Minoli [216] gave a table for all hyperperfect numbers less than 1500000. All these numbers have two distinct prime factors. But hyperperfect numbers can have more than two prime factors, for example (see te Riele [254]) 13·269·449 = 1570153 is a 5-hyperperfect number, having three distinct prime factors. (3) Minoli and Bear prove that a hyperperfect number cannot be a power of a prime. (4) If n = pq with p, q primes is k-hyperperfect, then k < p < 2k < q. (5) m m+1 m+1 If n = 3 (3 − 2), where 3 − 2 is a prime, then n is 2-hyperperfect. (6) 50

PERFECT NUMBERS

Recently, J. C. M. Nash [226] extended this to any prime p in place of 3, as follows: If n = p m ( p m+1 − ( p − 1)) and p m+1 − ( p − 1) is prime, then n is ( p − 1)hyperperfect. (7) Minoli [216] proves that if n = p1α1 p22 is k-hyperperfect, then k + 2 ≤ p1 ≤ (8) (k + 1)2 ( p1 , p2 distinct primes); and if n = p1α1 p2α2 is k-hyperperfect, then α2 ≤

log[k( p1α1 + · · · + 1) + ( p2 − 1)(k − 1)] log p2

(9)

Finally, a conjecture by Minoli and Bear [217] states that there are k-hyperperfect numbers for every k. (10) Another conjecture by them affirms that the converse of theorem (6) is true, namely if n = 3m (3m+1 − 2) is 2-hyperperfect, then 3m+1 − 2 is prime. (11) 3k + 1 , q = 3k + 4 are prime, then it If k > 1 is an odd integer, and p = 2 is immediate that p 2 q is k-hyperperfect. J. S. McCranie [69] conjectures that all khyperperfect numbers for odd k > 1 are of this form. McCranie has tabulated all hyperperfect numbers less than 1011 . For unitary hyperperfect numbers, see [122]. Here one replaces in (1) σ (n) with σ ∗ (n). It is easy to see that if n is unitary hyperperfect, and 3 n, then n ≡ 1 (mod 3). Also, if 3 nk, then n has an odd number of distinct prime factors. n cannot be a prime power, and if n has the form n = pa q b , then pa − k = 1, 2, 5, 10, 13, 17, 25, 26, 29, 34, . . . There are in total 36 unitary hyperfect numbers n ≤ 106 . Four of these numbers are unitary perfect, found by Subbarao and Warren, twenty are hyperperfect numbers given by Minoli. From the twelve new ones we quote n = 23 · 5 (k = 3), 22 · 13 (k = 3), 25 · 32 (k = 7), 32 · 73 (k = 8), 27 · 17 (k = 15), etc. D. A. Buell [38] computed all unitary hyperperfect numbers < 108 . By developing a search procedure different from that of Buell, P. Hagis [127] found all such numbers < 109 . If n = p1α1 . . . prαr , then E. G. Straus and M. V. Subbarao [299] call d an exponential divisor if d|n and d = p1b1 . . . prbr where bi |qi (i = 1, r ).

(12)

Let σe (n) be the sum of exponential divisors of n. For various arithmetic functions and convolutions on exponential divisors, see Sándor-Bege [279]. Straus and Subbarao call n exponentially perfect (or shortly eperfect) if σe (n) = 2n (13) 51

CHAPTER 1

Some examples of e-perfect numbers are 22 · 32 , 22 · 33 · 52 , 23 · 32 · 52 , 24 · 32 · 112 , 24 · 33 · 52 · 112 , 26 · 32 · 72 · 132 , 27 · 32 · 52 · 72 · 132 , 28 · 32 · 52 · 72 · 1392 , 219 · 32 · 52 · 72 · 112 · 132 · 192 · 372 · 792 · 1092 · 1572 · 3132 . If m is squarefree, then σe (m) = m, so if n is e-perfect and m = squarefree with (m, n) = 1, then m · n is e-perfect. (14) So it suffices to consider only powerful (i.e. no prime occurs to the first power) e-perfect numbers. Straus and Subbarao proved that there are no odd e-perfect numbers, (15) and that for each r the number of e-perfect numbers with r prime factors is finite. (16) Is there an e-perfect number which is not divisible by 3? (17) Straus and Subbarao conjecture that there is only a finite number of e-perfect numbers not divisible by any given prime p. (18) J. Fabrykowski and Subbarao [100] proved that any e-perfect number not divisible by 3 must be divisible by 2117 , greater than 10664 , and having at least 118 distinct prime factors. (19) In 1988 P. Hagis, Jr. [128] showed that the density of e-perfect numbers is positive (namely, is 0.0087). (20) The number n is called e-multiperfect (see [299] if σe (n) = kn

(21)

for some k > 2. Results (15) and (16) are true also for such numbers. W. Aiello, G. E. Hardy and Subbarao [2] proved that if n is e-multiperfect, then n > 2 · 107 for k = 3;

(22)

n > 1085 for k = 4;

(23)

n > 10320 for k = 5;

(24)

n > 101210 for k = 6.

(25)

For the number of powerful solutions n ≤ x of (21), L. Lucht [201] proved that this is ≤ exp(c log x/ log log x) (26) for x ≥ 3 (even, for rational k > 1), with c a constant not depending on k. A number of interesting properties are proved in the paper by J. Hanumanthachari, V. V. Subrahmanya Sastri and V. Srinivasan [139]: If m is squarefree, then m 2 is e-perfect iff m = 6. (27) The only e-perfect number having two distinct prime factors is 36. (28) 52

PERFECT NUMBERS

b cj q j , where If n is an e-perfect number not multiple of 3, and n = pi i 2 3 p ≡ 1 (mod 3), q j ≡ 2 (mod 3), ( pi , q j primes) with bi = Pi Q i Ri (Pi , Q i being squarefree, (Pi , Q i ) = 1) and e j = L j M 2j N 3j (L j , M j being squarefree and (L j , M j ) = 1), then each Q i = 1, each L j is odd, and no M j is greater than 2. (28 ) c Further, if f = the number of q j j for which M j = 1 and ω(L j ) is even; g = the c number of q j j for which M j = 2 and ω(L j ) is odd, and h = the number of pibi for which ω(Pi ) is odd, then f + g + h is odd or even, according as n ≡ 1 or 2

(mod 3)

(29) c pibi qj j For numbers divisible by 3 the following is proved: if n = 3a (a > 1, bi > 1, c j > 1), with pi , q j primes, pi ≡ 1 (mod 3), q j ≡ 2 (mod 3) is e-perfect, then either (i) some bi has in its factorization some prime highest to the index congruent to 2 (mod 3) or (ii) some c j has 2 in its factorization highest to the index congruent to 1 (mod 3) or some c j has an odd prime occurring in its factorization to the highest index congruent to 2 (mod 3). Hanumanthachari, Subrahmanya Sastri and Srinivasan study also e-superperfect numbers given by σe (σe (n)) = 2n (30)

(31) If n = pq with p, q primes, is a solution of (30), then n = 32 . If p is a prime, n squarefree and ( p, n) = 1, ( p + 1, n) > 1, then p 2 n is esuperperfect only if p = 2. (31 ) Generally, if (σe (m), n) = 1 and n is squarefree, then mn is e-superperfect iff m is superperfect, too. (32) Related to the iteration of σe (32 ), they remark that σe(4+r ) (32 ) = 2 · 3 · 5 for any r ≥ 0 and conjecture that σe(k) (22 · 32 ) is never squarefree.

(33)

Another conjecture states that for every prime p there is a least positive integer k = k( p) such that σe(k) ( p 2 ) is squarefree. (34) In this section we shall deal also with integer-perfect numbers, which are numbers n such that n= α(d)d (35) (n) where indicates that the sum is over the proper divisors d of n and α(d) ∈ (n) {1, −1} for each d. This notion is due to L. V. Marijo [209]. 53

CHAPTER 1

Let ν(n) be the number of such representation of n, and call an integer-perfect number minimal if it has no proper divisor which is integer perfect. Marijo proves the following results: No integer of the form 2a b (b odd) is integer-perfect if b is a perfect square, but otherwise all integers of this form are interger-perfect for sufficiently large a. (36) If n is an (ordinary) even perfect number, then ν(n) = ν(2n) = 1.

(37)

For any positive integer N , there exists a minimal integer-perfect number g(N ) such that ν(g(N )) ≥ N . (38) If p is a prime not dividing n, then for any positive integer a, ν( pa n) ≥ 2a (ν(n))a+1 , with equality whenever p > σ (n)

(39)

The following asymptotic results appears in Marijo [210]: car d{m ≤ x : ν(m) ≥ m} = O(x 3/4 ).

(40)

ν(n) can be arbitrarily large. (41) nk Finally, we define γ -perfect numbers. M. D. Miller [214] defines a function γ : N → N recursively by γ (n) = γ (d) (42) For each k ∈ N∗ ,

d/n,d 1 will be called γ -perfect if γ (n) = n

(44)

Miller (who use another terminology) proves that there are no odd γ -perfect numbers. (45) n n 2 n 3 p q is γ -perfect iff p = 2 and n + 2 = 2q, while p q or p q cannot be γ -perfect. A number of the form p n qr is γ -perfect iff p = 2, and 2qr = n 2 + 6n + 6. 54

(46)

PERFECT NUMBERS

These give example of such perfect numbers, e.g. 48, 1280, 2496, 28672, 454656, 2342912,... More generally, if f is an arithmetic function, then n is called f -perfect by J. L. Pe [On a generalization of perfect numbers, J. Recr. Math. (to appear)] if f (d) n= d|n,d 1. Then n is multiplicatively perfect (in short: m-perfect), if T (n) = n 2

(1)

T (T (n)) = n 2

(2)

T (n) = n k

(3)

m-superperfect, if m-multiperfect, if for some k ≥ 2. He considered also the generalization of (2) to T (T (n)) = n k

(4)

(i.e. m-multisuperperfect numbers); as well as T (k) (n) = n k

(5)

The following results are proved: All m-perfect numbers (i.e. satisfying equation (1)) have one of the following forms: n = p1 p2 or n = p13 , where p1 , p2 are distinct primes. (6) (The author discovered later that this result appears also in K. Ireland and M. Rosen [154]. However, the first source is E. Lionnet [192] who defined ”perfect number of 55

CHAPTER 1

the second kind” as number equal to the product of its aliquot parts. See also [84], p. 58.) There are no m-superperfect numbers. (7) n = 6 is the only perfect number, which is multiplicatively perfect, too. (8) The general form of m-multiperfect numbers can be determined too, e.g.: n = p1 p22 , or n = p15 for k = 3;

(9)

n = p1 p23 or n = p1 p2 p3 or n = p17 for k = 4;

(10)

n = p1 p24 or n = p1 p24 or n = p19 for k = 5;

(11)

n=

p1 p2 p32

or n =

p1 p25 ,

n=

p111

for k = 6;

(12)

n = p1 p26 or n = p113 for k = 7;

(13)

n = p1 p2 p3 p4 or n = p1 p2 p33 or n = p13 p23 or n = p115 for k = 8;

(14)

n = p1 p22 p32 , n = p1 p28 , n = p117 for k = 9;

(15)

n = p1 p2 p34 , n = p1 p29 , n = p110 for k = 10.

(16)

As corollaries, one can deduce the following assertions: n = 28 is the single perfect number which is m-triperfect, too. (17) There are no perfect and 4-m-perfect numbers; (18) n = 496 is the only perfect number which is 5-m-perfect. (19) Related to equation (4) one can say, that it has at most a finite number of solution. (20) Particularly, it is not solvable for k = 4, 5, 6. (21) For k = 3, the general solutions are n = 812 , for k = 7, n = p13 , and for k = 9, (22) n = p1 p2 ( p1 , p2 distinct primes). Equation (5) has no solutions n > 1. (23) The function T (n) has some interesting properties: For example lim inf n→∞

log T (n) log T (n) = 1, lim sup = +∞; log n n→∞ log n

(24)

the normal order of magnitude of log log T (n) is (1 + log 2) log log n − log 2

(25)

F. Luca [200] proves that T (σ (n)) > T (n) for almost all n, and that T (n) = T (σ (n)) is impossible for any n > 1. He shows also that both of the relations T (n)|T (σ (n)) and T (σ (n))|T (n) have infinitely many solutions. 56

PERFECT NUMBERS

ˇ at and J. Tomanová [267] have shown that T. Sal´ log log T (n) → 1 + log 2 as n → ∞ log log n on a sequence of density 1. A similar result holds true for T (n)/n. Recently Z. Weiyi [On the divisor product sequences, Smarandache Notions J. 14(2004), 144-146] has obtained the following results: 1 1 , = log log x + C1 + O log x n≤x T (n) n≤x

1 = π(x) + (log log x)2 + B log log x + C2 + O T (n)

log log x log x

where x ≥ 1, C1 , B, C2 are constants, and T (n) = T (n)/n (π(x) is the number of primes ≤ x). A. Bege [17] introduced unitary m-perfect numbers n > 1 as solutions of T ∗ (n) = n 2

(26)

where T ∗ (n) is the product of all unitary divisors of n. Similar concepts as above for unitary m-superperfect and unitary multiperfect are also introduced and studied. All unitary m-perfect numbers have two distinct prime factors; (27) there are no unitary m-superperfect numbers. (28) If T ∗(k) (n) = n l (29) (where T ∗(k) denotes the k-times iteraton of T ∗ ) then n > 1 is called m-unitary (k, l)-perfect number. If l = 2mk , then there are no m-unitary (k, l)-perfect numbers, (30) while if l = 2mk , then every n with ω(n) = m + 1 is an m-unitary (k, l)-perfect number. (31) In a forthcoming paper, A. Bege [18] considered the similar problems for biunitary divisors. n > 1 is m-bi-unitary perfect, if T ∗∗ (n) = n 2 ,

(32)

where T ∗∗ (n) is the product of bi-unitary divisors of n etc. All m-bi-unitary perfect numbers have one of the following forms: n = p14 , n = p13 , n = p12 p22 , n = p12 p2 , n = p1 p2 , where p1 = p2 are primes. (33) 57

CHAPTER 1

All m-bi-unitary superperfect numbers have one of the following forms: n = p, n = p 2 ( p prime). (34) Let k ≥ 2. All (l, k) m-bi-unitary perfect numbers have the form k n= pi i piki −1 (35) ki =2k

where k =

l

ki =2k+1

ki and pi (i = 1, l) are distinct primes.

i=1

In a recent paper, J. Sándor [276] has introduced the multiplicatively e-perfect numbers. Let Te (n) denote the product of all e-divisors of n > 1. Then n is called m − e-perfect if Te (n) = n 2 (36) He proved the following theorem: n > 1 is m − e-perfect iff n = p k , where p is an arbitrary prime, and k is an arbitrary (ordinary) perfect number (i.e. σ (k) = 2k). (37) 6 28 496 For example, n = p , p , p , . . . are all m − e-perfect numbers. Analogously, the m − e-superperfect numbers with the property Te (Te (n)) = n 2

(38)

have the form n = p s , where s is an ordinary superperfect number (i.e. σ (σ (s)) = 2s). (39) According to the open problems relating to the ordinary perfect, or superperfect numbers, the complete determination of m − e-perfect numbers is also left to the future.

1.12

Practical numbers

A positive integer m is said to be practical (see A. K. Srinivasan [293]) if every integer n, with 1 ≤ n ≤ σ (m) is a sum of distinct divisors of m. (1) B. M. Stewart [298] showed that m = p1α1 . . . prαr with p1 < p2 < · · · < pr primes and integers αi ≥ 1 (i = 1, r ) is practical iff either m = 1 or p1 = 2 and for αi−1 every i = 2, . . . , r , pi ≤ σ ( p1α1 p2α2 . . . pi−1 ) + 1. (2) In 1950 P. Erdös [87] announced that practical numbers have asymptotic density. (3) Let 1 = d1 < d2 < · · · < dr = n be the divisors of n and for k ≤ r put tk = d1 + · · · + dk with t0 = 0. Then n is practical iff dk+1 ≤ tk + 1 for all k = 0, r − 1. 58

(4)

PERFECT NUMBERS

As a corollary, if n is practical, then σ (n) ≥ 2n − 1.

(5)

Results (4) and (5) are due to D. F. Robinson [261]. Let P(x) be the cardinality of practical numbers n ≤ x. Then 1 P(x) = O(x/(log x)β ) for every β < (1/ log 2 − 1)2 = 0.0979 . . . 2 and

1 P(x) ≥ Ax exp (log log x)2 + 3 log log x 2 log 2

(6)

(7)

for sufficiently large x (where A = 25/2 /5). Here (6) is due to M. Hausman and H. N. Shapiro [142], and (7) to M. Margenstern [208]. Margenstern proved also that if n is practical, distinct from a power of 2, then σ (n) ≥ 2n,

(8)

which is related to (5). As a corollary of the proof of (8) one gets: all even perfect numbers are practical (see [209]). (9) Hausman and Shapiro proved also the fact that for all x ≥ 1/3, the interval √ (x, x + 3 x) contains a practical number. (10) Margenstern proved also that lim inf σ (m)/m = 2, lim sup σ (m)/m = ∞, m→∞

n→∞

(11)

where m is practical, distinct from powers of 2. He conjectured that every even positive integer is a sum of two practical numbers, (12) and that there exist infinitely many practical numbers m such that m − 2 and m + 2 are also practical. (13) Conjectures (12) and (13) have been proved affirmatively by G. Melfi [213] (who used also a table by Margenstern for all even number < 100000 for (12)). Finally we state another conjecture (which is still open) by Margenstern, namely that x P(x) ∼ λ (x → ∞) (14) log x where λ ≈ 1.341. E. Saias [266] proved that x x c1 · ≤ P(x) ≤ c2 · for x ≥ 2 (15) log x log x for all x ≥ 2; while G. Melfi [212] showed that there exist infinitely many practical numbers in the sequences of Fibonacci, Pell, and Lucas. (16) 59

CHAPTER 1

1.13

Amicable numbers

Two numbers a and b are called amicable if σ (a) = σ (b) = a + b Clearly for a = b we reobtain the perfect numbers, so one may assume in what follows that a = b. According to Iamblicus (about 283-330), ”certain men steeped in mistaken opinion thought that the perfect numbers was called love by Pythagoreans on account of the union of different elements and affinity which exists in it; for they call certain other numbers, on the contrary, amicable numbers, adopting virtues and social qualities to numbers, as 284 and 220, for the parts of each have the power to generate the other, according to the rule of friendship, as Pythagoras affirmed. When asked what is a friend, he replied ”another I”, which is shown in these numbers. Aristotle so defined a friend in his Ethics.” Among Jacob’s presents to Esau were 200 she-goats and 20 he-goats, 200 ewes and 20 rams (Genesis, XXXII, 14). Abraham Azulai (1570-1643), in commenting on this passage from the Bible, remarked that he had found written in the name of Rau Nachson (ninth centure A.D.): ”Our ancestor Jacob prepared his present in a wise way. This number 220 (of goats) is a hidden secret, being one of a pair of numbers such that the parts of it are equal to the other one 284, and conversely. And Jacob had this in mind; this has been tried by the ancients in securing the love of kings and dignatories.” The Arab El Madschrˆıtˆı (1007) of Madrid related that he had himself put to the test the erotic effect of ”giving any one the smaller number 220 to eat, and himself eating the larger number 284”. Ben Kalonymos discussed amicable numbers in 1320 in a work written for Robert of Anjou. A knowledge of amicable numbers was considered necessary by Jochanan Allemanno (fifteenth century) to determine whether an aspect of the planets was friendly or not. In 1634 Mersenne remarked that ”220 and 284 can signify the perfect friendship of two persons since the sum of the aliquot parts of 220 is 284 and conversely, as is these two numbers were only the same thing”. For the early history of amicable numbers (up to 1919), we cite L. E. Dickson [84]. E. B. Escott [95] made a review of the subject up to 1941, while that of E. J. Lee and J. S. Madachy [187] to 1972. More recent surveys can be found in Guy [114], Mitrinović-Sándor [218], Eric Weisstein [325]. Here we will study the subject in a such a manner which shows that certain forgotten or new aspects could be important for the further considerations. Only the most important results will be pointed out. 60

PERFECT NUMBERS

The first method described for finding amicable pairs is due to Thabit ibn Qurra (836-901) (see [84]): Let p = 3 · 2n−1 − 1, q = 3 · 2n − 1, r = 9 · 22n−1 − 1 be all primes (where n is a positive integer). Then (1) a = 2n pq and b = 2n r are amicable. For n = 2 one has p = 5, q = 11, r = 71, so one gets the Pythagorean pair. By rediscovering Thabit’s rule, Fermat in 1636 (in a letter for Mersenne) discovered for n = 4 (when p = 23, q = 47, r = 1151) a new pair a = 17296, b = 18416. In 1838 Descartes (again in a letter to Mersenne) found for n = 7 (when p = 191, q = 383, r = 73727) the third pair a = 9363584, b = 9437056. It was discovered later that these pairs were known to Ibn-al-Banná (1256-1321) of Marakesh and to K. Farisi of Bagdad (see e.g. W. Borho [29]). Despite later searches to n ≤ 8 by Euler, to n ≤ 15 by Legendre, to n ≤ 34 by Le Lasseur, to n ≤ 200 by Gérardin, to n ≤ 1000 by Riesel (see [187]), no additional Thabitean pair have been discovered. L. Euler (1747) [96] was the first to treat extensively the subject of amicable numbers and to show for the first time their great diversity. To exhaust all amicable numbers of the form (1) Euler generalized Thabit’s formulae as follows: If for g = 2n−β + 1 with some β, 0 < β < n, the numbers r1 = 2β g − 1, r2 = 2n g − 1 and s = (r1 + 1)(r2 + 1) − 1 = 2n+β g 2 − 1

(2)

are prime, then the numbers (1) are amicable, and this gives all amicable pairs of the form (1). For example, β = n − 1 gives Thabit’s rule. Euler’s generalization gives further amicable pairs for n = 8, β = 1, resp. n = 40, β = 29, as discovered by A. M. Legendre and P. Chebyshev, resp. by te Riele [252]. For various other algebraic methods due to Euler, see [187]. We note that a simple method, by the use of Diophantine equations was discovered earlier by F. van Schooten in 1657, but his method gives only the first three known pairs (see [84]). Euler’s methods enabled him to give a list of 30 new pairs. One of the Euler’s method (the third algebraic method) was discovered independently also by G. W. Kraft (1751), see [84], [187]. In 1968 E. J. Lee [186] discovered the so called ”BDE method” (i.e. Bilinear Diophantine Equation method). Given natural numbers a1 , a2 one may determine all amicable pairs of the form (3) a = a1 q, b = a2 s1 s2 where q, resp. s1 , s2 (s1 = s2 ) are primes not dividing a1 , resp. a2 , by solving a 61

CHAPTER 1

bilinear Diophantine equation on s1 , s2 as follows: Take any factorization of the number (4) ( f + d) f + dg = d1 d2 into two different natural factors d1 , d2 , where f := (σ (a1 ) − a1 )σ (a2 ), g := a1 σ (a1 ), d := a2 σ (a1 ) + a1 σ (a2 ) − σ (a2 )σ (a1 ) If then, for i = 1, 2,

si = (di + f )/d

(5)

(6)

are integers, prime, and prime to a2 , and if also q = σ (a2 )σ (a1 )−1 (s1 + 1)(s2 + 1) − 1

(7)

is prime, and prime to a1 , then we have an amicable pair (3), and this gives all such pairs. The idea of this method goes essentially back to Euler, who formulated, and extensively used it in several special cases, as did many authors later on. A new analogue of Thabit’s formula has been discovered in 1972 by W. Borho [28], and later by E. Borho and H. Hoffman [31]. We cite here the later result: Let n be a positive integer, and choose β, 0 < β < n, such that with g = 2n−β + 1, the number (8) r1 = 2β g − 1 is prime. Now choose α, 0 < α < n, such that p = 2α + (2n+1 − 1)g, r2 = 2n−α gp − 1 and s = (r1 + 1)(r2 + 1) − 1 = 2n−α+β g 2 p − 1

(9)

are also prime. Then a = 2n pr1r2 , b = 2n ps

(10)

are amicable pairs. For example, n = 2 and α = β = 1 give the amicable numbers a = 22 ·23·5·137, b = 22 · 23 · 827, discovered by other methods by Euler. A new analogue of Euler’s formula is contained in the following result ([31]): Let n, γ be positive integers with 0 < γ < n. Put either (i) C = 2n + 2γ , or (ii) C = 2n (2n+1 − 1) + 2γ (11) Take any factorization of C = f D into two positive factors f, D. Let p = D + 2n+1 − 1, r1 = p f − 1, r2 = (r1 + 1)2n−γ − 1 in case (i) 62

(12)

PERFECT NUMBERS

resp. r2 = 2n + f − 1, r2 = p(2n + f )2n−γ − 1 in case (ii)

(13)

s = (r1 + 1)(r2 + 1) − 1

(14)

Whenever the four numbers p1 , r1 , r2 , s are primes, then a = 2n pr1r2 , b = 2n ps

(15)

are amicable, and all amicable pairs (15) with p, r1 , r2 , s odd primes, are obtained in this way. For example, n = 8, γ = 7, f = 23 · 31 give Lee’s pair [186] a = 28 · 1039 · 503 · 1047311, b = 28 · 1039 · 527845247. In 1866 a 16-year old Italian school boy, N. I. Paganini found the small amicable pair (1184, 1210), which is not in the list by Euler (but he gave no indication of the method of discovery). (16) E. B. Escott was the most prolific discoverer of amicable numbers prior to the computer era. There were 390 known amicable pairs as of 1946, (see Escott [95]) and 219 of them were due to Escott. (17) H. L. Rolf [262] was the first (by using an exhaustive numerical method) to discover an amicable pair on a computer. He investigated all numbers less than 105

(18)

J. Alanen, O. Ore and J. Stemple [5] extended the numerical search to 106

(19)

discovering 8 new pairs. In 1970 H. Cohen [54] extended the range to 108 .

(20)

In 1984 te Riele [256] discovered a trick named ”daughter pair from mother pairs”, with a remarkable efficiency. This can be summarized as follows: take the inputs a1 , a2 from the list of already known amicable numbers (see the BDE-method (3)-(7)) (a, b) by splitting both numbers a, b into a = a1 v1 , b = a2 v2 , where vi (i = 1, 2) is either 1, or a large simple prime factor of a, b (v1 for a, v2 for b). From a list of known (”mother”)-pairs new (”daughter”) pairs can be computed. (21) For an improvement of te Riele’s trick, see the ”breeding” method by Borho and Hoffman [31]. 63

CHAPTER 1

te Riele [257] has found all 1427 amicable pair whose lesser members are less than 1010 (22) Moews and Moews found 3340 numbers less than 1011 (D. Moews, P. C. Moews [221]) and 5001 numbers less than 3 · 06 · 1011 (D. Moews, P. C. Moews [222]). In 1993 [258] te Riele discovered a new method similar to the Thabit-Euler-LeeBorho-Hoffman methods. In 1997 M. Garcia (see [325]) discovered a new amicable pair, each of whose members has 4829 digits. Probably this is momentary the largest known amicable pair. (23) The new pair has the form a = C M[(P + Q)P 89 − 1] b = C Q[(P − M)P 89 − 1]

(24)

where C = 211 · P 89 , M = 287155430510003638403359267, P = 574451143340278962374313859, Q = 136272576607912041393307632916794623. Note that P, Q, (P + Q)P 89 − 1 and (P − M)P 89 − 1 are all primes. During the first three months of the year 2001, M. Garcia has found over one million new amicable pairs (see his article ”A million new amicable pairs” from J. Integer Sequences (electronic) 4(2001), article 01.2.6). The earliest known amicable numbers all were divisible by 3. So P. Bratley and J. McKay [32] conjectured that there are no amicable pairs coprime to 6. However, S. Battiato and W. Borho [11] found a counterexample. (25) Today there are many known amicable pairs not divisible by 6 (see J. M. Pedersen [232]). (26) The first example of a pair coprime to 30 has been found by Y. Kohmoto (see [232]) in 1997, consisting of a pair of numbers each having 193 digits. (27) No amicable pairs which are coprime to 210 are currently known. (28) It is also not known, if there exist odd amicable pairs with one member, but not both divisible by 3. (29) A conjecture by Ch. Wall says that odd amicable pairs must be incongruent (modulo 4) (30) (see Guy [114], p. 57). It is not known whether or not there are an infinite number of amicable pairs. (31) 64

PERFECT NUMBERS

The first result in this direction is Kanold’s proof [166] in 1954 that the density of amicable pairs is ≤ 0, 204 (32) The fact that this density is zero, is due to P. Erdös [88]. Formulated more precisely, let B(x) = car d{(a, b) : a < b, a < x, (a, b) amicable pair} Then B(x) = o(x)

(33)

Erdös and G. J. Rieger [94] improved this to B(x) = O(x/ log log log x)

(34)

Finally, in 1981 C. Pomerance [241] deduced the strongest known estimates, namely B(x) ≤ x exp(−(log x)1/3 ) (35) resp. B(x) x exp(−c(log x log log x)1/3 )

(36)

Note that (35) has an interesting Corollary, not known before, namely that the sum of the reciprocals of the amicable numbers is finite. (37) Relatively prime amicable pairs are not known, (38) but conditions on their existence have been studied by O. Gmelin [109], H.-J. Kanold [163] and P. Hagis, Jr. [115], [116]. Hagis showed that there are no relatively prime amicable numbers with lesser member less than 1060

(39)

Gmelin proved that an even-odd amicable pair (a, b) must be of the form a = 2α A2 , b = B 2 , (A, B odd)

(40)

A. A. Gioia and A. M. Vaidya [108] show that A in (40) cannot be a square. (41) If in (40) α > 1, then A cannot be a prime ≡ 4 (mod 3)

(42)

B must be composite, and if α is odd, then (A, 3) = (B, 3) and there exists a prime q and a positive integer γ such that q γ ||B and q ≡ γ ≡ 1 (mod 3). 65

(43)

CHAPTER 1

If α ≡ 3 (mod 4), then there exists a prime p and a positive integer δ such that p ||B and δ

2p ≡ δ ≡ 2

(mod 5), and A ≡ B ≡

α+1 σ (A2 ) ≡ 0 4

(mod 5).

(44)

(42)-(44) are due to Gioia and Viadya, too. Kanold [164] proves that if α > 1 in (40), then a < b. (45) If α = 1 and a > b in (40), then b must contain at least five distinct prime factors. (46) Also, if a, b in (40) are relatively prime, then ab ≡ 2

(mod 24)

(47)

A corollary of (47) is the interesting fact that there are no relatively prime evenodd amicable pairs in which both members are perfect squares. (48) k If A in (40) is a pure prime power, then α = 1, and if we put M = p , then k > 6, ω(B) > 24, p ≡ 1 (mod 12), and a > b > 1075 . (49) Another result by Kanold states that if ω(a) = ω(b) = 2, then a and b cannot be an amicable pair. (50) Lee and Madachy [187] prove that if a (51) b 2 Borho [30] proved that the set of relatively prime amicable pairs a, b with ω(a)+ ω(b) ≤ K (where K is a given bound), is finite. (52) P. Hagis, Jr. [117] obtained the following results: Let a and b be relatively prime amicable pairs of opposite parity such that a < b and b even. Put 1 ( p prime) S= p p|ab If 5|ab, then S < 1.57549, while if 5 ab, then S < 1.59862. These bound are true also, if b < a, but a < 2b. If a, b are relatively prime amicables with opposite parity, then

(53) (54) (55)

S > 1.43151 if 5|ab;

(56)

S > 1.45382 if 5 ab.

(57)

In 1986 te Riele [257] found 37 pairs of amicable pairs (a, b) and (c, d) such that a+b =c+d 66

(58)

PERFECT NUMBERS

The first such pair is (609928,686072) and (643336,652664). Three such pairs were obtained in 1993 by Moews and Moews, while te Riele in 1995 obtained four pairs. In 1997 five, resp. six pairs have been discovered. Related to amicable numbers in special sequences or functions, we quote the following results: For any a, the numbers a and ϕ(a) (ϕ is Euler’s totient) cannot be amicable. (59) The same for a and (2b − 1)a + 1, where a, b > 1. (60) Results (59) and (60) are due to F. Luca [196]. Here an open question is stated too: for what value of a are a and a + 1 amicable? (they cannot be both perfect; see 4.(49)). (61) The Pell sequence (Pn ) is given by P0 = 0, P1 = 1, Pn+2 = 2Pn+1 + Pn for n ≥ 0. In [199] it is proved that there are no amicable Pell pairs. (62) The notion of amicable numbers (or pairs) has been studied also in certain other contexts. Unitary amicable numbers have been introduced by Hagis [118], and studied by him, and later by Garcia [106]. It seems that there are more than 100 such pairs. The first few are (114,126), (1140,1260), (18018,22302),... The largest known unitary amicable pair has its members with 192 digits, discovered by Y. Kohmoto [327]. We quote some theoretical results on unitary amicable pairs (a, b), i.e. satisfying ∗ σ (a) = σ ∗ (b) = a + b. For example, neither a nor b is of the form p α (prime power); they are of the same parity; if a = 2α M, b = 2β N , where β > α > 0 and M, N are odd integers having s, resp. t prime divisors, then s ≤ α and t ≤ α. (63) If a = 2M, b = 2N , where (10, M N ) = 1, then 10a and 10b also is a pair of unitary amicable numbers. If a and b are both squarefree, then (a, b) is unitary amicable pair iff it is an amicable pair. (63’) It is not known if there are an infinite number of unitary amicable pairs, or if there exists a such pair with relatively prime components. For the bi-unitary amicable numbers see another paper by Hagis [126]. Let (a, b) be a bi-unitary amicable pair, i.e. σ ∗∗ (a) = σ ∗∗ (b) = a + b. Then a and b must have the same parity. If a = 2α M, b = 2β N with M ≡ N ≡ 1 (mod 2), α < β, then ω(M) ≤ α, ω(N ) ≤ β. (64) As a corollary one gets that if a = 2M, b = 2β N with β > 1 and M, N odd, then M = p c , N = q d (prime powers). Suppose that a = m M, b = m N with (m, M) = (m, N ) = 1 and where every exponent in the prime factorization of M and N is odd. If σ ∗∗ (n)/n = σ ∗ (m)/m and (n, M) = (n, N ) = 1, then (n M, n N ) is a new bi-unitary amicable pair. (64’) There are sixty pairs of bi-unitary amicable pairs (a, b) with a < b and a ≤ 106 . The first examples are (114,126), (594,846), (1140,1260), (3608,3952), (4698,5382),...

67

CHAPTER 1

Let σ # (n) be the sum of nonunitary divisors of n. The numbers a and b are called nonunitary amicable (see [190]) if σ # (a) = b and σ # (b) = a.

(65)

All known nonunitary amicable pairs are even. In [129] Hagis proves that if (a, b) is a pair of odd nonunitary numbers, then a = M 2, b = N 2,

(66)

while if such a pair is even-odd, then a = 2α M 2 with M odd and α ≥ 1

(67)

Garcia (see [114], p. 59) has called a pair of numbers (a, b) quasi-amicable if σ (a) = σ (b) = a + b + 1

(68)

For example, (48,75), (140,195), (1575,1648), (1050,1925) are quasi-amicable pairs. Some authors use the ”betrothed numbers” terminology, but remarking that for a = b one reobtains from (68) the quasi-perfect numbers (see section 6), this one is more natural terminology. Hagis and Lord [136] have found all 46 pairs of quasi-amicable numbers with a < 107 , a < b. (69) All of them are of opposite parity. No pairs are known with a, b having the same parity. (70) Hagis and Lord prove that if a 1010 .

(71)

If (a, b) = 1 is a quasi-amicable pair, then ω(ab) ≥ 4,

(72)

while if (a, b) = 1 with a, b odd, then ω(ab) ≥ 21.

(73)

Finally, if (a, b) = 1 and a, b are of the same parity, then a and b are > 1030

(74)

The numbers a and b will be called almost-amicable if σ (a) = σ (b) = a + b − 1 68

(75)

PERFECT NUMBERS

Note that for a = b one reobtains the almost-perfect numbers (see section 6). Beck and Najar [12] (who call a, b satisfying (75) ”augmented amicable”, while for (68) they use the terminology ”reduced amicable”) found 11 almost-amicable pairs. (76) They found no unitary quasi or almost amicable pairs (a, b) such that a < b, b < 105 ,

(77)

i.e. satisfying (68), resp. (75) with σ ∗ in place of σ . Cohen [58] has introduced infinitary amicable numbers (see section 9 for infinitary divisors) a, b defined by σ∞ (a) = σ∞ (b) = a + b

(78)

Such pairs are e.g. (114,126), (594,846), (1140,1260), (4320,7920), (5940,8460), (8640,11760). He lists all infinitary amicable numbers (a, b) with a < b and a < 106 . There are 62 such pairs. (79) From the list it is interesting to remark that very often a and b have similar prime factorization, and Cohen asks for a motivation of this fact. (80) In an unpublished paper, I. Z. Ruzsa [265] called the numbers a and b lovely numbers if σ (a) = 2b, σ (b) = 2a (81) All lovely pairs (a, b) with a and b even are given by a = 2k (2q+1 − 1), b = 2q (2k+1 − 1)

(82)

where 2q+1 − 1 and 2k+1 − 1 are primes. Sándor [277] obtains a new proof of this result. He also proves that if (a, b) is a super-lovely pair, defined by σ (σ (a)) = 2b, σ (σ (b)) = 2a

(83)

with a and b even, then a = b, so one reobtains the even superperfect numbers (see section 7). The unitary, etc. analogue of lovely numbers are introduced in [278]. In 1913 Dickson [81] defined amicable triples (a, b, c) by σ (a) = σ (b) = σ (c) = a + b + c

(84)

After developing a theory analogues to Euler, he obtained eight sets of amicable triplets in which two of the numbers are equal, and two triples of distinct numbers (293 · 337a, 5 · 16561a, 993371a), resp. (3 · 89b, 11 · 29b, 359b) where a = 25 · 3 · 13, b = 214 · 5 · 19 · 31 · 151. 69

(85)

CHAPTER 1

A. Makowski [204] gave by other method new amicable triples, e.g. (22 · 32 · 5 · 11, 25 · 32 · 7, 22 · 32 · 71). In 1921 T. E. Mason [211] further generalized amicable numbers by introducing amicable k-tuples a1 , a2 , . . . , ak where σ (a1 ) = σ (a2 ) = · · · = σ (ak ) = a1 + a2 + · · · + ak

(86)

It is not known if there exist infinitely many such k-tuples (for any k ≥ 2). (87) Y. Kohmoto (see [114], p. 59) found an example of amicable 4-tuples (which he calls quadri-amicable numbers) with all of ai (i = 1, 4) not multiple of 3. (88) The smallest known amicable quadruple is (842448600, 936343800, 999426600, 1110817800). B. F. Yanney [329] defined a k-tuplet of amicable numbers a1 , . . . , ak by a1 + a2 + · · · + ak = (k − 1)σ (ai ) (i = 1, k). For k = 2 this definition coincides with that of Dickson. For k > 2, however the two definitions are distinct. E.g. a1 = 308, a2 = 455, a3 = 581 are a triplet of amicable numbers in the sense of Yanney, since σ (a1 ) = σ (a2 ) = σ (a3 ) = 672 and a1 + a2 + a3 = 2 · 672. C. W. Anderson and D. Hickerson [7] call the pair (a, b) a friendly pair, if a = b and σ (b) σ (a) = (89) a b For example, (6n, 28n) for (n, 42) = 1 are such pairs. A number a is called solitary if it doesn’t exist b = a such that (a, b) is a friendly pair (90) (i.e. a is a number ”without friends”). Clearly, if a = b are perfect numbers (i.e. σ (a) = 2a, σ (b) = 2b), then (a, b) satisfies (89). An odd solution is (135,819) or (33 · 5 · 7, 34 · 72 · 112 · 192 · 127); while a solution with a even, b odd is (42, 32 · 5 · 72 · 13 · 19).

(91)

M. G. Greening [7] shows that numbers n such that (n, σ (n)) = 1, are solitary. (92) There are 53 numbers less than 100, which are solitary, but there are some numbers, as 10, 14, 15, 20,... for which we cannot decide if they are solitary or not. (93) The density of friendly pairs is positive, first shown by Erdös [89]: the number of solutions of (89) satisfying a 0 is a constant (in fact C ≥ 8/147, see [7]). (94) 70

PERFECT NUMBERS

If (a, b) = 1 is a friendly pair, then (89) implies that a|σ (a), b|σ (b), so a and b are multiply perfect numbers (see section 5). It is not known if (89) has infinitely many solutions satisfying (a, b) = 1. (95) If a and b are squarefree, then (a, b) cannot be a friendly pair (see [89]). (96) The density of numbers a with friends is unity, (97) see [7]. R. D. Carmichael [45] called a pair (a, b) multiply amicable if σ (a) = σ (b) = k(a + b) for some positive integer k. (98) For k = 1 we obtain the classical amicable pairs. Mason [211] gives various multiply amicable pairs for k = 2 and k = 3. Cohen, Gretton and Hagis [60] called the integers a and b < a (α, β)-multiamicable if σ (b) − b = αa, σ (a) − a = βb, with α, β positive integers. They proved that b cannot have just one distinct prime factor, and if it has precisely two distinct prime factors, then α = 1 and b is even. For small α, β various (α, β)-multiamicable numbers have been tabulated. σ (a) M + αN N + βM Suppose that (a, M) = (a, N ) = 1 and = = . Then a σ (M) σ (N ) a M, a N are (α, β)-multiamicable. By applying this proposition, the authors have found 72 more multiamicable pairs. They proved also that the density of multiamicable numbers is zero. Cohen and te Riele [65] have studied multiple ϕ-amicable pairs (where ϕ is Euler’s totient). The pair (a, b) with 1 < a ≤ b is called ϕ-amicable pair with multiplier k (denoted as (a, b; k) if ϕ(a) = ϕ(b) =

a+b , for some integer k ≥ 1. k

(99)

The pair (a, b) is ϕ-amicable if there exists k with (99). In fact, it is easy to see that one must have k > 2. A ϕ-amicable pair (a, b; k) is called primitive if gcd(a, b) is squarefree and gcd(a, b; k) = 1.

(100)

Cohen and Riele have computed all ϕ-amicable pairs with b < 109 , and found 812 pairs for which the greatest common divisor is squarefree. Among them 499 are primitive. In fact with a ϕ-pair for which the g.c.d. is squarefree, infinitely many other ϕ-amicable pairs can be associated. (101) They proved the following general theorems: There are only finitely many primitive ϕ-amicable pairs with a given number of different prime factors. (102) 71

CHAPTER 1

Let (a, b; k) be ϕ-amicable, where ω(a) = r , ω(b) = s. Let p be the smallest prime divisor of ab, and put m = max{r, s}. Then p≤

k + 4m − 8 k−4

k + 2m − 2 p≤ k−2

with k ≥ 5, if the pair is even, (103) with k ≥ 3, if the pair is odd.

If (a, b; k) is a ϕ-amicable pair with (a, b) = 1, then k−1
1, there is no chain an 1 , an 2 , . . . , an k of period k in which (n 1 , . . . , n k ) = 1 and (n j , a) = 1, j = 1, k, a > 1. (4) 72

PERFECT NUMBERS

In 1918 P. Poulet (see [244]) discovered a chain of period 5, namely n = 12496 = 24 · 11 · 71, s(n) = 24 · 19 · 47, s (2) (n) = 24 · 967, s (3) (n) = 23 · 23 · 79, s (4) (n) = 23 · 1783, s (5) (n) = n

(5)

and another one of period 28 for n = 14316. (6) After a gap of 50 years, and the advent of high-speed computers, H. Cohen (see [114]) discovered nine cycles of period 4, and Borho [27], as well as David and Root (see [114]) also discovered some. (7) Moews and Moews [220] have made an exhaustive search for such cycles with greatest member less than 1010 . There are 24 such cycles. (8) They found also an 8-cycle. A. Flammenkamp [101] discovered a new 8-cycle, and one 9-cycle. (9) Moews and Moews [221] have continued to uncover all cycles, of any length, whose member preceding the largest member is less than 3.6 · 1010 . They found three more 4-cycles, and one 6-cycle, all of whose members are odd (for n = 21548919483 = 35 · 72 · 13 · 17 · 19 · 431). (10) No one found a 3-cycle, and it has been conjectured that such cycles do not exist. (11) On the other hand it has been conjectured that for each k there are infinitely many k-cycles (see [114]). (12) For new four-cycles, see [25] (where fifty new such cycles are found, bringing the total number of 4-cycles to 110). Related to Catalan’s conjecture (3), today we have experimental (and heuristic) arguments that some sequences go to infinity (see e.g. [251]). (13) Perhaps (13) holds true for almost all even n. D. H. Lehmer (see [114]) showed that the aliquot sequence {s (k) (138)} after reaching a maximum s (117) (138) = 2 · 61 · 929 · 1587569, terminated at s (177) (138) = 1. (14) Guy et al. (see [114]) used a program to discover that s (746) (840) = 601

(15)

and establishing a new record s (287) (840) for the maximum of a terminating sequence. Recently, M. Dickerman found a new record showing that s (583) (1248) reaches a 73

CHAPTER 1

maximum of a number of 58 digits, the period being 1075 for this number n = 1248. (16) For recent advances in aliquot sequences (of computational nature), see M. Benito and J. L. Varona [20]. In 1977 H. W. Lenstra [188] has proved that it is possible to construct arbitrarily long monotonic increasing aliquot sequences, i.e. for each k there is an n with n < s(n) < s (2) (n) < · · · < s (k) (n)

(17)

P. Erdös [91] proved that for all fixed k and δ > 0 and for all n, except a sequence of density zero one has

s(n) (1 − δ)n n

i

s(n) < s (n) < (1 + δ)n n (i)

i (18)

for i = 1, k.

s(n) s (i+1) (n) > − ε for i = 1, k (for each ε > 0 and k) has (i) s (n) n asymptotic density 1. (19) Erdös, Granville, Pomerance and Spiro [93] proved a similar result: for each ε > 0, the set of n with s (2) (n) s(n) < +ε s(n) n The set of n with

has asymptotic density 1. (20) Let S (k) (x) denote the number of odd integers m ≤ x, not in the range of the function s (k) . Then there is a δ > 0 such that S (k) (x) x 1−δ

(21)

uniformly for all positive integers k, and x > 0. The unitary aliquot sequences and unitary sociable numbers are defined similarly, by considering s ∗ (n) = σ ∗ (n) − n (22) where σ ∗ (n) denotes the sum of unitary divisors of n. The analogue of (17) holds true here, too, proved by te Riele [249]: for each k there is an n such that n < s ∗ (n) < s (2)∗ (n) < · · · < s (k)∗ (n)

(23)

but we do not know if there are unbounded unitary aliquot sequences, or not. (24) 74

PERFECT NUMBERS

te Riele pursued all unitary aliquot sequences for n < 105 . The only one which did not terminate or become periodic was 89610. Later calculations [250] showed that this reached a maximum at s ∗(568) (89610), and terminated at its 1129th term. (25) Unitary sociable numbers may occur rather more frequently than their ordinary counterparts. M. Lal, G. Tiller and T. Summers [185] found cycles of periods 3, 4, 5, 6, 14, 25, 39, 65. For example, (30,42,54) is a 3-cycle, while (1482,1878,1890,2142,2178) is a 5-cycle. Beck and Najar [13] considered the iterates of L ∗− (n) = s ∗ (n) − 1, and

(26)

L ∗+ (n) = s ∗ (n) + 1.

(27)

They introduce ”reduced unitary sociable numbers” by considering the iterations of L ∗− , and ”augmented unitary sociable numbers” by the same for L ∗+ . We shall call these in a more natural way as unitary quasi-sociable, resp. unitary almostsociable numbers, in accordance with the used terminologies in the case of perfect and amicable numbers. Beck and Najar showed by a computer search that there are no unitary almostsociable numbers n for n < 105 . (28) The same is true for unitary quasi-sociable numbers less than 110000

(29)

Recently, the calculations were lifted up to 109 , and one cycle has been obtained for both cases (see [219]). (30) Cohen [58] introduces in a similar manner infinitary sociable numbers. He finds eight infinitary aliquot cycles of order 4, three of order 6 and one of order 11. (31) This last is the only cycle of order less than 17 and least member less than a million. Y. Kohmoto (see [326]) has considered a generalization of the sociable numbers as follows. Let (a(n)) be a sequence defined by a(n) =

σ (a(n − 1)) . m

If this sequence becomes cyclic after k > 1 terms, it is then called an 1/msociable number of order k. It is easy to see that e.g. 2m−1 Mn and 2n−1 Mm are 1/2-sociable numbers of order 2, with Mn and Mm being distinct Mersenne primes. In [219] one finds certain remarks and numerical results for the bi-unitary, exponential cycles, as well as their quasi and almost variants. (32) 75

CHAPTER 1

Hagis [129] considered nonunitary aliquot sequences. A k-tuple of distinct natural numbers (n 0 , n 1 , . . . , n k−1 ) with n i = σ # (n i−1 ) (i = 1, k − 1) and n 0 = σ # (n k−1 ) is called a nonunitary k-cycle. (33) A search was made for all nonunitary k-cycles with k > 2 and n 0 ≤ 106 . A 3-cycle was found: (619368, 627264, 1393551) (34) An open question is whether or not unbounded nonunitary aliquot sequences exist. For generalized aliquot sequences, see te Riele [253]. For the iteration of various arithmetic functions, see [255]. Finally we mention two open problems, one due to Alaoglu and Erdös [3], the other one to Poulet [245]. Alaoglu and Erdös propose the question of whether or not the sequences: σ (n), σ (σ (n)), ϕ(σ (σ (n))), σ (ϕ(σ (σ (n)))), . . .

(35)

ϕ(n), ϕ(ϕ(n)), σ (ϕ(ϕ(n))), . . .

(36)

or converge to a periodic state, a fixed number, or tend to infinity for all n? Poulet conjectures that the sequence ( f k (n))k defined by f 0 (n) = n, f 2k+1 (n) = σ ( f 2k (n)), f 2k (n) = ϕ( f 2k−1 (n)) is eventually periodic, for all n. (37)

76

References [1] H. L. Abbott, C. E. Aull, E. Brown and D. Suryanarayana, Quasiperfect numbers, Acta Arith. 22(1973), 439-447; Errata: 29(1976), 427-428. [2] W. Aiello, G. E. Hardy and M. V. Subbarao, On the existence of e-multiperfect numbers, Fib. Quart. 25(1987), 65-71. [3] L. Alaoglu and P. Erdös, A conjecture in elementary number theory, Bull. A.M.S. 50(1944), 881-882. [4] L. B. Alexander, Odd triperfect numbers are bounded below by 1060 , (M. A. Thesis, 1984, East Carolina Univ.). [5] J. Alanen, O. Ore and J. Stemple, Systematic Computation of amicable numbers, Math. Comp. 21(1967), 242-245. [6] K. Alladi, On arithmetic functions and divisors of higher order, J. Austral. Math. Soc. (Ser. A) 23(1977), 9-27. [7] C. W. Anderson and D. Hickerson, Problem 6020, Amer. Math. Monthly 82(1975), 307. Comment by M. G. Greening and comments by the proposers in 84(1977), 65-66. [8] S. Asadulla, Even perfect numbers and their Euler’s function, Internat. J. Math. Math. Sci. 10(1987), no. 2, 409-412. [9] E. Bach, G. Miller and J. Shallit, Sums of divisors, perfect numbers and factoring, SIAM J. Comput. 15(1986), no. 4, 1143-1154. [10] E. Bach and J. Shallit, Algorithmic number theory, MIT, 1996. [11] S. Battiato and W. Borho, Are there odd amicable numbers not divisible by three? Math. Comp. 50(1988), 633-637. 77

CHAPTER 1

[12] W. E. Beck and R. M. Najar, More reduced amicable pairs, Fib. Quart. 15(1977), 331-332. [13] W. E. Beck and R. M. Najar, Fixed points of certain arithmetic functions, Fib. Quart. 15(1977), 337-342. [14] W. E. Beck and R. M. Najar, A lower bound for odd triperfect numbers, Math. Comp. 38(1982), 249-251. [15] E. Bedocchi, Perfect numbers in real quadratic fields, (Italian), Bolletino U.M.I. (5)15-A(1978), 94-103. [16] A. Bege, Fixed points of certain divisor functions, Notes Number Th. Discr. Math., 1(1995), no. 1, 43-44. [17] A. Bege, On multiplicatively unitary perfect numbers, Seminar on Fixed Point Theory, Cluj-Napoca, 2(2001), 59-63. [18] A. Bege, On multiplicatively bi-unitary perfect numbers, Notes Number Th. Discr. Math. 8(2002), 28-36. [19] M. Bencze, On perfect numbers, Studia Univ. Babes¸-Bolyai, 26(1981), 14-18. [20] M. Benito and J. L. Varona, Advances in aliquot sequences, Math. Comp. 68(1999), 389-393. [21] S. J. Benkovski, Problem E2308, Amer. Math. Monthly 79(1972), 774. [22] S. J. Benkovski and P. Erdös, On weird and pseudoperfect numbers, Math. Comp. 28(1974), 617-623; corrigendum. S. Krawitz, 29(1975), 673. [23] J. T. Betcher and J. H. Jaroma, An extension of the results of Servais and Cramer on odd perfect and odd multiply perfect numbers, Amer. Math. Monthly 110(2003), no. 1, 49-52. [24] S. J. Bezuska and M. J. Kenney, Even perfect numbers, The Math. Teacher 90(1997), 628-633. [25] K. Blamkenagel, W. Borho and A. vom Stein, New amicable four cycles, Math. Com., 72(2003), no. 244, 2071-2076 (electronic). ¨ [26] D. Bode, Uber eine Verallgemeinerung der vollkommenen Zahlen (Dissertation, Braunschweig 1971, 57 pp.). 78

PERFECT NUMBERS

¨ [27] W. Borho, Uber die Fixpunkte der k-fach itarierten Teilersummenfunktion, Mitt. Math. Gesellsch. Hamburg 9(1969), 34-48. [28] W. Borho, On Thabit Ibn Kurrah’s formula for amicable numbers, Math. Comp. 26(1972), 571-578. [29] W. Borho, Befreundete Zahlen, Ein Zweitausend Jahre altes Thema der elementaren Zahlentheorie, in: Lebendige Zahlen, Math. Miniaturen, vol. 1, Birkhäuser V., Basel, 1981. [30] W. Borho, Befreundete Zahlen mit gegebener Primteileranzahl, Math. Ann. 209(1974), 183-193. [31] W. Borho and H. Hoffman, Breeding amicable numbers in abundance, Math. Comp. 46(1986), 281-293. [32] P. Bratley and J. McKay, More amicable numbers, Math. Comp. 22(1968), 677-678. [33] A. Brauer, On the non-existence of odd perfect numbers of form 2 p α q12 . . . qt−1 qt4 , Bull. A.M.S., 49(1943), 712-718. [34] R. P. Brent and G. L. Cohen, A new lower bound for odd perfect numbers, Math. Comp. 53(1989), 431-437, S7-S24. [35] R. P. Brent, G. L. Cohen and H. J. J. te Riele, Improved techniques for lower bounds of odd perfect numbers, Math. Comp. 57(1991), 857-868. [36] S. Brentjes, Die ersten sieben volkommenen Zahlen und drei Arten befreundeter Zahlen in einem Werk zur elementaren Zahlentheorie von Ismal b. Ibrahim ibn Fallus, NTM Schr. Gesichte Natur. Tech. Medizin 24(1)(1987), 21-30. [37] S. Brentjes, Eine Tabelle mit volkommenen Zahlen in einer arabischen Handschrift aus dem 13 Jahrhundert, Nieuw Arch. Wiskunde (4)8(2)(1990), 239241. [38] D. A. Buell, On the computation of unitary hyperperfect numbers, Congr. Numer. 34(1982), 191-206. [39] E. A. Bugulov, On the question of the existence of odd multiperfect numbers (Russian), Kabardino Balkarsk Gos. Univ. Ucen. Zap. 30(1966), 9-19. 79

CHAPTER 1

1 1 + = 1, p N p/N pseudoperfect numbers and partially weighted graphs, Math. Comp. 69(1999), 407-420.

[40] W. Butske, L. M. Jaje and D. R. Mayernik, The equation

[41] D. Callan, Solution to Problem 6616, Amer. Math. Monthly 99(1992), 783789. [42] W. Carlip, E. Jacobson and L. Somer, Pseudo-primes, perfect numbers, and a problem of Lehmer, Fib. Quart. 36(1998), 361-371. [43] R. D. Carmichael, Annals of Math. (2)8(1906-7), 149; see also [84], p. 29. [44] R. D. Carmichael, A table of multiply perfect numbers, Bull. A.M.S. 13(1907), 383-386. [45] R. D. Carmichael, Review of History of the Theory of Numbers, Amer. Math. Monthly 26(1919), 396-403. [46] P. J. McCarthy, Odd perfect numbers, Scripta Math. 23(1957), 43-47. [47] P. J. McCarthy, Remarks concerning the nonexistence of odd perfect numbers, Amer. Math. Monthly 64(1957), 257-258. [48] P. J. McCarthy, Note on perfect and multiply perfect numbers, Portugal Math. 16(1957), 19-21. [49] E. Catalan, Propositions et questions divers, Bull. Soc. Math. France 16(188788), 128-129. [50] P. Cattaneo, Sui numeri quasiperfetti, Boll. U.M.I. (3), 6(1951), 59-62. [51] J. F. Z. Chein, An odd perfect number has at least 8 prime factors, Ph. D. Thesis, Pennsylvania State Univ., 1979. [52] L. Cheng, A result on multiply perfect number, J. Southeast Univ. (English Ed.) 18(2002), no. 3, 265-269. [53] E. Cohen, Arithmetical functions associated with the unitary divisors of an integer, Math. Z. 74(1960), 66-80. [54] G. L. Cohen, On amicable and sociable numbers, Math. Comp. 24(1970), 423429. 80

PERFECT NUMBERS

[55] G. L. Cohen, On odd perfect numbers (II), multiperfect numbers and quasiperfect numbers, J. Austral. Math. Soc. (Series A) 29(1980), 369-384. [56] G. L. Cohen, Even perfect numbers, Math. Gaz. 65(1981), no. 431, 28-30. [57] G. L. Cohen, The nonexistence of quasiperfect numbers of certain forms, Fib. Quart. 20(1982), no. 1, 81-84. [58] G. L. Cohen, On an integer’s infinitary divisors, Math. Comp. 54(1990), 395411. [59] G. L. Cohen, Numbers whose positive divisors have small integral harmonic mean, Math. Comp. 66(1997), 883-891. [60] G. L. Cohen, S. Gretton and P. Hagis, Jr., Multiamicable numbers, Math. Comp. 64(1995), 1743-1753. [61] G. L. Cohen and P. Hagis, Jr., Some results concerning quasiperfect numbers, J. Austral. Math. Soc. (Ser. A) 33(1982), 275-286. [62] G. L. Cohen and D. Moujie, On a generalization of Ore’s harmonic numbers, Nieuw Arch. Wiskunde 16(1998), no. 3, 161-172. [63] G. L. Cohen and H. J. J. te Riele, Iterating the sum-of-divisors function, Research Report R95-10, School of Math. Sci., Univ. of Techn., Sydney, 1995; CWI Report NM-R9525, CWI Amsterdam, 1995. [64] G. L. Cohen and H. J. J. te Riele, Iterating the sum-of-divisors function, Experimental Math. 5(1996), no. 2, 91-100. Errata in 6(1997), no. 2, 177. [65] G. L. Cohen and H. J. J. te Riele, On ϕ-amicable pairs, Math. Comp. 67(1998), no. 221, 399-411. [66] G. L. Cohen and R. M. Sorli, Harmonic seeds, Fib. Quart. 36(1998), 386-390. [67] G. L. Cohen and R. J. Williams, Extensions of some results concerning odd perfect numbers, Fib. Quart. 23(1985), 70-76. [68] J. T. Condict, On an odd perfect number’s largest prime divisor, Senior Thesis, Middleburg College, May, 1978. [69] J. S. McCranie, A study of hyperperfect numbers, J. Integer Sequences 3(2000), no. 00.1.3 (electronic). [70] J. S. McCranie, Personal communication dated nov. 11, 2001 to E. Weisstein. 81

CHAPTER 1

[71] J. T. Cross, A note on almost perfect numbers, Math. Mag. 47(1974), 230-231. [72] M. Crubellier and J. Sip, Looking for perfect numbers, History of Mathematics: History of Problems (Paris, 1997), 389-410. [73] A. Cunningham, Proc. London Math. Soc. 35(1902-1903), 40. [74] G. G. Dandapat, J. L. Hunsucker and C. Pomerance, Some new results on odd perfect numbers, Pacific J. Math. 57(1975), 359-364. [75] W. L. McDaniel, On odd multiply perfect numbers, Boll. U.M.I. (4) 3 (1970), no. 2, 185-190. [76] W. L. McDaniel, The non-existence of odd perfect numbers of a certain form, Arch. Math. (Basel), 21(1971), 52-53. [77] W. L. McDaniel, Perfect Gaussian integers, Acta Arith. 25(1973), 137-144. [78] W. L. McDaniel, An analogue in certain unique factorization domains of the Euclid-Euler theorem on perfect numbers, Internat. J. Math. Math. Sci. 13(1990), no. 1, 13-24. [79] S. Davis, A rationality condition for the existence of odd perfect numbers, Int. J. Math. Math. Sci. 2003, no. 20, 1261-1293 (electronic). [80] L. E. Dickson, Amer. Math. Monthly 18(1911), 109; see also [84], p. 30. [81] L. E. Dickson, Amicable number triples, Amer. Math. Monthly 20(1913), 8492. [82] L. E. Dickson, Finiteness of the odd perfect and primitive abundant numbers with n distinct prime divisors, Amer. J. Math. 35(1913), 413-422. [83] L. E. Dickson, Theorems and tables on the sum of the divisors of a number, Quart. J. Math. 44(1913), 264-296. [84] L. E. Dickson, History of the theory of numbers, Chelsea, vol. 1, 4th ed. 1999. [85] U. Dudley, Numerology, or what Pythagoras wrought, Washington D. C., 1997. [86] E. Ehrhart, Problem E3081, Amer. Math. Monthly 92(1985), p. 215, Solution by V. Pambuccian, same journal 94(1987), 794-795. [87] P. Erdös, On a Diophantine equation (Hungarian), Mat. Lapok 1(1950), 192210. 82

PERFECT NUMBERS

[88] P. Erdös, On amicable numbers, Publ. Math. (Debrecen), 4(1955), 108-111. [89] P. Erdös, Remarks on number theory, II, Some problems on the σ function, Acta Arith. 5(1959), 171-177. [90] P. Erdös, Some remarks on the iterates of the ϕ and σ functions, Colloq. Math., 17(1967), 195-202. [91] P. Erdös, On asymptotic properties of aliquot sequences, Math. Comp. 30 (1976), 641-645. [92] P. Erdös and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de l’Enseignement Mathématique, No. 28, Genève (p. 103). [93] P. Erdös, A. Granville, C. Pomerance and C. Spiro, On the normal behaviour of the iterates of some arithmetical functions, in: Analytic Number Theory, Allerton Park, 1989, Birkhäuser, Boston, 1990 (see pp. 165-204). [94] P. Erdös and H. J. Rieger, Ein Nachtrag u¨ ber befreundete Zahlen, J. Reine Angew. Math. 273(1975), 220. [95] E. B. Escott, Amicable numbers, Scripta Math. 12(1946), no. 1, 61-72. [96] L. Euler, De numeris amicabilibus, Nova Acta Eruditorum, Lipsiae, 1747, 2679; Comm. Arith. Coll. II, 1849, 637-8. [97] L. Euler, Opera postuma 1(1862), 88. [98] L. Euler, Opera postuma 1(1862), p. 14-15. [99] J. A. Ewell, On the multiplicative structure of odd perfect numbers, J. Number Th. 12(1980), 339-342. [100] J. Fabrykowski and M. V. Subbarao, On e-perfect numbers not divisible by 3, Nieuw Arch. Wiskunde (4)4(1986), 165-173. [101] A. Flammenkamp, New sociable numbers, Math. Comp. 56(1991), 871-873. [102] K. Ford, Math. Pages (Sublime numbers), http://www.mathpages.com/home/kmath202/kmath202.htm. [103] R. L. Francis, Problem 954, Mathematics Magazine 48(1975), 293, solution by R. E. Giudici in same journal 49(1976), 256. 83

CHAPTER 1

¨ [104] H. A. M. Frei, Uber unitar perfekte Zahlen, Elem. Math. 33(1978), 95-96. [105] M. Garcia, On numbers with integral harmonic mean, Amer. Math. Monthly 61(1954), 89-96. [106] M. Garcia, New unitary amicable pairs, J. Recreational Math. 17(1984-5), 3235. [107] J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput. 6(1977), 675-695. [108] A. A. Gioia and A. M. Vaidya, Amicable numbers with opposite parity, Amer. Math. Monthly 74(1967), no. 8, 969-973. ¨ [109] O. Gmelin, Uber Vollkommene und Befreundete Zahlen, Inaugural Diss. Heidelberg 1917, Saale, Halle, 1917. [110] I. S. Gradstein, Odd perfect numbers, Mat. Sb. 32(1925), 476-510. [111] S. W. Graham, Unitary perfect numbers with squarefree odd part, Fib. Quart. 27(1989), 317-322. ¨ [112] O. Grün, Uber ungerade vollkommene Zahlen, Math. Z. 55(1952), 353-354. [113] A. Grytczuk and M. Wojtowicz, There are no small odd perfect numbers, C. R. Acad. Sci. Paris Sér. Math. 328(1999), no. 12, 1101-1105. Errata: 330(2000), 533. [114] R. K. Guy, Unsolved problems in number theory, Springer-Verlag, New York, 1994 (2nd ed.). [115] P. Hagis, Jr., On relatively prime odd amicable numbers, Math. Comp. 23(1969), 539-543. [116] P. Hagis, Jr., Lower bounds for relatively prime amicable numbers of opposite parity, Math. Comp. 24(1970), 963-968. [117] P. Hagis, Jr., Relatively prime amicable numbers of opposite parity, Math. Mag. 43(1970), 14-20. [118] P. Hagis, Jr., Unitary amicable numbers, Math. Comp. 25(1971), 915-918. [119] P. Hagis, Jr., A lower bound for the set of odd perfect numbers, Math. Comp. 27(1973), 951-953. 84

PERFECT NUMBERS

[120] P. Hagis, Jr., Every odd perfect number has at least 8 prime factors, Notices Amer. Math. Soc. 22(1975), A-60. [121] P. Hagis, Jr., On the second largest prime divisor of an odd perfect number, in: Analytic number theory, Proc. Conf. Temple Univ., May 12-15(1980). [122] P. Hagis, Jr., Unitary hyperperfect numbers, Math. Comp. 36(1981), 299-301. [123] P. Hagis, Jr., Sketch of a proof that an odd perfect number relatively prime to 3 has at least eleven prime factors, Math. Comp. 40(1983), no. 161, 399-404. [124] P. Hagis, Jr., Lower bounds for unitary multiperfect numbers, Fib. Quart. 22(1984), 140-143. [125] P. Hagis, Jr., The third largest prime factor of an odd multiperfect exceeds 101, Bull. Malaysian Math. Soc. (2)9(1986), 43-49. [126] P. Hagis, Jr., Bi-unitary amicable and multiperfect numbers, Fib. Quart. 25(1987), 144-150. [127] P. Hagis, Jr., A systematic search for unitary hyperperfect numbers, Fib. Quart. 25(1987), no. 1, 6-10. [128] P. Hagis, Jr., Some results concerning exponential divisors, Intern. J. Math. Math. Sci. 11(1988), 343-349. [129] P. Hagis, Jr., Odd nonunitary perfect numbers, Fib. Quart. 28(1990), 11-15. [130] P. Hagis, Jr. and G. L. Cohen, Results concerning odd multiperfect numbers, Bull. Malaysian Math. Soc. (2)8(1985), 23-26. [131] P. Hagis, Jr. and G. L. Cohen, Infinitary harmonic numbers, Bull. Austral. Math. Soc. 41(1990), 151-158. [132] P. Hagis, Jr. and G. L. Cohen, Every odd perfect number has a prime factor which exceeds 106 , Math. Comp. 67(1998), no. 223, 1323-1330. [133] P. Hagis, Jr. and W. L. McDaniel, A new result concerning the structure of odd perfect numbers, Proc. Amer. Math. Soc. 32(1972), 13-15. [134] P. Hagis, Jr. and W. L. McDaniel, On the largest prime divisor of an odd perfect number, II. Math. Comp. 29(1975), 922-924. [135] P. Hagis, Jr. and G. Lord, Unitary harmonic numbers, Proc. A.M.S. 51(1975), 1-7. 85

CHAPTER 1

[136] P. Hagis, Jr. and G. Lord, Quasi-amicable numbers, Math. Comp. 31(1977), 608-611. [137] P. Hagis and D. Suryanarayana, A theorem concerning odd perfect numbers, Fib. Quart. 8(1970), 337-346. [138] K. Hanawalt, The end of a perfect number, Math. Teacher, 58(1965), 621-622. [139] J. Hanumanthachari, V. V. Subrahmanya Sastri and V. Srinivasan, On e-perfect numbers, Math. Student, 46(1978), no. 1, 71-80. [140] H. Harboth, Eine Bemerkung zu den vollkommenen Zahlen, Elem. Math. 31(1976), no. 5, 115-117. [141] M. Hausman, On norm abundant Gaussian integers, J. Indian Math. Soc. (N.S.) 49(1985), 119-123 (1987). [142] M. Hausman and H. N. Shapiro, On practical numbers, Comm. Pure Appl. Math. 37(1984), 705-713. [143] D. R. Heath-Brown, Odd perfect numbers, Math. Proc. Cambridge Philos. Soc. 115(1994), 191-196. [144] J. A. Holdener, A theorem of Touchard on the form of odd perfect numbers, Amer. Math. Monthly 109(2002), no. 7, 661-663. [145] J. A. Holdener, A generalization of Touchard’s theorem and the form of odd multiply perfect numbers, manuscript (2002). [146] B. Hornfeck, Zur Dichte der Menge der vollkommenen Zahlen, Arch. Math. (Basel) 6(1955), 442-443. [147] B. Hornfeck, Bemerkung zu meiner Note u¨ ber vollkomenen Zahlen, Arch. Math. (Basel) 7(1956), 273. ¨ [148] B. Hornfeck and E. Wirsing, Uber die Häufigkeit vollkommener Zahlen, Math. Ann. 133(1957), 431-438. [149] J. L. Hunsucker and C. Pomerance, There are no odd superperfect numbers less than 7 · 1024 , Indian J. Math. 17(1975), 107-120. [150] D. E. Iannucci, The second largest prime divisor of an odd perfect number exceeds ten thousand, Math. Comp. 68(1999), no. 228, 1749-1760. 86

PERFECT NUMBERS

[151] D. E. Iannucci, The third largest prime divisor of ann odd perfect number exceeds one hundred, Math. Comp. 69(2000), no. 230, 867-879. [152] D. E. Iannucci, Problem 10800, Amer. Math. Monthly 107(2000), 368. Solution by K.-W. Lau, same journal 109(2002), 304-305. [153] D. E. Iannucci and R. M. Sorli, On the total number of prime factors of an odd perfect number, Math. Comp., 72(2003), no. 244, 2071-2076 (electronic). [154] K. Ireland and M. Rosen, A classical introduction to modern number theory, Springer Verlag, 1982, Ch. 2. [155] P. M. Jenkins, Odd perfect numbers have a prime factor exceeding 107 , Math. Comp. 72(2003), no. 243, 1549-1554 (electronic). [156] R. P. Jerrard and N. Temperley, Almost perfect numbers, Math. Mag. 46(1973), 84-87. [157] L. Jones, Problem 10869, Amer. Math. Monthly 108(2001), 372; solution by F. Luca and L. Zhou in the same journal 110(2003), p. 160. [158] H.-J. Kanold, Untersuchungen u¨ ber ungerade vollkommene Zahlen, J. Reine Angew. Math., 183(1941), 98-109. [159] H.-J. Kanold, Verscharfung einer notwendigen Bedingung für die Existenz einer ungeraden volkommenen Zahl, J. für Math., 184(1942), 116-124. [160] H.-J. Kanold, Folgerungen aus dem Vorkommen einer Gauss’schen Primzahl in der Primfaktorzerlegung einer ungeraden Vollkommenen Zahl, J. Reine Angew. Math. 186(1944), 25-29. [161] H.-J. Kanold, Satze u¨ ber Kreisteilungspolynome und ihre Anwendungen auf einige Zahlentheoretische Probleme, J. für Math. 187(1950), 169-182; 188(1950), 129-146. ¨ [162] H.-J. Kanold, Uber ein spezielles System vom zwei diophantischen Gleichungen, J. Reine Angew. Math. 189(1952), 243-245. [163] H.-J. Kanold, Untere Schranken für Teilerfremde Befreundete Zahlen, Arch. Math. 4(1953), 399-401. ¨ [164] H.-J. Kanold, Uber befreundete Zahlen, II, Math. Nachrichten 10(1953), 243248. 87

CHAPTER 1

[165] H.-J. Kanold, Einige neure Bedingung für die Existenz ungerader vollkommenen Zahlen, J. Reine Angew. Math. 192(1953), 24-34. ¨ [166] H.-J. Kanold, Uber die Dichten der Mengen der vollkommenen und der befreundeten Zahlen, Math. Z. 61(1954), 180-185. ¨ [167] H.-J. Kanold, Uber einen Satz von L. E. Dickson, Math. Ann. 131(1956), 167179. ¨ [168] H.-J. Kanold, Uber einen Satz von L. E. Dickson, II, Math. Ann. 132(1956), 246-255. ¨ [169] H.-J. Kanold, Uber die Verteilung der vollkommenen Zahlen und allgemeinerer Zahlenmengen, Math. Ann. 132(1957), 442-450. ¨ [170] H.-J. Kanold, Uber das harmonische Mittel der Teiler einer natürlichen Zahl, Math. Ann. 133(1957), 371-374. ¨ [171] H.-J. Kanold, Uber ”super perfect numbers”, Elem. Math. 24(1969), 61-62. ¨ [172] H.-J. Kanold, Uber ”quasi-vollkommene Zahlen”, Abh. Braunschweig. Wiss. Ges. 40(1988), 17-20. ¨ [173] H.-J. Kanold, Uber eine neue Verallgemeinerung eines Satzes von L. E. Dickson, Arch. Math. (Basel), 54(1990), 448-454. [174] Gy. Kisgergely, The proof of Euler’s theorem on the even perfect numbers (Hungarian), Mat. Lapok (Budapest), 32(1981-1984), pp. 143-144. [175] M. Kishore, Quasiperfect numbers are divisible by at least six distinct divisors, Notices A.M.S. 22(1975), A-441. [176] M. Kishore, Odd integers n with five distinct prime factors for which 2 − 10−12 < σ (n)/n < 2 + 10−12 , Math. Comp. 32(1978), 303-309. [177] M. Kishore, On odd perfect, quasiperfect and almost perfect numbers, Math. Comp. 36(1981), 583-586. [178] M. Kishore, On odd perfect, quasiperfect and almost perfect numbers, Math. Comp. 36(1981), 583-586. [179] M. Kishore, Odd perfect numbers not divisible by 3, II. Math. Comp. 40(1983), 405-411. 88

PERFECT NUMBERS

[180] M. Kishore, Odd triperfect numbers are divisible by eleven distinct prime factors, Math. Comp. 44(1985), 261-263. [181] M. Kishore, Odd triperfect numbers are divisible by twelve distinct prime factors, J. Austral. Math. Soc. (Series A) 42(1987), 173-182. [182] S. Kravitz, A search for large weird numbers, J. Recreational Math. 9(197677), 82-85. [183] A. Krawczyuk, Uogólnienie problem Perisastriego, Prace Nauk. Inst. Mat. Fiz. Teoret. Pol. Woclaw No. 6(1972), 67-70. [184] U. Kühnel, Verschärfung der notwendigen Bedingungen für die Existenz von ungeraden vollkommen Zahlen, Math. Z. 52(1949), 202-211. [185] M. Lal, G. Tiller and T. Summers, Unitary sociable numbers, Proc. 2nd Manitoba Conf. Numerical Math. 1972, pp. 211-216. [186] E. J. Lee, Amicable numbers and the bilinear diophantine equation, Math. Comp. 22(1968), 181-187. [187] E. J. Lee and J. S. Madachy, The history and discovery of amicable numbers, I-III, J. of Recreat. Math. 5(1972), 77-93, 153-174, 231-249. [188] H. W. Lenstra, Problem 6064, Amer. Math. Monthly 82(1975), 1016. Solution by the proposer 84(1977), 580. [189] R. J. Levit, The non-existence of a certain type of odd perfect number, Bull. A.M.S. 53(1947), 392-396. [190] S. Ligh and Ch. R. Wall, Functions of nonunitary divisors, Fib. Quart. 25(1987), no. 4, 333-338. [191] J. L. Lightfoot, An early reference to perfect numbers? some notes on Euphorion SH417, Classical Quarterly 48(1998), 187-194. [192] E. Lionnet, Nouv. Ann. Math. (2)18(1879), 306-308. [193] G. Lord, Even perfect and superperfect numbers, Elem. Math. 30(1975), 8788. [194] F. Luca, Multiply perfect numbers in Lucas sequences with odd parameters, Publ. Math. Debrecen 58(2001), no. 1-2, 121-155. 89

CHAPTER 1

[195] F. Luca, Problem 10711, Amer. Math. Monthly, 99(1999), 166; solution by F. B. Coghlan, in the same journal 108(2001), 80-81. [196] F. Luca, Problem 10793, Amer. Math. Monthly 107(2000), 278, solution by N. Komanda in 109(2002), 206-207. [197] F. Luca, Perfect Fibonacci and Lucas numbers, Rend. Circ. Mat. Palermo Ser. II, 49(2000), 651-661. [198] F. Luca, Multiply perfect numbers in Lucas sequences, Publ. Math. (Debrecen), 58(2001), 121-155. [199] F. Luca, Amicable Pell numbers, Math. Pannonica 13(2002), 97-102. [200] F. Luca, On the product of divisors of n and σ (n), J. Ineq. Pure Appl. Math., 4(2003), no. 2, 1-7 (electronic). [201] L. Lucht, On the sum of exponential divisors and its iterates, Arch. Math. (Basel) 27(1976), 383-386. [202] H. Maier, On the third iterates of the ϕ and σ -functions, Colloq. Math. 49(1984), 123-130. [203] A. Makowski, Remarques sur les fonction θ (n), ϕ(n) et σ (n), Mathesis 69(1960), 302-303. [204] A. Makowski, On some equations involving functions ϕ(n) and σ (n), Amer. Math. Monthly 67(1960), 668-670; correction in 68(1961), 650. [205] A. Makowski, Remark on perfect numbers, Elem. Math. 17(1962), no. 5, 109. [206] A. Makowski, On two conjectures of Schinzel, Elem. Math. 31(1976), 140141. [207] A. Makowski and A. Schinzel, On the functions ϕ(n) and σ (n), Colloq. Math. 13(1964-65), 95-99. [208] M. Margenstern, Les nombres pratiques: théorie, observations et conjectures, J. Number Theory 37(1991), 1-36. [209] L. V. Marijo, Integer-perfect numbers, J. Natur. Sci. Math. 27(1987), no. 2, 33-50. [210] L. V. Marijo, On the order of ν(n), J. Natur. Sci. Math. 28(1988), no. 1, 165173. 90

PERFECT NUMBERS

[211] Th. E. Mason, On amicable numbers and their generalizations, Amer. Math. Monthly 28(1921), no. 5, 195-200. [212] G. Melfi, A survey on practical numbers, Rend. Sem. Mat. Univ. Politec. Torino, 53(1995), no. 4, 347-359. [213] G. Melfi, On two conjectures about practical numbers, J. Number Theory 56(1996), 205-210. [214] M. D. Miller, A recursively defined divisor function, Fib. Quart. 13 (1975), 199-204. [215] W. H. Mills, On a conjecture of Ore, Proc. Number Theory Conf., Boulder CO, 1972, 142-146. [216] D. Minoli, Issues in nonlinear hyperperfect numbers, Math. Comp. 34(1980), 639-645. [217] D. Minoli and R. Bear, Hyperperfect numbers, Pi Mu Epsilon J. 6(1975), no. 3, 153-157. [218] D. S. Mitrinović and J. Sándor, (in coop. with B. Crstici), Handbook of number theory, Kluwer Acad. Publ., 1995. [219] David Moews, http://xraysgi.ims.uconn.edu:8080/amicable.html. [220] D. Moews and P. C. Moews, A search for aliquot cycles below 1010 , Math. Comp. 57(1991), 849-855. [221] D. Moews and P. C. Moews, A search for aliquot cycles and amicable pairs, Math. Comp. 61(1993), 935-938. [222] D. Moews and P.C. Moews, http://xraysgi.ims.uconn.edu:8080/amicable2.txt. [223] J. B. Muskat, On divisors of odd perfect numbers, Math. Comp. 20(1966), 141-144. [224] K. Nageswara Rao, On some unitary divisor functions, Scripta Math. 28 (1967), 347-351. [225] M. L. Nankar, History of perfect numbers, Ganita Bharati 1(1-2)(1979), 7-8. [226] J. C. M. Nash, Hyperperfect numbers, Periodica Math. Hung. 45(1-2)(2002), 121-122. 91

CHAPTER 1

[227] D’Ooge (tr.), Nicomachus, Introduction to arithmetic, New York, 1926. [228] O. Ore, On the averages of the divisors of a number, Amer. Math. Monthly 55(1948), 615-619. [229] N. I. Paganini, Atti della R. Accad. Sc. Torino, 2, 1866-7, 362. [230] S. Pajunen, On primitive weird numbers, A collection of manuscripts related to the Fibonacci sequence, 18th anniv. vol., Fibonacci Assoc., 162-166. [231] J. M. Pedersen, Tables of aliquot cycles, http://amicable.adsl.dk/aliquot/infper.txt. [232] J. M. Pedersen, Known amicable pairs, http://www.rejlehs.dk/staff/jmp/aliquot/apstat.htm. [233] M. Perisasti, A note on odd perfect numbers, Math. Student, 26(1958), 179181. [234] B. M. Phong, Perfect numbers concerning Fibonacci sequence, Acta Acad. Paedagog. Agriensis Sect. Mat. (N.S.) 26(1999), 3-8(2000). [235] E. Picutti, Pour l’histoire des sept premiers nombres parfaits, Historia Math. 16(2)(1989), 123-136. [236] C. Pomerance, On a problem of Ore: Harmonic numbers, Abstract 709-A5, Notices Amer. Math. Soc. 20(1973), A-648. [237] C. Pomerance, Odd perfect numbers are divisible by at least seven distinct primes, Acta Arith. 25(1973/74), 265-300. [238] C. Pomerance, The second largest prime factor of an odd perfect number, Math. Comp. 29(1975), 914-921. [239] C. Pomerance, Multiply perfect numbers, Mersenne primes and effective computability, Math. Ann. 266(1977), 195-206. [240] C. Pomerance, Problem 6036, 82(1975), p. 671; and 84(1977), p. 225; solution by the University of British Columbia Problems Group, same journal, 85(1978), 830. [241] C. Pomerance, On the distribution of amicable numbers, II, J. Reine Angew. Math. 325(1981), 183-188. 92

PERFECT NUMBERS

[242] C. Pomerance, Problem 10331, Amer. Math. Monthly (1993), 796. Solution by U. Everling, same journal (1996), 701-702. [243] M. A. Popov, On Plato’s periodic perfect numbers, Bull. Sci. Math. 123(1999), 29-31. [244] P. Poulet, La chasse aux nombres, Fascicule I, Bruxelles, 1929. [245] P. Poulet, Nouvelles suites arithmétiques, Sphinx, 2(1932), 53-54. [246] M. Raghavachari, On the form of odd perfect numbers, Math. Student 34(1966), 85-86. [247] R. Rashed, Ibn al-Haytham et les nombres parfaits, Historia Math. 16(1989), 343-352. ¨ ¨ [248] H. Reidling, Uber ungerade mehrfach willkommene Zahlen, Osterreichische Akad. Wiss. Math.-Natur. 192(1983), 237-266. [249] H. J. J. te Riele, Unitary aliquot sequences, MR139/72, Math. Centrum Amsterdam, 1972. [250] H. J. J. te Riele, Further results on unitary aliquot sequences, NW12/73, Math. Centrum, Amsterdam, 1973. [251] H. J. J. te Riele, A note on the Catalan-Dickson conjecture, Math. Comp. 27(1973), 189-192. [252] H. J. J. te Riele, Four large amicable pairs, Math. Comp. 28(1974), 309-312. [253] H. J. J. te Riele, A theoretical and computational study of generalized aliquot sequences, MCT72, Math. Centrum, Amsterdam, 1976. [254] H. J. J. te Riele, Hyperperfect numbers with three different prime factors, Math. Comp. 36(1981), 297-298. [255] H. J. J. te Riele, Iteration of number theoretic functions, Report NN30/83, Math. Centrum, Amsterdam, 1983. [256] H. J. J. te Riele, On generating new amicable pairs from given amicable pairs, Math. Comp. 42(1984), 219-223. [257] H. J. J. te Riele, Computation of all the amicable pairs below 1010 , Math. Comp. 47(1986), 361-368. 93

CHAPTER 1

[258] H. J. J. te Riele, A new method for finding amicable pairs, in Proc. Sympos. Appl. Math. 43, Amer. Math. Soc., Providence, RI, 1994. [259] N. Robbins, The nonexistence of odd perfect numbers with less than seven distinct prime factors, Notices Amer. Math. Soc. 19(1972), A-52. [260] N. Robbins, Lower bounds for the largest prime factor of an odd perfect number which is divisible by a Fermat prime, J. Reine Angew. Math. 278/279(1975), 14-21. [261] D. F. Robinson, Egyptean fractions via Greek number theory, New Zeeland Math. Mag. 16(1979), 47-52. [262] H. L. Rolf, Friendly numbers, Math. Teacher, 60(1967), no. 2, 157-160. [263] A. Rotkiewicz, Remarque sur les nombres parfaits pairs de la forme a n ± bn , Elem. Math. 18(1963), no. 4, 76-78. [264] S. M. Ruiz, Smarandache’s function applied to perfect numbers, Smarandache Notions J., 10(1999), no. 1-2-3, 114-115. [265] I. Z. Ruzsa, Personal communication to J. Sándor. [266] E. Saias, Entiers a` diviseurd denses, I, J. Number Theory, 62(1997), no. 1, 163-191. ˇ at and J. Tomanová, On the product of divisors of a positive integer, [267] T. Sal´ Math. Slovaca 52(2002), no. 3, 271-278. ¨ [268] H. Salié, Uber abundante Zahlen, Math. Nachrichten 9(1953), 217-220. [269] J. Sándor, On Dedekind’s arithmetic function, Seminarul de teoria structurilor, no. 51, Univ. Timis¸oara, 1988, pp. 1-15. [270] J. Sándor, On the composition of some arithmetic functions, Studia Univ. Babes¸-Bolyai 34(1989), no. 1, 7-14. [271] J. Sándor, On even perfect and superperfect numbers (Romanian), Lucr. Semin. Didact. Mat. 8(1992), 167-168. [272] J. Sándor, A note on S(n), where n is an even perfect number, Smarandache Notions J., 11(2000), no. 1-2-3, 139. [273] J. Sándor, On an even perfect and superperfect number, Notes Number Theory Discr. Math. (Sofia), 7(2001), no. 1, 4-5. 94

PERFECT NUMBERS

[274] J. Sándor, Abundant numbers, in: M. Hazewinkel, Encyclopedia of Mathematics, Supplement III, Kluwer Acad. Publ., 2001 (see pp. 19-21). [275] J. Sándor, On multiplicatively perfect numbers, J. Ineq. Pure Appl. Math. 2(2001), no. 1 (electronic), 6 pp. [276] J. Sándor, On multiplicatively e-perfect numbers, (to appear). [277] J. Sándor, On Ruzsa’s ”lovely numbers”, (to appear). [278] J. Sándor, The unitary, etc. analogues of Ruzsa’s lovely numbers, in preparation. [279] J. Sándor and A. Bege, The Möbius function: generalizations and extensions, Adv. Stud. Contemp. Math. 6(2003), no. 2, 77-128. [280] M. Satyanarayana, Odd perfecr numbers, Math. Student, 27(1959), no. 1-2, 17-18. [281] A. Schinzel, Ungelöste Probleme Nr. 30, Elem. Math. 14(1959), 60-61. [282] A. Schinzel and W. Sierpinski, Sur certaines hypothèses concernant les nombres premiers, Acta Arith. 4(1958), 185-208; corrigendum, ibid., 5(1959), 259. [283] Cl. Servais, Sur les nombres parfaits, Mathesis, 8(1888), 92-93. [284] H. N. Shapiro, Note on a theorem of Dickson, Bull. A.M.S. 55(1949), 450-452. [285] H. N. Shapiro, On primitive abundant numbers, Comm. Pure Appl. Math. 21(1968), 111-118. [286] W. Sierpinski, Sur les nombres pseudoparfaits, Mat. Vesnik 2(17)(1965), 212213. [287] S. Singh, Fermat’s Enigma: the epic quest to solve the world’s greatest mathematical problem, New York: Walker, 1997. [288] T. N. Sinha, Note on perfect numbers, Math. Student, XLII, no. 3(1974), 336. [289] V. Sitaramaiah and M. V. Subbarao, On unitary multiperfect numbers, Niuew Arch. Wiskunde 16(1998), no. 1-2, 57-61. [290] V. Sitaramaiah and M. V. Subbarao, On the equation σ ∗ (σ ∗ (n)) = 2n, Util. Math. 53(1998), 101-124. [291] J. Slowak, Odd perfect numbers, Math. Slovaca 49(1999), 253-254. 95

CHAPTER 1

[292] R. Spira, The complex sum of divisors, Amer. Math. Monthly 68(1961), 120124. [293] A. K. Srinivasan, Practical numbers, Current science, 1948, pp. 179-180. [294] P. Starni, On the Euler’s factor of an odd perfect number, J. Number Theory 37(1991), 366-369. [295] P. Starni, Odd perfect numbers: a divisor related to the Euler’s factor, J. Number Theory 44(1993), 58-59. [296] R. Steuerwald, Verscharfung einer notwendigen Bedingung für die Existenz einer ungeraden volkommenen Zahl, S.-B. Math.-Nat. Abt. Bayer, Akad. Wiss. (1937), 68-72. [297] R. Steuerwald, Ein Satz u¨ ber natürliche Zahlen N mit σ (N ) = 3N , Archiv. der Math. 5(1954), 449-451. [298] B. M. Stewart, Sums of distinct divisors, Amer. J. Math. 76(1954), 779-785. [299] E. G. Straus and M. V. Subbarao, On exponential divisors, Duke Math. J. 41(1974), 465-471. [300] M. V. Subbarao, Are there an infinity of unitary perfect numbers? Amer. Math. Monthly 77(1970), 389-390. [301] M. V. Subbarao, Odd perfect numbers: some new issues, Periodica Math. Hungar. 38(1999), no. 1-2, 103-109. [302] M. V. Subbarao, T. J. Cook, R. S. Newberry and J. M. Weber, On unitary perfect numbers, Delta 3(1972), no. 1, 22-26. [303] M. V. Subbarao and L. J. Warren, Unitary perfect numbers, Canad. Math. Bull. 9(1966), 147-153. [304] D. Suryanarayana, On odd perfect numbers, II. Proc. A.M.S. 14(1963), 896904. [305] D. Suryanarayana, On odd perfect numbers. III, Proc. A.M.S. 18(1967), 933939. [306] D. Suryanarayana, The number of k-ary divisors of an integer, Monatsh. Math. 72(1968), 445-450. [307] D. Suryanarayana, Super perfect numbers, Elem. Math. 24(1969), 16-17. 96

PERFECT NUMBERS

[308] D. Suryanarayana, There is no odd super perfect number of the form p 2α , Elem. Math. 28(1973), 148-150. [309] D. Suryanarayana, Research problems # 22, Periodica Math. Hungar. 8(1977), 193-196. [310] J. J. Sylvester, Collected papers, 4(1912), 611-614. [311] J. Touchard, On prime numbers and perfect numbers, Scripta Math. 19(1953), 35-39. [312] H. S. Uhler, Full values of the first seventeen perfect numbers, Scripta Math. 20(1954), 240. [313] A. M. Vaidya, Comment on: ”History of perfect numbers”, Ganita Bharati 1(3-4)(1979), 22. [314] R. C. Vaughan, Adventures in arithmetic, or: how to make good use of a Fourier transform, Math. Intellig. 9(1987), no. 2, 53-60. [315] B. Volkmann, A theorem on the set of perfect numbers, Bull. A.M.S. 62(1956), Abstract 180. [316] R. W. Van der Waall, On a theorem of Leopoldt and on perfect numbers, Nieuw Arch. Wiskunde (3) 18(1970), 159-161. [317] S. Wagon, Perfect numbers, Math. Intellig. 7(1985), no. 2, 66-68. [318] Ch. Wall, Topics related to the sum of unitary divisors of an integer, Univ. of Tennessee, 1970. [319] Ch. R. Wall, A new unitary perfect number, Notices A.M.S. 16(1969), 825. [320] Ch. R. Wall, Bi-unitary perfect numbers, Proc. A.M.S., 33(1972), 39-42. [321] Ch. R. Wall, The fifth unitary perfect number, Canad. Math. Bull. 18(1975), 115-122. [322] Ch. R. Wall, On the largest odd component of unitary perfect numbers, Fib. Quart. 25(1987), 312-316. [323] Ch. R. Wall, New unitary perfect numbers have at least nine odd components, Fib. Quart. 26(1988), 312-317. [324] G. C. Webber, Nonexistence of odd perfect numbers of the form 2β 2β 2β 32β p α s1 1 s2 2 s3 3 , Duke Math. J. 18(1951), 741-749. 97

CHAPTER 1

[325] E. Weisstein, http://mathworld.wolfram.com/AmicablePair.html. [326] E. Weisstein, http://mathworld.wolfram.com/SociableNumbers.html. [327] E. Weisstein, http://mathworld.wolfram.com/UnitaryAmicablePair.html. [328] E. Wirsing, Bemerkung zu der Arbeit u¨ ber vollkommene Zahlen, Math. Ann. 137(1959), 316-318. [329] B. F. Yanney, Another definition of amicable numbers and some of their relation to Dickson’s amicables, Amer. Math. Monthly, 30(1923), 311-315. [330] A. and E. Zachariou, Perfect, semi-perfect and Ore numbers, Bull. Soc. Math. Grèce (N.S.) 13(1972), 12-22. [331] Perfect numbers and imperfect mathematicians (Persian), Bull. Iranian Math. Soc. 9(1)(1981/82), 84-79. [332] http://www.utm.edu/research/primes/mersenne/index.html.

98

Chapter 2

GENERALIZATIONS AND EXTENSIONS OF THE ¨ MOBIUS FUNCTION

2.1

Introduction

In this chapter we will survey many generalizations in Number theory of the Möbius function, as well as analogues functions which arose by the extensions of certain divisibility notions or product notions of arithmetical functions. Our study will include also Möbius functions in Group theory, Lattice theory, Partially ordered sets or Arithmetical semigroups. Sometimes references to applications will be pointed out, too. This is a refined and extended version of [164]. The classical Möbius function is defined by  

1, if n = 1 k (−1) , if n = p1 p2 · . . . · pk , pi distinct primes µ(n) =  0, if n is divisible by the squares of a prime

(1)

The function occurred implicitly in L. Euler ([67] paragraph 269) with the considerations of the ”Riemann zeta function” ∞ 1 −1 1 1− s = , ζ (s) = ns p p n=1 99

CHAPTER 2

and the reciprocal formula ∞ 1 1 µ(n) = 1− s = ζ (s) p ns p n=1

(2)

However, its arithmetical importance was first recognized by A. F. Möbius [143] in 1832, with the discovery of a number of inversion formulae. Möbius raised the following question: Given an arbitrary function f (z) and g(z) by ∞

g(z) =

an f (z n ),

(3)

n=1

express f (z) in terms of the functions g(z n ), say f (z) =

∞

bn g(z n ).

(4)

n=1

If f (z) = c1 z + c2 z 2 + . . . (i.e., a power series), this question may be treated as a problem in formal power series, and it is easily seen that (bn )n≥1 are obtained from the given coefficients (an )n≥1 by

ad b dn =

d|n

1, if n = 1 . 0, if n > 1

(5)

Equivalently, (5) can be written with the use of formal Dirichlet series as ∞ ∞ an bn n=1

ns

n=1

ns

= 1,

i.e. (an )n≥1 and (bn )n≥1 form Dirichlet inverse sequences. In particular, if an = 1 for all n, then bn = µ(n) by (1), and we have (formally) g(z) =

∞

f (z n ),

n=1

equivalent to f (z) =

∞

µ(n)g(z n ).

n=1

100

¨ THE MOBIUS FUNCTION

By setting f (e z ) = F(z) and g(e z ) = G(z), equations (3) and (4) take a more convenient form ∞ an F(nz), (6) G(z) = n=1

F(z) =

∞

bn G(nz)

(7)

n=1

respectively. The particular case an ≡ 1, bn ≡ µ(n) has a curious history, and a number of rediscoverers (e.g. by P. Tchebyschef in 1851 [203]; P. Bachman in 1894 [5] were unaware of Möbius’ paper). The notation µ(n) was first introduced in 1874 by F. Mertens. All these considerations were formal and questions of convergence were neglected. Surprisingly, the first rigorous treatment of these matters appeared only in 1936 and 1937 in works by E. Hille and O. Szász [108] and E. Hille [107]. They proved the following result: If an and bn are related by (5), and g(n) = where the double series

∞

am f (mn) (n = 1, 2, 3, . . . ),

(8)

m=1

ak bm f (kmn) is absolutely convergent, then

k,m ∞

f (n) =

bm g(mn)

(9)

m=1

This theorem leads to a symmetrical version of (6)-(7): The following two assertions are equivalent: (i)

g(n) =

∞

f (mn) (n = 1, 2, . . . )

(10)

m=1

and

∞

n ε | f (n)| < ∞ for some ε > 0;

n=1

(ii)

f (n) =

∞

µ(m)g(mn) (n = 1, 2, . . . )

m=1

and

∞

n ε |g(n)| < ∞ for some ε > 0.

n=1

101

(11)

CHAPTER 2

There is a need for caution here for the truth e.g. of (6)-(7) for general f and g 1 µ(m)g(mn) is identically (an = 1, bn = µ(n)). Put g(n) = ; then f (n) = n m f (mn). In the other direction, if f (n) = µ(n)/n, then zero, so that g(n) = m f (mn) is identically zero and again (6)-(7) fails. g(n) = m

The following remark by Andrew Lenard [2] has importance in Beurling’s approach to the Riemann hypothesis (see H. Bercovici and C. Foias¸ [12]. Let ∞ l(x) = (−1)n−1 L(nx), n=1

where L(x) =

∞

µ(n)K (nx),

n=1

equivalent (by (6)-(7)) to K (x) =

∞

L(nx) (x > 0)

n=1

Since l(x) = K (x) − 2K (2x), we get K (x) = l(x) + 2K (2x) = l(x) + 2l(2x) + 4K (4x) = · · · =

∞

2k f (2k x).

k=0

So, by the Möbius inversion formula ∞ l(x) = (−1)n−1 L(nx)

(12)

n=1

is equivalent to L(x) =

∞ ∞

2k µ(n)l(2k nx)

(13)

k=0 n=1

An improvement of corollary (10)-(11) has been obtained by J. H. Loxton and J. W. Sanders [138]: Suppose that the coefficients an are completely multiplicative (i.e. amn = am · an for all m, n, and a1 = 1), and that the series am f (mn) and am g(mn) are m

absolutely convergent. 102

m


Then g(n) =

∞

am f (mn)

(14)

µ(m)am g(mn)

(15)

m=1

is equivalent to f (n) =

∞ m=1

Another application of the equivalence of (6)-(7) is related to the inversion of Fourier transforms. The following result is due to R. R. Goldberg and R. S. Varga [78]. Let k : [0, R] → R (R > 0) be of bounded variation, and suppose that ∞ |k(u)| log udu < ∞ 1

and put

∞

K (t) =

k(u) cos tudu. 0

Then 1 H (t) = t

∞ nπ K (0) n (−1) K + 2 t n=1

is finite almost everywhere (0 < t < ∞), and k(t) =

∞

µ2n−1 H ((2n − 1)t)

(16)

n=1

almost everywhere for t ∈ (0, ∞). In [78] it is noted that a similar result was obtained by R. J. Duffin in 1941. The ”finite” form of the Möbius inversion formula n (17) f (d) ⇐⇒ f (n) = µ( d)g( ) g(n) = d d|n d|n was given simultaneously by R. Dedekind [60] and J. Liouville [136] in 1857. Certain Möbius function identities are important also in Sieve theory (see H. Halberstam and H.-E. Richert [84]). Identity (17) is a characteristic property of the Möbius function, see S. Swetharanyam [200] and U. V. Satyanarayana [169]. 103

CHAPTER 2

Interesting generalized Möbius inversion formulae have been obtained in 1963 by D. E. Daykin [58]. Relation (17) can be written also as g(n) = f (x) (d x = n) ⇔ f (n) = µ(e)g(y) (ey = n) for n ≥ 1. Let D, E, X, Y be non-empty sets of positive integers and let k : N → R be an arithmetic function. Given a pair ( f, g) of arithmetic functions, we define another pair (F, G) by the relations G(n) = f (x) (d x = n; d ∈ D, x ∈ X ), (18) F(n) = k(e)g(y) (ey = n; e ∈ E, y ∈ Y ) (19) Empty sums take the value 0. We say that (D, E, X, Y, k) form a Möbius system if, for all pairs ( f, g) of arithmetic functions satisfying f (n) = 0 (n ∈ X ) and g(n) = 0 (n ∈ Y )

(20)

F(n) = f (n) ⇔ G(n) = g(n)

(21)

one has

If A, B are sets of integers, let A · B denote the set of all products a ·b with a ∈ A, b ∈ B (i.e. Minkowski product). The following result is true ([58]): (D, E, X, Y, k) is a Möbius system iff both H (n) = δ(n), where H (n) = k(e) (de = n; d ∈ D, e ∈ E), (22) and X = Y = X · D = X · E.

(23)

A set C of integers is called a product set if C can be generated multiplicatively from a sequence (which could be finite, infinite, or empty) ( pi ) of pairly coprime positive integers, such that µ( pi ) = −1 for all i. We assume that empty products take the value 1, and that 1 is in every product set. Moreover, the trivial set {1} is a product set. The following generalization of the Möbius inversion formula holds true: Suppose that n ∈ D ⇔ n ∈ E whenever k(n) = 0

104

(24)


and that k(n) = 0 whenever n has a square factor. Then (22) holds iff D is a product set, D = E and k(n) = µ(n) for n ∈ D. Let D = {1, 2, 8}, E = {2α : α ≥ 0}, X = Y = N, k(1) = k(4) = 1, k(2) = −1, k(2α )+k(2α−1 )+k(2α−3 ) = 0 (α ≥ 3). Then (D, E, X, Y, k) is a Möbius system. If D is an isomorphic image of N = {1, 2, . . . } (which is a multiplicative semigroup) and k is the function induced by µ through the isomorphism, then (D, D, N, N, k) is a Möbius system. The particular case of the isomorphism i → i k (k fixed positive integer) has been considered by P. J. McCarthy [34]. For a generalization of an inversion formula due to Vinogradov, see R. T. Hansen [89]. A unified treatment of the Möbius inversion formula appears in H. Breitenfellner [21]. A difference-operatorial approach to the inversion formulae is given in L. C. Hsu [114]. We note that the Möbius function of a set of primes P was considered by A. Wintner in 1943 [220]. This is a multiplicative function µ P such that µ P ( p k ) = −1 for p ∈ P and k = 1 and 0, otherwise. Wintner proved that if 1/ p is divergent, then

∞

p∈P

µ P (n)/n = 0.

n=1

The formula (17) exemplifies the combinatorial nature of the Möbius function. In 1964 G. C. Rota [161] and his cowerkers have developed a general theory of Möbius function on partially ordered sets, which includes the principles of inclusionexclusion and Möbius inversion as special cases (but, as we shall see in the following sections, many ideas and results were anticipated by S. Delsarte [61] or R. Wiegandt [219]). For many results on various estimates, inequalities, as well as many related notions and functions (as the Mertens function M(x) = µ(n)) on the classical n≤x

Möbius function, see our Handbook I ([142]). This Chapter has, among many other things, also the aim to call the attention to many rediscoveries in the subject. But the main goal will be to survey the most important notions and results which involved the implications of Möbius type functions (1). We will survey many generalizations in Number theory of the Möbius function, as well as analogues functions which arose by the extensions of certain divisibility notions or product notions of arithmetical functions. Our survey will include also Möbius functions in Group theory, Lattice theory, Partially ordered sets or Arithmetical semigroups. Sometimes references to applications will be pointed out, too.

105

CHAPTER 2

2.2 1

Möbius functions generated by arithmetical products (or convolutions) Möbius functions defined by Dirichlet products

The Dirichlet product ”*” of two arithmetic functions f and g is defined by ( f ∗ g)(n) =

d|n

n f (d)g( ) d

(1)

where d | n denotes that d runs through all divisors d of n. The operation ”*” was considered as a binary operation on the set F of all arithmetical functions only at the beginning of the 20th century. M. Cipolla and E. T. Bell [10] proved first that (F, +, ∗) is an integrity domain. E. D. Cashwell and C. J. Everett [38] proved that this is in fact a factorial ring. Let F1 = { f ∈ F | f (1) = 0}, MF = { f ∈ F | f multiplicative and f ≡ 0}. It can be proved that (F1 , ∗) is a commutative group, while (MF, ∗) is a subgroup of this Abelian group. In what follows, we shall use more times the arithmetical functions defined by E k (n) = n k , E(n) = n, e(n) = 1

(n ∈ N)

(2)

and δ(n) =

1, n = 1 . 0, n > 1

(3)

Clearly e(n) = E 0 (n). By using the above group terminolgy, the inverse of the function e is exactly the Möbius function µ: (as δ is the unity element of this group: f ∗ δ = δ ∗ f = f ), e ∗ µ = µ ∗ e = δ. We note that for the classical arithmetical functions ϕ, σ, d (representing Euler’s totient, the sum of the divisors and the number of the divisors, respectively) we have ϕ = µ ∗ E, σ = E ∗ e, d = e ∗ e

(4)

or more generally Jk = µ ∗ E k , σk = E k ∗ e, dk = dk−1 ∗ e

(k ≥ 2)

(5)

where Jk is Jordan’s totient; σk is the sum of k-th powers of divisors; and dk is the Piltz divisor function (for more details, see e.g. [3], [90], [36], [177], [162]). 106


In 1963 in a little known paper, C. Popovici [151] introduced and studied a generalized Möbius function, defined by µk = µ ∗ µ ∗ . . . ∗ µ

(6)

k

where k ≥ 1. It is immediate, by induction that k (7) µk ( p ) = (−1) r k where the binomial coefficient = 0 for k < r . Popovici proved more properties, r e.g. that µk is multiplicative; µk−1 = µk ∗ e, etc. Certain combinatorial applications, group theoretical considerations, as well as extensions of (6) to other functions in place of µ, can be found in a paper by E. Schwab and E. D. Schwab [174]. In 1998 L. C. Hsuand J. Wang [115] rediscovered this function. By a generalized α binomial coefficient for complex number α, via (7) this Möbius function can be r extended, by r r α (8) µα ( p ) = (−1) r r

r

and the assumption that µα is multiplicative, i.e. µα (n) =

ν p (n)

(−1)

p|n

α ν p (n)

(9)

where ν p (n) denotes the power of the prime number p in the factorization of n. This definition, as well as the repetition of some known properties are included in a paper by T. C. Brown, L. C. Hsu, J. Wang and P. J-S. Shiue [23]. We note that in 1996 R. G. Buschman [25] has introduced also µk for a positive integer k, by another definition, namely as the Dirichlet inverse of the Piltz divisor function dk (in fact dk = µ−k ). He has remarked that Möbius generalized functions in this way were introduced also by E. D. Cashwell and C. J. Everett [38], and even by R Vaidyanathaswamy [210]. See also H. Scheid [170] and P. J. McCarthy [36]. More recent investigations by us reveal that µk was in fact first introduced in the literature in 1915 by A. Fleck [69]. For applications of µk in the theory of Diophantine Equations, see R. Tschiersch [208]. 107

CHAPTER 2

Extensions of µk by regular convolutions will be studied later. In 1968 D. Rearick [155] defined the k-th power of an arithmetic function by fk = f ∗ f ∗ ... ∗ f .

(10)

k

Clearly, for f = µ, by (6) one reobtains µk . Let A denote the set of all real valued arithmetic functions, and let P denote the subset of A consisting of arithmetical functions f with f (1) > 0. Rearick [155] defines the logarithm operator Log : P −→ A by Log f (1) = log f (1), n 1 Log f (n) = log d, f (d) f −1 f (n) d|n d

(n > 1)

(11)

where f −1 is the Dirichlet inverse of f . It can be proved that Log is a bijection of P onto A; therefore it is possible to define the exponential operator Exp : A −→ P,

Exp = Log−1 .

(12)

Let f ∈ P. The real power of f , i.e. f α (α ∈ R) is defined by f α = Exp(αLog f ).

(13)

Then, it can easily be shown that f −k = f −1 ∗ f −1 ∗ . . . ∗ f −1 k

where k is a positive integer. T. Caroll and A. A. Gioia [33] determined explicitely the powers f α of com1 1 pletely multiplicative functions for α = − and α = , and for positive rational 2 2 numbers α. In 1997 P. Haukkanen [97] proved the following surprising fact: If f is a completely multiplicative function, then f α = µ−α · f

(14)

for all real numbers α, where µ−α is the generalized Möbius function of (8), (9) (put ”−α” in place of ”α”).

108


For a recent application of the function µα , see V. Laohakosol, N. Pabhapote and N. Wechwiriyakul [130]. By applying (14), in [130] the following is proved: Let f be a nonzero multiplicative function and α a nonzero real number. Then f is completely multiplicative iff (µα f )−1 = µ−α f

(15)

For α = 1 this gives a result of T. M. Apostol (see [2], p. 49). Let us assume now that if α is a negative even integer, then f ( p −α−1 ) = f ( p)−α−1 for each prime p.

(16)

Let f be a nonzero multiplicative function and α ∈ R \ {0, 1}. Assuming condition (16), if f α = µ−α f, then f is completely multiplicative. (17) For details, see [130]. Finally note that the Dirichlet product of arithmetic functions can be extended to functions f (n 1 , . . . , n k ) of k variables: f (a1 , . . . , ak )g(b1 , . . . , bk ) ( f ∗ g)(n 1 , . . . , n k ) = (18) ajbj = n j j = 1, . . . , k The arithmetic function δk (n 1 , . . . , n k ) =

1, n 1 = . . . n k = 1 0, otherwise

is the identity element for this operation. In 1975 Paula A. Kemp [123] defined a Möbius function of n arguments, ∼

µ (n 1 , . . . , n k ) = µ(n 1 ) · · · µ(n k )

(19)

and proved an inversion theorem. The theory of such functions, however (including (19)) was first extensively studied by R. Vaidyanathaswamy [210] (see sec. 4 for (19)). See also a paper by M. V. Subbarao [191] (pp. 261-264).

109

CHAPTER 2

2

Unitary Möbius functions The unitary product of two arithmetical functions f, g ∈ F is defined by n ( f g)(n) = f (d)g d d|n

(20)

(d, dn )=1

n i.e. one consider a sum on divisors d of n with d, = 1. The idea of a such d convolution is due to R. Vaidyanathaswamy [210] again, but its extensive study was initiated by E. Cohen [47], [48]. It can be shown that (F, +, ) is a commutative ring with unity element, (F, ) is an Abelian group having as (MF, ) as a subgroup. The function δ is also the unity element, while the inverse of e will be denoted, by analogy, by µ∗ , as being the Möbius function. In fact µ∗ (n) = (−1)ω(n) ,

(21)

where ω(n) denotes the number of distinct prime divisors of n. By analogy with (4), one has ϕ ∗ = µ∗ e, σ ∗ = E e, d ∗ = e e, dk∗

=

∗ dk−1

(22)

e,

(k ≥ 2).

In [173] A. Schinzel proved that if f (1) = 1, the inverse function of f under the unitary convolution exists and is given by the formulae g(1) = 1 and g(n) =

ω(n) k=1

(−1)k

k

f (di ),

d1 d2 ···dk =n i=1

for n > 1, where ω(n) is the number of distinct prime factors of n. For many properties of these functions, we quote only E. Cohen [47], [48], M. V. Subbarao [191], D. Suryanarayana [194] [195], J. Chidambaraswamy [43], J. Sándor [162], J. Sándor and L. Tóth [166] (see also the monograph Mitrinović-Sándor-Crstici [142]). In 1971 E. M. Horadam [110] has extended Daykin’s Möbius inversion formula for unitary divisors. Let D, E be non-empty sets of positive integers. Let k be an arithmetic function such that k(n) = ±1 whenever n ∈ E. 110

(23)


Consider the statement H (n) = δ(n), where H (n) =

k(e)

(de = n, (d, e) = 1, d ∈ D, e ∈ E). (24)

A set C of positive integers is called a unitary product set if it can be generated multiplicatively from a finite or infinite set of positive integers ( pi ), mutually coprime. A general member of the set of generators will be denoted by pa(i) . If n ∈ C, αk α1 then n has the form n = pa(1) . . . pa(k) , but as we shall mainly be concerned with the evaluation of H (n), we shall take n = pa(1) . . . pa(k) . The unitary Möbius function of the set C is defined by µC∗ (1) = 1, µC∗ ( pa(i) ) = −1, and if n = pa(1) . . . pa(k) , then µC∗ (n) = (−1)k .

(25)

Now, related to the statement (24), the following is true: Suppose that (23) holds true. Then (24) is true if and only if D is a unitary product set, D = E, and k(n) = µ∗D (n) for all n ≥ 1.

3

(26)

Bi-unitary Möbius function

We introduce the bi-unitary convolution formula (see [100]). A divisor d > 0 of the positive integer n is called bi-unitary if the greatest common unitary divisor of n d and is 1. We denote by (a, b)1 the greatest unitary divisor of both a and b. The d bi-unitary product of two arithmetical function f, g ∈ F is defined by n . (27) ( f g)(n) = f (d)g d d|n (d, dn )1 =1

The properties of these convolutions appear in [100]. If we consider the greatest common bi-unitary divisor of a and b and denote by n (a, b)2 , we call d triunitary divisor of n if (d, )2 = 1. A. Bege introduced in [8] the d following generalization of Möbius’ function:  1, if n = 1  ∗∗ ∞ α p (28) µ (n) = pα − k  k=1 2 , if n > 1 (−1) pα n and proved the following inversion formula. If f, g ∈ F we have n g(n) = . f (d) ⇐⇒ f (n) = µ∗∗ (d)g d d|n d|n (d, dn )1 =1

(d, dn )1 =1

111

(29)

CHAPTER 2

4

Möbius functions generated by regular convolutions

The regular convolution will be a common generalization of the Dirichlet and the unitary product. Let A(n) be a subset of the set of positive divisors of n. The A-convolution of two arithmetic functions f and g is defined by

( f ∗ A g)(n) =

f (d)g

n

d∈A(n)

d

.

(30)

In 1963 W. Narkiewicz [145] defined an A-convolution to be regular if (a) the set of arithmetical functions forms a commutative ring with unity with respect to the ordinary addition and A-convolution; (b) the A-convolution of multiplicative functions is multiplicative; (c) the function e has an inverse µ A with respect to the A-convolution, and µ A (n) = 0 or −1 whenever n is a prime power. It is known that ([145]) an A-convolution is regular iff: (i) The conditions d ∈ A(n), m ∈ A(n) and d ∈ A(n),

n m ∈A d d

are equivalent; n (ii) d ∈ A(n) implies ∈ A(n); d (iii) {1, n} ⊆ A(n); (iv) A(mn) = {de | d ∈ A(m), e ∈ A(n)}, whenever (m, n) = 1; (v) for each prime power pa (a ∈ N) there exists a positive integer t = t A ( pa ) such that A( pa ) = {1, p t , p 2t , . . . , p st }, where st = a and p t ∈ A( p 2t ), p 2t ∈ A( p 3t ), . . . , p (s−1)t ∈ A( pa ). For example, the Dirichlet convolution D = ” ∗ ” will be obtained by D(n) = the set of all positive divisors ofn, while the unitary convolution U = ” ” follows n = 1}. It is immediate that these convolutions from U (n) = {d > 0 | d | n, d, d are regular. In what follows we shall assume that A is a regular convolution. The generalized Möbius function µ A is the multiplicative function (introduced by W. Narkiewiecz 112


[145]) given by µ A ( pa ) =

 

1, if a = 0 −1, if pa > 1 is A-primitive .  0, if pa is non A-primitive

(31)

We note that a positive integer n is said to be A-primitive, if A(n) = {1, n}. Let Ak (n) = {d ∈ N | d k ∈ A(n k )}. In 1978 V. Sita Ramaiah [178] considered Ak -convolutions. The corresponding Möbius function µ Ak therefore may be named as ”Sita Ramaiah’s Möbius function”. He proved that the Ak -convolution is regular whenever the A-convolution is regular. In 1995 L. Tóth [205] defined the notion of a ”cross-convolution”. Let A be a regular convolution. Then A is named as a cross convolution if for every prime p we have either t A ( pa ) = 1 ( i.e. A( pa ) = {1, p, p 2 , . . . , pa } ≡ D( pa ), for every a ∈ N), or t A ( pa ) = a ( i.e. A( pa ) = {1, pa } ≡ U ( pa ), for every a ∈ N). It follows by the work of Sita Ramaiah [178] that if A is a cross convolution, then Ak = A for every k. For arithmetical functions involving cross convolutions, see L. Tóth [206] and L. Tóth and J. Sándor [207]. Let now S be an arbitrary subset of N and A a regular convolution. Let S be the characteristic function of the set S, i.e. 1, if n ∈ S

S (n) = . 0, if n ∈ S P. Haukkanen [93] defined the Möbius function µ S,A by µ S,A ∗ A e = S ,

(32)

i.e.

µ S,A (d) = S (n).

d∈A(n)

If S = {1}, then µ S,A ≡ µ A -the Narkiewiecz Möbius function. We note that the function µ S,D (where D is the Dirichlet convolution) was introduced by E. Cohen in 1959 [46], and considered also by M. V. Subbarao and V. C. Harris [192]. 113

CHAPTER 2

Other interesting particular cases of the Haukkanen Möbius function appear in [93]. For example, let us define n to be a square with respect to the A-convolution if for each pa n (i.e. pa = 1, pa | n, pa+1 n), we have a = 2st, t = t A ( pa ). Now, if S is the set of all squares with respect to the A-convolution, then µ S,A = λ A , where 1, if n = 1 , λ A (n) = a1 +...+ar (−1) , if n = p1a1 t1 · · · prar tr with ti = t A ( piai ti ). We note that λ A is a generalized Liouville function. In [93] a generalized Ramanujan sum is considered, too. Following the paper [98] we say that an integer n > 1 is (A, r )-powerful if for each A-primitive prime power p t ∈ A(n) we have θ ( p t ) ≥ r and pr t ∈ A(n), where θ ( p t ) = sup{s ∈ N | t A ( p st ) = t}. Let A be a regular convolution. An arithmetical function f is said to be An whenever multiplicative (see K. L. Yocom [221]) if f ≡ 0 and f (n) = f (d) f d d ∈ A(n). An arithmetical function f is said to be A-rational function of order (s, r ) if there exist A-multiplicative functions f 1 , . . . , f s and g1 , . . . , gr such that f = f 1 ∗ A f 2 ∗ A . . . ∗ A f s ∗ A (g1 )−1 ∗ A (g2 )−1 ∗ A . . . ∗ A (gr )−1

(33)

This notion in case of A = D was introduced by R. Vaidyanathaswamy [210]. A combinatorial interpretation of a generalized Euler function, involving Arational arithmetic function, and the A-extensions of the Fleck-Popoviciu-BuschmanHsu-Wang Möbius function is contained in [99]: µ A,k = (µ A ) ∗ A (µ A ) ∗ A . . . ∗ A (µ A ) .

(34)

k

Another Möbius function µ B , which is an analogue of µ A appears in [99].

5

K -convolutions and Möbius functions. B convolution

The K -convolution or Davison-convolution of the arithmetical functions f and g is defined by n K (n, d), (35) ( f ◦ g)(n) = f (d)g d d|n where K is a complex valued function on the set of all ordered pairs (n, d) such that n is a positive integer and d is a positive divisor of n. The concept of K -convolution 114


originates to T. M. K. Davison [56] from 1966. In the case in which K (n, d) depends n only on the g.c.d. (d, ), the concept is due to A. A. Gioia [75] and A. A. Gioia and d M. V. Subbarao [76]. Further study of K-convolutions is included in M. Ferrero [68], I. P. Fotino [72], M. D. Gessley [74], P. J. McCarthy [35], P. Haukkanen [92]. It is known (see the above References) that the set MF of multiplicative arithmetical functions forms an Abelian group with identity with respect to the K convolution iff (a) K (n, n) = K (n, 1) = 1 for all n; (b) K (mn, de) = K (m, d)K (n, e) for all m, n, d, e such that d | m, e | n, (m, n) = 1; (c) K (n, d)K (d, e) = K (n, e)K

n d , e e

for all n, d, e such that d | n, e | d; (d) n K (n, d) = K n, d for all n, d with d | n. For example, the regular convolution by Narkiewcz satisfies (a)-(d). The k-th K -iterate of an arithmetical function f is defined by f (k) = f ◦ f ◦ . . . ◦ f

(36)

k

Clearly, this is a generalization of Möbius’ function considered in former paragraphs (see e. g. (10), (35)). Clearly f (k) (n) = f (a1 ) · · · f (ak )K (n, a1 )K (a2 · · · ak , a2 ) · · · K (ak−1 ak , ak−1 ) a1 a2 ···ak =n

(37) The inverse of an arithmetic function f with respect to the K -convolution is defined by f ◦ f (−1) = f (−1) = δ. The inverse exists and is unique iff f (1) = 0 (see [56]). 115

CHAPTER 2

In paper [94], among other results, the following is proved: Suppose f is an arithmetical function such that f (1) = 1. Then f (r ) is multiplicative iff f is multiplicative. Questions of ”quasi-multiplicativity” as well as ”semi-multiplicativity” are also considered (see also D. Rearick [154]). An interesting particular case, introduced in the book J. McCarthy ([36], p. by P. ν p (n) 168) is the so called ”binomial convolution”. For n = p|n p define the function B(n, d) as ν p (n) (38) B(n, d) = ν p (d) p|n a where ν p (n) denotes the power of the prime p in the canonical form of n, and b is a binomial coefficient. The binomial convolution follows from (35), when K ≡ B. In what follows, we shall use the notation ” ◦ ” = ” ◦ B ” and the binomial convolution will be called simply as the ”B-convolution”. We note, that the B-convolution shares many basic properties with the Dirichlet convolution. For example, the set of all arithmetic functions f with f (1) = 0 forms a group under the B-convolution, and the set of all multiplicative functions forms a subgroup of this group. On the other hand, the B-convolution has properties which differ from those of the Dirichlet convolution. A fundamental diference is that the Bconvolution preserves complete multiplicativity, while the Dirichlet product of two completely multiplicative functions generally is not completely multiplicative (but it is ”specially multiplicative” (see [36], p. 24 and [181])). The following interesting theorem is proved in [96]. We have f (n) = g(d)B(n, d) ⇐⇒ g(n) = f (d)λ(d)B(n, d). (39) d|n

d|n

where λ(n) = (−1) (n) is the Liouville function. This means that the inverse e−1 of the function e, related to a B-convolution, is the Liouville function. In other words, µ◦ B (n) = λ(n)

(40)

i.e. the Liouville function appears here as the Möbius function generated by the B-convolution. 116


The B-convolution has also an interesting connection to the convolution of sequences. It is well known that the binomial convolution of sequences (an )n≥0 , (bn )n≥0 is a sequence (cn )n≥0 given as n n ak bn−k cn = k k=0

(41)

(see R. L. Graham, D. E. Knuth and O. Patashnik [80], section 7.6). If f and g are multiplicative functions, then their binomial convolution f ◦ B g is completely determined by their values at all prime powers p n . For a fixed prime p, let f ( p n ) = an and g( p n ) = bn for all n ≥ 0. Then n n n f ( p k )g( p n−k ) = ( f ◦ B g)( p ) = k k=0 n n ak bn−k = cn = k k=0 This is similar to the connection between Dirichlet convolution and Cauchy product n

ak bn−k .

k=0

For related questiones, involving e.g. ”roots of sequences” under the Dirichlet and binomial convolution, see [95].

6

Exponential Möbius functions The exponential convolution was defined by M. V. Subbarao in 1972 [191] by  ( f ∗ex g)(1) = f (1)g(1)    nk (42) n1 d1 d d1  dk  ... f p1 · · · pk g p1 · · · pk k  ( f ∗ex g)(n) = d1 |n 1 d2 |n 2

dk |n k

where n = p1n 1 p2n 2 · · · pkn k is the prime factorization of n. It is immediate that this convolution is commutative n and associative. This is not . of Narkiewicz type, not being of the form f (d)g d d|n Subbarao proved the following results: 1) (F, ∗ex ) is a commutative semigroup with identity element |µ| (where µ is the classical Möbius function); 117

CHAPTER 2

2) The units of (F, ∗ex ) are those functions f for which f (n) = 0 whenever n is a product of distinct primes and f (1) = 0; 3) The semigroup (F, ∗ex ) has an infinity of zero divisors. An element f of F, ∗ex ) is a non zero divisor only if, given any finite number of primes p1 , . . . , pr , there exist coresponding positive integers a1 , . . . , ar such that f p1a1 · . . . · prar = 0; 4) (F, ∗ex ) has no nontrivial nilpotent elements. He also defined the exponential analogue µ(e) of the Möbius function as follows: µ(e) (1) = 1; µ(e) (n) = µ(a1 ) · . . . · µ(ar ),

(n > 1)

(43)

where n = p1a1 · . . . · prar . Then µ(e) is multiplicative and e-multiplicative (i.e. satisfies the functional equation f ( pab ) = f ( pa ) f ( p b ), for (a, b) = 1 and all primes p, where f is multiplicative). The exponential inverse of the function given by e(n) = 1, (n ∈ N) will be exactly µ(e) . Therefore f = g ∗ex e ⇐⇒ g = f ∗ex µ(e) .

(44)

Let now A be a regular convolution of Narkiewicz type. The exponential Aconvolution of the functions f and g has been introduced by J. Hanumanthachari [87] and K. Shindo [176]:  ( f ∗ Aex g)(1) = f (1)g(1)    nk n1 d d1  dk d1  ... f p1 · · · pk g p1 · · · pk k  ( f ∗ Aex g)(n) = d1 ∈A(n 1 ) d2 ∈A(n 2 )

dk ∈A(n k )

(45) where n = p1n 1 p2n 2 · · · pkn k is the prime factorization of n. Hanumanthachari proved that (F, ∗ Aex ) is a commutative semigroup with identity |µ|. Units are those functions f , for which f (γ (n)) = 0, where γ (n) = p1 p2 · · · pk is the greatest squarefree divisor (or the ”core”) of n. Further, it can be verified that the set of all exponentially multiplicative functions forms an Abelian 118


group under the exponential A-convolution. For example, the inverse of the function e is e−1 = µ(e) A , given by µ(e) A (1) = 1; µ(e) A (n) = µ A (n 1 ) · . . . · µ A (n k ),

(n > 1)

(46)

where n = p1n 1 · . . . · pkn k . Clearly, µ(e) A is multiplicative and exponentially multiplicative. For the exponential totient function, see J. Sándor [163], P. Haukkanen and P. Ruokonen [103] and for a survey of results, including properties on asymptotics, see Mitrinović-Sándor [142]. Exponentially A-multiplicative functions, as well as their Apostol type characterizations, appear in [103]. For example the following result is proved: An exponentially multiplicative function f is exponentially A-multiplicative (i.e. n f (γ (n)) = 0 and f ( p n ) = f ( p d ) f ( p d ) for all primes p and all d, n with d ∈ A(n)) iff f −1 = µ(e) A f,

(47)

where µa(e) is given by (46). For a notion and results related to strong regular A-convolution, see A. C. Vasu, V. V. Subrahmaya Sastri and C. S. Venkataraman [211].

7

l.c.m.-product (von Sterneck-Lehmer)

The von Sterneck-Lehmer, or l.c.m.-product, appeared in R. D. von Sterneck [190] and studied by D. H. Lehmer [131], is defined by f (k)g(m) (48) ( f g)(n) = [k,m]=n

where [k, m] denotes the l.c.m. of k and m. von Sterneck proved the following connection between l.c.m. product and Dirichlet product: ( f g) ∗ e = ( f ∗ e) · (g ∗ e)

(49)

where e(n) = 1, ∀n ∈ N, and ”·” is the pointwise product. From this relation directly follows that the l.c.m.-product of multiplicative functions is multiplicative. It can be verified that there exist non-trivial divisors of zero for this product. Let f be any function such that f (1) = 0 and let g = µ. In fact, H. Scheid [170] pointed out that it is easy to show that if f = δ, and f f = f, 119

CHAPTER 2

then f is a zero divisor. If however, (g ∗ e)(n) is non zero for all n, then from (49) it is an easy proof to show that f g = 0 ⇒ f = 0. Consequently, we can prove that if g is a non-negative function which has a Dirichlet inverse, then we have the cancellation property: f g = h g ⇒ f = h.

(50)

In order to state an inversion formula for the l.c.m. product, Lehmer [131] introduced the arithmetical function  if n = 1  1, r r Ms (n) = (51) {(ak + 1)s − aks }, if n = pkar  k=1

k=1

where s ∈ R. Ms is a common generalization of δ and e, since M0 = δ, M1 = e. In fact k Mk = e e . . . e = µ ∗ d (k ≥ 0),

(52)

k

see R. G. Buschman [29]. Lehmer proved the following inversion theorem of Möbius type: f = e g ⇐⇒ g = M−1 f.

(53)

This means that M−1 provides the ”Möbius function” analogue in the case of l.c.m. products: µ ≡ M−1 .

(54)

We note that M−1 can be written also as M−1 (n) =

r k=1

1 1 − ak + 1 ak

=

r

(−1)ω(n)

k=1

120

ak (ak + 1)


A list of l.c.m. products appears in [29]. We quote only the following interesting relations: f δ =

f

f µ =

f (1)µ

ϕ ... ϕ =

Jk

k

ϕ Jk

=

Jk+1

Mk Mm = Mk+m Jh Jk

=

Jh+k

∗

µ (d · λ) = λ.

8

Golomb-Guerin convolution and Möbius function

The Golomb-Guerin convolution will be defined as follows. Let F denote the set of elements of positive integers which are not perfect powers > 1 (thus 1 ∈ F). Any integer n ≥ 2, n = p1a1 · · · prar can be expressed as n = m g , where g = g.c.d.(a1 , . . . , ar ) and m ∈ F. In 1973 S. W. Golomb [79] defined the ”root function” r (n) equal the number of distinct representations n = a b , with a, b positive integers, and noted that r (n) = d(g) for n = m g , (m ∈ F, g ∈ N), with d denoting the number of distinct divisors. For two arithmetical functions f, g and n = m g , (n ∈ F, g ∈ N), E. E. Guerin [81] defined the G-convolution as  ( f ∇g)(1) = 1    (55) d g .   f m g md  ( f ∇g)(n) = d|g

Guerin [81] has proved the following result: (1) (F, +, ∇) is a commutative ring with unity δ∇ (where δ∇ (n) = 1 for n = 1 or n ∈ F; δ∇ (n) = 0 otherwise). (2) f is a unit in (F, +, ∇) iff f (1) = 0 and f (m) = 0 for all m ∈ F. (3) An arithmetic function f is a nondivisor of zero iff f (1) = 0 and for each m ∈ F there exists a positive integer g such that f (m g ) = 0. He also showed that the set of G-multiplicative functions (i.e satisfying f (1) = 1 and f (m ab ) = f (m a ) f (m b ) for m ∈ F, and (a, b) = 1) which are units in (F, +, ∇) form an Abelian group.

121

CHAPTER 2

Now, as usual, the inverse of e with respect to ∇ will be named a Möbius function. Put e∇µ∇ = δ∇ , i.e.

µ∇ (n) =

(56)

1, if n = 1 . µ(g), if n = m g (m ∈ F, g ∈ N)

(57)

This is the Guerin analogue of the Möbius function. Euler’s totient and the sum of divisors functions will be introduced as ϕ∇ (n) = (µ∇ ∇ E)(n) = g µ(d)m d (n = m g (m ∈ F, g ∈ N)), =

(58)

d|g

σ∇ (n) = e∇ E. It can be verified that ϕ∇ and σ∇ are not G-multiplicative functions.

9

max-product (Lehmer-Buschman) The Lehmer-Buschman or max product is defined by f (k)g(m) ( f ♦g)(n) =

(59)

max{k,n}=n

introduced by D. H. Lehmer [133]. Lehmer proved that the ♦ product is associative, commutative and has δ as the identity. There are nontrivial divisors of zero. A fundamental identity proved by Lehmer is ( f ♦g)#e = ( f #e) · (g#e),

(60)

where the product ”#” is defined by ( f #g)(x) =

k≤x

f (k)g

x k

,

(61)

which has a name ”Cauchy product”. There exists a useful identity which connects Dirichlet and # products (see T. M. Apostol [3], I. Niven-H. S. Zuckerman [148]): f #(g#h) = ( f ∗ g)#h. 122

(62)


As corollaries of (62) note that: (1) if f (1) = 0, then f #g = f #h ⇒ g = h; (2) if S is the greatest integer function f = e ∗ g ⇒ f #e = g#S; (3) f #(g#h) = g#( f #h). Left inversion does have the same form as the Dirichlet inversion, and it follows by the use of (62), but the order of factors is now important: f = e#g ⇐⇒ g = µ# f.

(63)

Right inversion is a different matter. We have f = g#e ⇐⇒ g = f,

(64)

where f (1) = f (1) and f (n) = f (n) − f (n − 1), (n ≥ 2). Since the inverse operator for the right #-multiplication by e is the difference operator , we can write another form for (60): ( f )♦(g) = ( f · g).

(65)

By manipulating with the operator and equation (65), we can derive the right inversion formula of Möbius type ([28]): f = e♦g ⇒ g = (E −1 )♦ f,

(66)

where (E −1 )(n) =

1 1 − , n n−1

(n > 1).

More generally, it can be proved [28]: f = e♦ . . ♦e ♦g ⇐⇒ g = (E −k ) ♦ f. .

(67)

k

Remark that letting in (66) f ≡ δ, we can deduce a ”right-Möbius function” µ♦ by µ♦ = (E −1 ) ♦δ. 123

(68)

CHAPTER 2

10

Infinitary convolution and Möbius function

The infinitary divisors have been introduced also in Chapter I (see paragraph 9). A slightly distinct introduction can be done via the I -components of a number. Let α I = { p 2 : p prime, α ≥ 0}. It is easy to see that n > 1 can be written in exactly one way (except the order of factors) as a product of distinct elements of I . We shall call each element of I in this product an I -component of n, and we shall say that d is an I -divisor of n if every I -component of d is also an I -component of n. We write d|∞ n for an I -divisor d of n. Suppose that n = P1 P2 . . . Pt , where P1 < P2 < · · · < Pt are the I -components of n. Put t = J (n) (let (J (1) = 0, by definition). The infinitary Möbius function µ∞ is given by (see G. L. Cohen and P. Hagis, Jr. [53]) µ∞ (n) = (−1) J (n) .

(69)

It is immediate that

µ∞ (d) = δ(n).

(70)

d|∞ n

The infinitary convolution of two arithmetic functions f and g is defined by n . (71) f (d)g ( f ∗ g)∞ (n) = d d|∞ n Then it follows that the set of arithmetic functions f with f (1) = 0 forms an abelian group with respect to the operation of infinitary convolution, with identity element δ, i.e. δ(n) = 1, n = 1, δ(n) = 0, n > 1. The following Möbius inversion formula holds true: n F(n) = µ∞ (d). f (d) ⇔ f (n) = F (72) d d|∞ n d|∞ n Another infinitary version of the Möbius functions appears in sequence A064179 of N. J. A. Sloane’s Encyclopedia [183].

11

Möbius function of generalized (Beurling) integers

A. Beurling [13] defined the so-called ”generalized integers” as follows: Suppose there is given a finite or infinite sequence of real numbers (”generalized primes”) such that 1 < p1 < p2 < . . . . From the set {l} of all possible p-products, i.e. products p1α1 . . . prαr with α1 , . . . , αr ≥ 0 integers of which all but a finite number are 0. Call 124


these numbers generalized integers and suppose that no two generalized integers are equal if there α’s are different. Suppose also that {l} may be arranged as an increasing sequence 0 < 1 = l1 < l2 < l3 < · · · < ln < . . .

(73)

Denote for simplicity ln = N , lr = R, ld = D etc. Then a notion of divisibility will follow by D|N iff ∃ = lδ : N = D

(74)

Let (R, S) denote the greatest common l-divisor of R = lr and S = ls . Similarly, (R, S)k denotes the greatest of the generalized integers, which are kth powers of generalized integers and which divide R and S. Therefore, if (R, S)k = 1, then R and S are k-prime to each other. E. M. Horadam [111], [112] defined the Möbius function of a generalized integer N as (−1)k , if N is squarefree among {l} (75) µ(N ) = 0, otherwise V. V. Subrahmanyasastri [193] has introduced the generalization µ(N 1/k ), if N is a kth power of a generalized integer, µk (N ) = 0, otherwise

(76)

By defining the convolution of two arithmetic functions defined on generalized integers by N ( f · g)(N ) = (77) f (D)g d D|N and using (75), as well as (76), Möbius-type inversion formulae can be deduced. Similarly, various totient functions or Ramanujan sums can be introduced and studied (see e.g. [111], [112], [193]). For a survey of solved and unsolved problems on generalized integers see E. M. Horadam [113].

12

Lucas-Carlitz (l-c) product and Möbius functions Let p be a prime and for the nonnegative integers n and r put n = n 0 + n 1 p + n 2 p2 + . . .

(0 ≤ n j < p),

r = r0 + r1 p + r2 p 2 + . . .

(0 ≤ r j < p).

125

CHAPTER 2

A famous theorem of E. Lucas [139] states that n0 n1 n2 n = . . . (mod p) r r0 r1 r2

(78)

n = Cnr is prime In particular, it follows from (78) that the binomial coefficient r to p if and only if 0 ≤ rj ≤ nj

( j = 0, 1, 2, . . . )

(79)

We accordingly define the Lucas-Carlitz product [31] by ( f ∗l−c g)(n) =

n ∗

f (r )g(n − r )

(80)

r =0

where the summation is restricted to those r that satisfy (79). Here f and g are arithmetic functions defined on the set of nonnegative integers. It is immediate from the definition that the l-c product is both associative and commutative; also it is distributive with respect to the usual addition of function. The function z(n) = 0 (n = 0, 1, . . . ) is the identity for addition, while the function δ modified to δ0 (n) = 1, n = 0; δ0 (n) = 0 if n > 0 becomes the multiplicative identity for (80). If f ∗l−c g = δ0 , we call g the inverse of f . The following theorem holds (see [31]): An arithmetic function f possesses an inverse if and only if f (0) = 0.

(81)

Particularly, the function e0 given by e0 (n) = 1 (n = 0, 1, 2, . . . ) satisfies the conditions, so has an inverse µl−c : e0 ∗l−c µl−c = δ0

(82)

If n = a0 + a1 p + · · · + ar pr (0 ≤ a j < p), it is easily verified that  if a = 0 r  1 r −1 if a = 1 and µl−c (n) = µl−c (a j p j ) µl−c (ap ) =  j=0 0 if a > 1

(83)

where 0 ≤ a < p. The following inversion theorem is valid: g(n) =

n ∗

f (r ) ⇔ f (n) =

r =0

n ∗ r =0

126

µl−c (r ) f (n − r ).

(84)


If m, n are defined by n = a0 + a1 p + · · · + ar pr (0 ≤ a j < p) and m = b0 + b1 p + · · · + br pr (0 ≤ b j < p) we define (m, n) p =

r

p j min{a j , b j }

(85)

j=0

An arithmetic function f is called factorable if f (0) = 1 and f (m + n) = f (m) f (n) for (m, n) p = 0.

(86)

For example, e0 and µl−c are factorable functions. Related to factorable functions the following general theorem holds true: Let h = f ∗l−c g. Then if any two of the functions f, g, h are factorable the third is also.

As a corollary one deduces that if g(n) =

n ∗

(87)

f (r ), then

r =0

f is factorable ⇔ g is factorable.

13

(88)

Matrix-generated convolution

In what follows we shall consider matrix-generated convolutions and corresponding Möbius functions. Suppose that G = (gi j ) is an infinite dimensional matrix having elements 0 and 1: gi j = 1 if i = j and gi j = 0 if i > j, and that the 1’s in column n of G appear in rows n 1 , n 2 , . . . , n k (n 1 < n 2 < · · · < n k = n). Let f, g be two arithmetic functions and define the convolution (see E. E. Guerin [82]) ( f ∗G g)(n) =

k

f (n i )g(n k+1−i ),

n = 1, 2, 3, . . .

(89)

i=1

generated by the matrix G. Clearly, ∗G is a commutative operation on the set of arithmetic functions. Let G n be the n × n submatrix of G = (gi j ) with 1 ≤ i ≤ n, 1 ≤ j ≤ n. Examples. 1) The matrix D = (di j ) with di j = 1 if i| j, di j = 0 otherwise, generates the Dirichlet convolution ∗ D . Here Dn is the n × n divisor matrix, and the set {n 1 , n 2 , . . . , n k } is the set of positive divisors of n. 2) The unitary convolution is generated by the matrix U = (u i j ) with u i j = 1 if i ≤ j, and i| j and i and j|i are relatively prime; u i j = 0 otherwise. 127

CHAPTER 2

3) The matrix C = (ci j ) defined by ci j = 1 if i ≤ j, ci j = 0 otherwise, generates a convolution ∗C related to the Cauchy product. Since {n 1 , n 2 , . . . , n k } = {1, 2, . . . , n}, we have ( f ∗C g)(n) = f (1)g(n) + f (2)g(n − 1) + · · · + f (n)g(1). 4) For j−1a fixed prime p, let the matrix L = (li j ) be defined by li j = 1 if i ≤ j , li j = 0 otherwise. The convolution ∗ L generated by L is related to the and p i−1 Lucas-Carlitz product. Define a general Möbius function µG by e ∗G µG = δ

(90)

where, as usual e(n) = 1 for all n and δ(n) = 1 if n = 1, = 0, n > 1. It is immediate −1 from G −1 n G n = In (the n × n identity matrix) that if G n = (g i j ), then g i j = µ( j)

(91)

for j = 1, 2, . . . , n (where µ is the classical Möbius function). For example, the elements in row one of D6−1 (see Example 1 above) are µ D (1) = µ(1), µ(2), . . . , µ(6) (in that order). Define now two arithmetic functions A and B by A(n) =

n

gin f (i),

B(n) =

i=1

n

g in g(i).

(92)

i=1

Now suppose that G and ∗G satisfy the following two properties: (i) f ∗G δ = f for all arithmetic functions f ; (ii) ∗G is an associative operation on the set of arithmetic functions (E.g. in Examples 1)-4) properties (i) and (ii) are valid). As from (92) one has A = e ∗G f and by (i), (ii) ( f ∗G g)(n) = ( f ∗G e ∗ B)(n), so g(n) = (e ∗G B)(n) ⇔ B(n) = (g ∗ µG )(n)

(93)

which is a Möbius inversion formula. For details, see [82]. We stop here the consideration of various convolution products. We note that other convolutions are included in the references (e.g. semi-unitary product [43], Lehmer ψ-product [132], [179], [147], partial product [26], integral product [27], convolutions with unbounded unity [180], etc.). 128


2.3 1

Möbius function generalizations by other number theoretical considerations Apostol’s Möbius function of order k

Möbius functions of order k, introduced by T. M. Apostol [2] in 1970 are defined by the formulas  1, if n = 1,     0, if p k+1 | n for some p, prime αi k r k (1) µk (n) = (−1) , if n = p1 · · · pr pi , with 0 ≤ αi < k,   i>r   1, otherwise. Among other results (e.g. µk is multiplicative) Apostol obtained an asymptotic formula like 1 µk (n) = Ak x + O(x k log x), (2) n≤x

2 1 1 − k + k+1 . Ak = p p p

where

By assuming the Riemann hypothesis, D. Suryanarayana [196] showed that, the error term in (2) can be improved to 4k (3) O x 4k 2 +1 f (x) , where

f (x) = exp{A log x(log log x)−1 }

for some positive constant A. A further generalization of the Apostol function has been provided by A. Bege [9], who considered the application  1 if n = 1,     1 if p k n for each prime p, m r m µk,m (n) = (4) (−1) if n = p · · · p piαi , with 0 ≤ αi < k, r 1   i>r   0 otherwise. We remark that if m = k, µk,k (n) = µk (n). A. Bege [9] proved for x ≥ 3 and m > k ≥ 2 the following asymptotic result: xn 2 αk,m 1 + 0 θ (n)x k δ(x) . µk,m (r ) = (5) ζ (k)ψk (n)αk,m (n) r ≤x (r,n)=1

129

CHAPTER 2

uniformly in x, n and k, where 1− αk,m = p

and αk,m (n) = n

1 p m−k+1 + p m−k+2 + · · · + p m

1−

p|n

;

1 p m−k+1 + p m−k+2 + · · · + p m

;

θ (n) = d ∗ (n) = the number of square-free divisors of n; ψk (n) = n

p|n

1 1 1 + + · · · + k−1 ; p p

where k is an integer ≥ 2, 3

1

δ(x) = exp {−A log 5 x (log log x)− 5 }, with A > 0 an absolute constant. By assuming that the Riemann hypothesis is true, the following asymptotic formula holds xn 2 αk,m 2 + 0 θ (n)x 2k+1 f (x) . µk,m (r ) = (6) ζ (k)ψk (n)αk,m (n) r ≤x (r,n)=1

uniformly in x, n and k, with f (x) = exp {A log x (log log x)−1 }, (A > 0). A main ingredient in the proof is the identity µ(d) qk (δ) µk,m (n) =

(7)

δd m =n (d,δ)=1

where k ≤ m, µ is the classical Möbius function and qk is the characteristic function of the k-free integers.

2

Sastry’s Möbius function

A somewhat similar Möbius generalization has been considered by K. P. R. Sastry [167]. If n = ri=1 piαi , let  1, if n = 1,  0, if n contains a k-th power divisor (8) µk (n) =  (−1)α1 +α2 +...+αr otherwise 130


Clearly, µ2 (n) = µ(n). This function is multiplicative, and the sum Sk (n) = µk (d) d|n

has the property:

Sk ( p α ) =

 0,     

if (i) α < k for k odd if (ii) α ≥ k for k even (9)

  1,   

if (i) α < k for k even if (ii) α ≥ k for k odd

As a corollary one obtains that Sk (n) vanishes iff one of the following holds: (i) n > 1 and admits a kth power divisor, and k is even, (ii) n > 1, k is odd and at lest one αi < k, and k is odd, (iii) n > 1 and does not admit a kth power divisor, and one of αi is odd

(10)

In every other case one has Sk (n) = 1.

(11)

For the sum µk (n) for k = 1, 2, . . . , m one has m 0, if µm (n) = 0, µk (n) = αi (m − l + 1) if µl−1 (n) = 0, µl (n) = 0 and l ≤ m (−1) k=1 The Dirichlet series of this function is   ζ (2s) · 1 , ∞ µk (n)  ζ (s) ζ (ks) =  ns  ζ (2s) · ζ (ks) , n=1 ζ (s) ζ (2ks)

(12)

for k even .

(13)

for k odd

Another property is related to the sum r n βi i=1 µk k = (−1) , d d k |n

where αi ≡ βi (mod k) and 0 ≤ βi < k (1 ≤ i ≤ r ). Particularly, if k is even,  r   1, if αi =even    i=1 n  . µk k =  d r  d k |n    αi =odd.  −1, if i=1

131

(14)

(15)

CHAPTER 2

3

Möbius functions of Hanumanthachari and Subrahmanyasastri

In 1978 J. Hanumanthachari and V. V. Subrahmanyasastri [88] introduced a Möbius function µs (M, N ) as follows: Let s and M be any two positive integers; then for any positive integer n define µs (M, N ) =

0, (−(s + λ( p)),

if N has a square factor , otherwise

(16)

p|N

where, for any prime p, λ( p) = λ(M, p) is the number of k ∈ {1, 2, . . . , s} for which (M − k + j, p) = 1 for each j ∈ {1, 2, . . . , s}. In fact, this new Möbius function arises in perceiving an extended Nagell totient function θs (M, N ) in the light of the definition of a totient function of Vaidyanathaswamy [210]: The Dirichlet product of a totally multiplicative function and the inverse of another totally multiplicative function is called a totient. When s = 1, we get the function µ1 (M, N ) ≡ µ(M, N ) =

0, N (−1)ω( m ) · (−2)ω(m) ,

if N has a square factor , otherwise (17)

where ω(m) denotes the number of distinct prime factors of m; m being the greatest divisor of N relatively prime to M. When M ≡ 0 (mod N ); (16) reduces to µs (N ) =

0, (−s)ω(N ) ,

if N has a square factor , otherwise

(18)

and this reduces to the classical Möbius function when s = 1. Denote the Jordan-Nagell totient function by θ (s) (M, N ), equal to the number of ordered s-tuples < x1 , . . . , xs > with x j (mod N ), j ∈ {1, . . . , s} such that ((x j ), N ) = 1 and ((M j − x j ), N ) = 1, where (r j ) denotes the greatest common divisor of (r1 , . . . , rs ). This is given by θ (M, N ) = N s

s

p|(M,N )

1 1− s p

p|N

pM

132

2 1− s p

.

(19)


The Schemmel-Nagell totient, denoted by θs (M, N ) is equal to the number of stuples of consecutive integers < x + 1, x + 2, . . . , x + s > with x (mod N ) such that (x + j, N ) = (M − j − (x + j), N ) = 1,

j ∈ {1, . . . , s}.

One can see that θs (M, N ) = 0 if s is greater or equal than any prime factor of N ; otherwise it is given by s + λ( p) . (20) 1− θs (M, N ) = N p p|N When s = 1, θ (1) (M, N ) = θ1 (M, N ) = θ (M, N ) is Nagell’s totient [181]. When N | M, θ (s) (M, N ) and θs (M, N ) reduce to Jordan’s totient Js (N ) and Schemmel’s totient Ss (N ) [181], respectively. Obviously, µs (M, N ) is multiplicative in N . Other properties include: N = e(n), (21) µs (M, d) · M, d d|N where

(M, N ) = 2 (M) , m being the greatest divisor of N , relatively prime to M, and (m) = total number of prime factors of m; N ; (22) dµs M, θs (M, N ) = d d|N (s)

θ (M, N ) =

d µs s

d|N

µ(M, N ) =

N M, d

µ(γ (d))µ

d|N

N d

;

(23)

,

(24)

(d,M)=1

where γ (N ) denotes the largest squareefree divisor of N (”core”of N ). In the paper there appear many other interesting identities, e.g. N ϕ(N ) = θs (M, N ) θs (M, d)µ ; d N d|N d|N

N θ (M, d)µ M, d (s)

133

(25)

2 θ (s) (M, N ) = . Ns

(26)

CHAPTER 2

4

Cohen’s Möbius functions and totients

The extension of Euler’s totient (as in the above paragraph) leads many times to generalized Möbius functions. In 1963 E. Cohen [51] defined such an extension, involving a Möbius generalization. Let p1 , p2 , . . . denote the increasing sequence of primes, and for a positive integer n, let νi (n) denote the multiplicity of pi as a divisor of n for each i ≥ 1. In particular, ν1 (n) = 0 if pi n. Given a positive integer k, n is called k-free if νi (n) < k for every i ≥ 1, and is k-full if νi (n) ≥ k for every i for which νi (n) = 0. Let Q k , L k denote the set of k-free and k-full integers respectively. Since n = n 1 · n 2 with (n 1 , n 2 ) = 1, n 1 ∈ Q k , n 2 ∈ L k ; the part n 1 = αk−1 (n) is called the k-free part, while n 2 = βk−1 (n) the k-full part of n. Let ϕ r (n) denote the number of integers (mod n) relatively prime to αr (n). Then ϕ r (n) = βr (n)ϕ (αr (n)) , where ϕ is the classical Euler totient. Denote by µr (n) the multiplicative function determined by  r  p , if a = r + 1 −1, if a = 1 . µr ( pa ) =  0, otherwise

(27)

(28)

The following elementary properties follow: ϕ r (n) = n

µr (d) d|n

µr (d) =

d|n

γ r (n), 0,

d

;

if n ∈ L r +1 . othwewise

(29)

(30)

where γ is the core of n. An interesting property follows from the definition: lim ϕ r (n) = ϕ(n).

r →∞

(31)

The following asymptotic result is true: n≤x

ϕ(n) =

ax 2 + O(x log2 x) 2 134

(32)


(ϕ(n) = ϕ 1 (n)), n≤x

ϕ r (n) =

ar x + O(x 1+ε ), 2

(33)

with a, ar constants. More generally, one can introduce Möbius functions of arbitrary direct factor sets. Let P, Q = ∅ be subsets of N such that if n 1 , n 2 ∈ N, (n 1 , n 2 ) = 1, then n = n 1 n 2 ∈ P ⇔ n 1 , n 2 ∈ P; and similarly for Q. If every integer n ∈ N possesses a unique factorization of the form n = ab (a ∈ P, b ∈ Q), then each of the sets P and Q will be called a direct factor set of N. In what follows P will denote such a direct factor set with (conjugate) factor set Q. The Möbius function can be generalized to arbitrary direct factor sets, by writing n , (34) µ P (n) = µ d d|n,d∈P where µ is the classical Möbius function. For example, µ1 (n) = µ{1} (n) and µN (n) = δ(n) (where δ(n) = 1, n = 1; 0, n > 1). It is immediate that for n = n 1 n 2 , (n 1 , n 2 ) = 1, n 1 , n 2 ∈ P one has µ P (n) = µ P (n 1 )µ P (n 2 ). On the other hand: n = δ(n) (35) µP d d|n,d∈Q which leads to the following Möbius-type inversion formula: n n f (n) = ⇔ g(n) = g f (d)µ P d d d|n,d∈Q d|n

(36)

By using these notions and properties, generalized totient functions may be introduced (see also E. Cohen [52]).

5

Klee’s Möbius function and totient

V. L. Klee [124] in 1948 introduced the function Tk (r ) as the number of integers h among the numbers 1, 2, . . . , r for which (h, r ) is k-free. For k = 1, Tk ≡ ϕ. Klee defined a generalized Möbius function µk by 1 µ r k , if r is a kth power . (37) µk (r ) = 0, otherwise 135

CHAPTER 2

Then the function Tk can be expressed as r µk (d) , Tk (r ) = d d|r

(38)

i.e. Tk = µk ∗ E. For fixed r , T2 (r ) represents the number of those arithmetic progressions r s + t (t ∈ {0, 1, 2, . . . , (s − 1)}) which contain infinitely many squarefree numbers. E. T2 (r ) K. Haviland [104] showed that is a Bohr almost-periodic function with an abr solutely and uniformly convergent Fourier series. A generalization of Klee’s function Tk has been introduced by D. Suryanarayana [53]. This is based on a notion of k-ary divisor of an integer. Let the symbol (a, b)k denote the greatest among the common k-th power divisors of a and b. If (a, b)k = 1 we say that an is relatively k-prime to b and vice-versa. A divisor d of n is called k-ary if d, = 1. We note that for k = 1 one reobtains the unitary divisors. Let d k Tk (x, n) denote the number of positive integers ≤ x which are relatively k-prime to n. Then Tk (n, n) = Tk . As a generalization of (38) one has x (39) µk (d) Tk (x, n) = d d|n

6

Möbius functions of Subbarao and Harris; Tanaka; and Venkataraman and Sivaramakrishnan

In 1966 M. V. Subbarao and V. C. function µk,q (r ) by   1, −1, µk,q ( pa ) =  0,

Harris [192] introduced the multiplicative if a ≡ 0 (mod k) if a ≡ q (mod k) . otherwise

(40)

They proved the interesting relation lim µk,1 (r ) = µ(r )

k→∞

(41)

and that, if ϕk,q (r ) denotes the number of integers a (mod r ) such that (a, r ) has its kth power free part qth powerfree, then r (42) ϕk,q (r ) = µk,q (d) . d d|r 136


From (42) follows also that lim ϕk,1 (r ) = ϕ(r ).

k→∞

(43)

Many generalized totient functions are also surveyed in [165]. Let λ be the Liouville function, given by λ(n) = (−1) (n) (where (n) denotes the total number of prime factors of n). A common generalization of Liouville’s function and the Möbius function has been introduced by M. Tanaka [202]. Let k ≥ 2 be positive integer or infinite and define   λ(n), if n is k − free 0, otherwise (44) µk (n) =  λ(n), if k = ∞ Clearly, µ2 (n) = µ(n), µ∞ (n) = λ(n). For 2 ≤ k ≤ ∞ let Mk (x) = µk (x). Then n≤x

√ √ Mk (x) − Bk x = ± ( x)

(45)

1 , Bk = ζ (1/2) ζ (k/2)/ζ (1/2)ζ (k), if k is odd; and Bk = 1/ζ (1/2)ζ (k/2) if k is even. Another generalization of the Möbius function, leading to an extension of Ramanujan sums has been introduced by C. S. Venkataraman and R. Sivaramakrishnan [212]. Put 0, if n contains a squared factor > 1, µk (n) = (46) exp(πiω(n)/k), otherwise (for the symbol ± see Handbook I [142]) where B2 = 0, B∞ =

where ω(n) denotes the number of distinct prime factors of n and k ≥ 1. Clearly µ1 (n) = µ(n) by exp(πiω(n)) = (−1)ω(n) . One has 1, if n = 1 (47) µk (d) = ω(n) , if n>1 (1 + s) d|n where s = exp(πi/k). The function µk leads to a parallel generalization of Euler’s totient, as well a Ramanujan sums, by introducing n · d, (48) µk ϕk (n) = d d|n 137

CHAPTER 2

and Ck (n, r ) =

µk

d|(n,r )

n d

·d

(49)

The functions ϕk and Ck are multiplicative (the second one is both n and r ), and are connected by the following formula: Ck (n, r ) = µk (r/g)ϕk (g)

t ϕk (t)

(50)

where g = (n, r ) and t is the product of the common distinct prime factors of r/g and g.

7

Möbius functions as coefficients of the cyclotomic polynomial

In 1983 R. Dussaud [165] introduced a generalized Möbius function, by application of results a cyclotomic polynomial Φn (x), having as roots the primitive roots of unity of order n. It is well known that the sum of all primitive roots of unity of order n is µ(n). Therefore, write Φn (x) = 1 − µ(n)x + µ2 (n)x 2 − µ3 (n)x 3 + . . . So µ2 (n) is the sum of all zeros of Φn taken two-by-two, i.e. xi x j µ2 (n) =

(51)

(52)

i< j

where (xi )1≤i≤ϕ(n) are the roots of Φn (x) = 0. In an analogous way, Dussaud defines µk (n) by xi1 xi2 · · · xik . µk (n) =

(53)

i 1 1 fixed positive integer. Define G as the set of positive rationals of the form p α a/b where α ≡ 0 (mod d), (a, p) = (b, p) = 1, 153

CHAPTER 2

a ≡ b (mod p). Here G is a subgroup with [G : G ] = d( p − 1) and cosets Hi j = pi j G (i = 0, 1, . . . , d − 1; j = 1, . . . , p − 1). Also n≤x,n∈Hi j

1=

p d−i−1 + O(log x) pd − 1

(19)

In this case the primes are equi-distributed among the cosets H0 j ( j = 1, p − 1), 3 is empty, or d1 = d, and L is the subgroup composed of the elements in the cosets H0 j ( j = 1, p − 1). 3) G = Q+ . For r = π piαi let (r ) = αi . Define G = the set of r such that

(r ) ≡ 0 (mod 2). Hence [G : G ] = 2, the cosets being G and 2G = H . On the assumption of the Riemann hypothesis, x 1 1 and 1 = + O(x 2 +ε ) (ε > 0) (20) 2 n≤x,n∈H n≤x,n∈G = G. In this case, all primes are in H , 2 = ∅, or d1 = or d3 = 1, L = G For equivalent formulations of abstract prime number theorems, see also P. Laborde Montaner and H. N. Shapiro [128].

3

Möbius functions of finite groups

In his paper on Eulerian functions, P. Hall [86] in 1936 defined the Möbius function on a subset of a power set, partially ordered by inclusion, and used the inversion formula to compute the number ϕs (G) of ordered s-tuples of elements which generate a finite group G. He illustrated the method by evaluating ϕs (G) when G ∼ = P S L 2 ( p) ( p prime), and in the process computed the Möbius value µ(G) for these groups. In 1959 W. Gaschütz [73] by calculating ϕs (G) for soluble groups, implicitely obtained a formula for µ(G) in terms of the numbers of complements of chief factors. This formula was stated explicitly by Ch. Kratzer and J. Thévenaz [127]. In what follows, P will be a finite poset and µ P will denote its Möbius function. If P has a smallest element, say 0, we shall write µ P (x) for µ P (0, x). The µ(G) above referred is in fact µL (1, G), where L = L(G) is the poset of all subgroups of G. When disscussing subposets of L(G), we shall reserve the symbol µ for this meanning, too. Let G be a finite group, and denote by S(G) the poset of all subgroups of G. We will be mainly concerned with subposets P of S(G), and their Möbius function µ P . The notation µ refers always to µ S(G) and µ(1, H ) will be denoted simply by µ(H ). If L ≤ H ≤ G, then µ(L , H ) can be calculated entirely within S(H ) and is independent of the embedding of H in G; in particular µ S(G) (H ) is an invariant of H . 154


H. H. Crapo [55] proved essentially the following result: Let N G and denote by K (G, N ) the set of all subgroups of G which complement N . Then µ(G) = µ(G/N ) µ(K , G). (21) K ∈K (G,N )

As a corollary, one can state that for a group G with µ(G) = 0, if N ≤ M G with G N G, one has that M/N is complemented in G/N . In particular ( ) = 1 (for N Group theory, see e.g. [116]). Thus µ(G) = 0 whenever G has a Frattini chief factor. If N is an Abelian minimal normal subgroup of G with a complement K , then K is a maximal subgroup of G, so µ(K , G) = −1. We thus have another corollary: Let A be an Abelian minimal normal subgroup of G and let k denote the number of complements to A in G. Then µ(G) = −kµ(G/A).

(22)

This corollary gives an easy proof of a result by P. Hall [85]: Let X be a p-group of order p n . Then µ(X ) = 0 unless X is elementary Abelian, in which case: µ(X ) = (−1)n p (2) . n

(23)

But (22) applied inductively leads also to the Gaschütz formula for the Möbius value of a soluble group: Let 1 = H0 < H1 < . . . < Hn = G be a chief series for the soluble group G, and let ki denote the number of complements to Hi /Hi−1 in G/Hi−1 . Then µ(G) = (−1)n k1 k2 · · · kn .

(24)

¨ The following general theorem is due to T. Hawkes, I. M. Isaacs and M. Ozaydin [105]: Let G be a finite group whose order is divisible by n, and assume that n is divisible by |G| p , the order of a Sylow p-subgroup of G. If H is a subgroup whose order divides n, then [N(H ) : H ] p divides µ(H, X ), where the sum is over all subgroups X of G with |X | dividing n. When H = 1 and n = |G| p , this is exactly a classical theorem by K. S. Brown [22] from 1975. 155

CHAPTER 2

We now turn our attention to applications of Möbius inversion formulae. For subgroups L and H of a group G, define α L (H, G) = µ(H, X ) ⊆X

where the sum runs over all subgroups X of G containing < H, L >. Note that αG (H, G) = µ(H, G). By applying a classical Möbius inversion formula for posets, the following result follows. Let L , H ≤ G. Then µ(H, G) = µ(X, G)α L (H, X ) (25) where the sum runs over subgroups X of G containing < H, L >. The following divisibility result is a consequence of (25): Let p be a prime and H a subgroup of G. Set L = O p (G). Then α L (H, G) is divisible by |NG (H ) : H | p .

(26)

Kratzer and Thévenaz proved essentially the following: Let H be a subgroup of G and let m be the squarefree part of |G : G H |. Then |NG (H ) : H | divides m · µ(H, G).

(27)

¨ This implies (see Hawkes-Isaacs-Ozaydin [105]): Let m be the product of those prime numbers p for which G/O p (G) is elementary Abelian of order p or p 2 . Then |G| divides m · µ(G). Furthermore, for any prime p, |O p (G)| p divides µ(K , G) K

where K runs over all complements to O p (G) in G.

(28)

Frobenius’ classical theorem states that if n is a divisor of the order of a finite group G, then the number of solutions to the equation x n = 1 in G is divisible by n. 156

(29)


This can be proved elementarily by the following result of P. Hall [86]: If X is a group, let ϕs (X ) be the number of s-tuples (x1 , . . . , xs ) of a group elements xi such that X =< x1 , . . . , xs >. Then obviously ϕs (X ). |G| S = x≤G

Set µ∗ (X ) = µ(X, G). Then µ∗ is the Möbius function associated with the dual poset of S(G) and so µ(G) = µ∗ (1). Applying the Möbius inversion formula, we get: µ∗ (X ) · |X |s . (30) ϕs (G) = X ≤G

In particular, ϕ1 (G) is zero unless G is cyclic, in which case ϕ1 (G) = ϕ(|G|) the usual ϕ-function of Number theory. If H ≤ G, let [H ] = {H g | g ∈ G}, the conjugacy class of H , and let C(G) denote the set of all conjugacy classes of subgroups of G. We view C(G) as a poset with partial ordering ≤ defined by the rule [H ] ≤ [L] if H ≤ L g for some g ∈ G. In general, the poset C(G) is neither a meet -nor a join- semilattice, but it naturally admits Möbius function µC(G) , denoted by λG . Also we write λG (G) for λG ([G]). The following important result is true: If G is soluble, then µ(G) = λG (G) · |G |.

(31)

¨ The above result by Hawkes, Isaacs and Ozadyn has been generalized by H. Pahlings [150] as follows. If G is a soluble group and H a subgroup, then µ(H, G) = [NG (H ) : H ∩ G ]λ(H, G)

(32)

where λ(H, G) is the notation for λ([H ], [G]). For example, for the simple groups G = P S L(2, p) ( p > 3 a prime) one has µ(H, G) = [NG (H ) : H ]λ(H, G) for every subgroup H of G. A group A has the N -property with respect to a group B if, by definition |Hom(B, N A (T )/T )| = 1, 157

(33)

CHAPTER 2

for all T with 1 < T ≤ A (this holds for example, when B is a simple group with |B| ≥ |A|). The following result enables us to compute the Möbius function of a direct product ([105]). If A is nontrivial and has the N − pr oper t y with respect to B, then µ(A × B) = µ(B) · (µ(A) − s),

(34)

where s is the number of epimorphisms from B onto A. For an application, when A and B are non-isomorphic simple groups, then µ(A × B) = µ(A) · µ(B).

(35)

Relation (34) enables us to compute µ(G) when G is a direct product of simple groups: Let A be a non Abelian simple group and G = A × A ×. . .× A, the direct product of n copies of A. Then µ(G) = 0 if µ(A) = 0, or else µ(G) = µ(A)n ·

n−1

(1 − r t),

(36)

r =1

|Aut(A)| . µ(A) For example, when G is a direct power of n copies of A5 , then

with t =

µ(G) = (−60)n · 3 · 5 · . . . · (2n − 1),

(37)

so one can see the interesting fact that there exists a group G and a prime p such that p divides µ(G) = 0, but doesn’t divide |Aut(G)|. For groups whose commutative subgroup is an abelian Hall π -subgroup, the following theorem is true (see M. Bianchi, A. Gillio Berta Mauri and L. Verardi [14]): Let G be (a finite) group, whose commutator subgroup G is an abelian Hall π subgroup (all Sylow subgroups of which are elementary abelian). Let R be the lattice of those subgroups of G which are normal in G, and µR (G ) the corresponding Möbius function. Then µ(G) = µ(G/G )|G | · µR (G )

(38)

As a corollary of (38) one obtains that if G is a group with G elementary abelian Sylow p-subgroup of order p k ( p prime, k > 1), then G/G is of squarefree order. Further, for all H ≤ G let H < G. Then µ(G) = ±|G | · µ(G ) 158

(39)


The following result gives a condition for µ(G) to be a prime power: Let G be a group such that G is the elementary abelian Sylow p-subgroup. If G/G is of squarefree order, then µ(G) = p k

(40)

for certain k ≥ 1. Generally (see [14]) µ(G) = p k if and only if |G | = p s , s ≤ k; the Sylow p-subgroup is elementary abelian and the other Sylow subgroups are cyclic of prime order.

(41)

In fact, for each prime p and k ≥ 1 there is a metabelian group G such that µ(G) = p n .

(42)

Similarly, if n = p k q h (n, q primes, k, h ≥ 1), then there exists a metabelian group G such that µ(G) = n.

(43)

Therefore for ω(n) ≤ 2, the Möbius function µ is surjective. It can be proved that this is true for all n ≤ 100 (see [14]), however this may be not true even for simple groups (see [15], where for a such group G one has µ(G) = 0).

4

(44)

Möbius functions of algebraic number and function-fields

Let K be an algebraic number field of degree k over the rational field. A generalized Möbius function µ K (a) defined over the integral ideals of K is defined by H. N. Shapiro [175] as follows:  1, if a = 0    m (−1) , if a is squarefree and is the product (45) µ K (a) = of m distinct prime ideals    0, otherwise If one defines F(a) =

µ K (b), then F is multiplicative function and F( p α ) =

b|a

0, so that F(a) =

1, for a = 0 0, otherwise 159

(46)

CHAPTER 2

This enables us to introduce a generalized inversion formula as follows: If f (x) is a given complex-valued function defined for all x > 0, and x , (47) f g(x) = Na N a≤x then f (x) =

µ K (a)g

N a≤x

x . Na

(48)

This inversion formula gives a possibility to estimate various sums involving integral ideals of K , and to deduce Selberg’s identity in case of the algebraic number field K (see [175]): log2 N p + log N p log N q = 2x log x + O(x) (49) N p≤x

N pq≤x

This is equivalent to

log N p ∼ x

(x → ∞)

(50)

N p≤x

i.e. the prime ideal theorem. We note that the proof of (49) uses also an important result from algebraic number theory, namely: 1 = αx + O(x 1−1/k ) (51) N a≤x

where α is a constant depending only on the field K , and α=

2r1 +r2 π r2 Rh √ w |D|

(52)

where r1 = number of real conjugate fields of K , r2 = number of imaginary conjugate fields, w = number of roots of unity in K , h = number of ideal classes (see [218]). The function µ K of Möbius enables us to introduce a generalized von Mangoldt function, too:  0, if a = 0 a  log N p, if a = p α K (a) = (53) µ K (b) log N =  b b|a 0, otherwise 160


The following identity is true (see [175]): b|a

µ K (b) log2 N

a a = K (a) log N a + K (b) K b b b|a

(54)

Besides Shapiro’s proof, another elementary proof of the prime ideal theorem (in the form (50)) is due to C. Toubi [209], who follows a method due to A. Hildebrand [106]. If P = ∅ is a set of prime ideals p ∈ P, M. Skalba [182] defines   µ(a) if a is an integral ideal of K not divisible by any p ∈ P, µ P (a) =  0, otherwise

(55)

This is applied in the proof of generalized Euler identities. For Möbius and Euler type functions on algebraic function fields, see e.g. the monograph by M. Rosen [160]. For generalizations of von Mangoldt’s function , see A. Ivić [117], [118]; and for a characterization, see P. Haukkanen [102]. For a unitary Mangoldt function, see [30].

5

Trace monoids and Möbius functions

Finally, we shall deal with Möbius functions in trace monoids. Given a finite alphabet , a trace monoid M is defined as the quotient ∗ / ≡ I , where I ⊂ × is a symmetric and irreflexive relation, and ≡ I is the smallest congruence extending the set of equations {ab = ba| (a, b) ∈ I }. The elements of M are called traces. These were introduced in 1969 in P. Cartier and D. Foata [37] in order to give a completely combinatorial proof of Mac Mahon’s Master theorem (see G. Lallement [129], ch. XI). They were studied further as a possible model of parallelism by interpretation of generators of the monoid as actions and their commutation as independence of actions (A. Mazurkiewicz [141]). A theory of trace languages was then developed, extending the properties of formal languages. For a survey of results, as well as open problems, see V. Diekert and G. Rozenberg [64]. The pair , I is called independence alphabet and can be represented by an undirected graph, with the set of nodes, and I the set of edges. In what follows, Z M ! will be the ring of formal power series over M with integer coefficients. The support of σ ∈ Z M ! is the set of all t ∈ M with σ (t) = 0. A polynomial is a formal power series having finite support. 161

CHAPTER 2

The Möbius function of a trace monoid M is defined by   (−1)n , if t = a1 . . . an , where all ai ∈ are different, and (ai , a j ) ∈ I for all i = j, (56) µ M (t) =  0, otherwise with the convention that µ M (1) = 1. If ξ M = t is the characteristic series of M, t∈M

then one has ξ M µ M = µ M ξ M = 1,

(57)

see [37]. The Möbius function µ M can be represented by several polynomials in Z . Consider the canonical morphism ψ: Z !→ Z M !. Let us say that a polynomial µ ∈ Z ! is a non-commuting lifting of the Möbius function of M if ψ(µ) = µ M and the restriction ψ : ∗ → M is injective on the support of µ. Such a function is called unambiguous if its inverse ξ satisfies ξ(w) ∈ {0, 1} for all w ∈ ∗ and ψ(ξ ) = t. V. Diekert [129] proved that an unambiguous nont∈M

commuting lifting µ of the Möbius function of M exists iff the graph , I admits a transitive orientation. Assume that I is a transitive orientation of , I and let be a linear extension of I over . The formal power series given by  (−1)n , if x = x1 x2 . . . xn , {x1 , . . . , xn } is a clique    of , I and x is a lexicographically smallest string (58) µ(x) = in x with respect to ,    0, otherwise is an unambiguous lifting of µ M (see [63]). C. Choffrut and M. Goldwurm [44] call µ as the unambiguous Möbius function defined by I . In [44] the following result is proved: Let , I be an independence alphabet that admits a transitive orientation I . Then the unambiguous Möbius function µ defined by I is given by µ = det(In − X ), where X is a matrix and In the identity matrix of order n. In fact X is a minimal acceptor matrix of a lexicographic cross section defined by I . For details, see [44]. For related results on Algebraic topology, see [20], [70], [153], [204], [18] and [17].

162

References [1] M. Aigner, Combinatorial theory, Springer Verlag, New York, 1979. [2] T. M. Apostol, Möbius functions of order k, Pacific J. of Math., 32 (1970), 11-17. [3] T. M. Apostol, Introduction to Analytic Number Theory, Undergraduate texts in Mathematics, Springer Verlag, New York, 1976. [4] K. T. Atanassov, Remark on an application of the intuionistic fuzzy sets in number theory, Adv. Stud. Contemp. Math. (Kyungshang), 5 (2002), 49-55. [5] P. Bachman, Die Analytische Zahlentheorie, Leipzig, 1894. [6] P. T. Bateman and H. G. Diamond, Asymptotic distribution of Beurling’s generalized prime numbers, Studies in Number Theory, Math. Assoc. Amer. Studies 6 (W. J. Leveque, ed.), 1969, 152-210. [7] M. M. Bayer and G. Hetyei, Generalizations of Eulerian partially ordered sets, flag numbers, and the Möbius function, pp. 1-19, arXiv:math.CO/0101075v1, 9 Jan. 2001. [8] A. Bege, Triunitary divisor functions, Studia Univ. Babes¸-Bolyai, Math., 37 (1992), 3-7. [9] A. Bege, A generalization of Apostol’s Möbius function of order k, Publ. Math. (Debrecen), 58 (2001), 293-301. [10] E. T. Bell, An arithmetical theory of certain numerical functions, Univ. Washington Publ. Math. Phys. Sci., 1 (1915), No.1, 1-44. [11] E. A. Bender and J. R. Goldman, On the application of Möbius inversion to combinatorial analysis, Amer. Math. Monthly, 82 (1975), 789-803. 163

CHAPTER 2

[12] H. Bercovici and F. Foias¸, On the Zorn spaces in Beurling’s approach to the Riemann hypothesis, Analysis and Topology, eds. C. Andreian Cazacu, O. Lehto and Th. M. Rassias (1998 World Sci. Publ.), 143-149. [13] A. Beurling, Analyse de la loi asymptotique de la distribution des nombres premiers généralisés I., Acta Math., 68 (1937), 255-291. [14] M. Bianchi, A. Gillio Berta Mauri and L. Verardi, On the surjectivity of the Möbius function µ of a finite group, Bolletino U.M.I. (7)5-B(1991), 773-786. [15] M. Bianchi, A. Gillio Berta Mauri and L. Verardi, On Hawkes-IsaacsOzaydin’s conjecture, Rend. Ist. Lomb. Sc. e Lett., 124-A(1990), 99-117. [16] G. Birkhoff, Lattice theory, Amer. Math. Soc., Providence, 1967. [17] A. Blass, Homotopy and homology of finite lattices, Electronic J. Comb., 8 (2001), 1-12. [18] A. Blass and B. F. Sagan, Möbius functions of lattices, Adv. Math., 127 (1997), 94-123. [19] D. M. Bloom, On the coefficients of the cyclotomic polynomials, Amer. Math. Monthly, 75 (1968), 372-377. [20] A. Björner, Homotopy type of posets and lattice implementation, J. Combin. Theory ser. A, 30 (1981), 90-100. [21] H. Breitenfellner, A unified Möbius inversion formula, C. R. Math. Rep. Acad. Sci. Canada 13(1991), no. 1, 39-42. [22] K. S. Brown, Euler characteristic of groups: the p-fractional part, Invent. Math., 29 (1975), 1-5. [23] T. C. Brown, L. C. Hsu, J. Wang, P. J.-S. Shiue, On a certain kind of generalized number theoretical Möbius function, Math. Scientist., 25 (2000), 72-77. [24] R. G. Buschman, Identities involving Golubev’s generalization of the µ function, Port. Math., 29 (1970), 145-149. [25] R. G. Buschman, A Möbius function generalization, Ranchi Univ. Math. J., 27 (1996), 35-38. [26] R. G. Buschman, Number theoretic functions from partial products, Far East J. Math. Sci., 4 (1996), 1-7. 164


[27] R. G. Buschman, A convolution integral for number theoretic functions, Bul. Cal. Math. Soc., 89 (1997), 91-96. [28] R. G. Buschman, Max-products, J. Indian Acad. Math., 20 (1998), 87-94. [29] R. G. Buschman, lcm-Products of number theoretic functions revisited, Kyungpook Math. J., 39 (1999), 159-164. [30] C. Calderón and M. J. Zárate, Asymptotic formulae of generalized Chebyshev functions, Rev. Colombian Mat. 30(1996), no. 1, 53-63. [31] L. Carlitz, Arithmetical functions is an unusual setting, Amer. Math. Monthly, 73 (1966), 582-590. [32] L. Carlitz, Arithmetical functions is an unusual setting, II., Duke. Math. J., 34 (1967), 757-759. [33] T. Caroll and A. A. Gioia, Roots of multiplicative functions, Compositio Math., 65 (1988), 349-358. [34] P. J. McCarthy, On an arithmetic function, Monath. für Math. 3(1959), 228230. [35] P. J. McCarthy, Note on some arithmetic sums, Boll. Un. Mat. Ital., 21 (1966), 239-242. [36] P. J. McCarthy, Introduction to arithmetical functions, Springer Verlag, 1986. [37] P. Cartier and D. Foata, Problèmes combinatoires de commutation et réarrangements, Lecture Notes in Math., vol. 85, Springer, Berlin, 1969. [38] E. D. Cashwell and C. J. Everett, The ring of number theoretic functions, Pacific J. Math., 9 (1959), 975-985. [39] B. Chen, Parametric Möbius inversion formulas, Discrete Math., 169 (1997), 211-215. [40] N.-X. Chen, Modified Möbius inversion formula and its applications in Physics, Physical Review Letters, 64(1990), no. 11, 1193-1195. [41] N.-X. Chen and E.-Q. Rong, Unified solution of the inverse capacity problem, Physical Review E 57(1998), no. 2, 1302-1308. [42] Z. Chen, Y. Shen and N. Chen, The Möbius function on a unique factorization domain and application in an inverse cohesion problem, Chim. Sci. Bull. 39(1994), no. 8, 628-631. 165

CHAPTER 2

[43] J. Chidambaraswamy, Sum functions of unitary and semi-unitary divisors, J. Indian Math. Soc., 31 (1967), 117-126. [44] C. Choffrut and M. Goldwurm, Determinants and Möbius functions in trace monoids, Discrete Math. 194(1999), 239-247. [45] E. Cohen, A class of residue system (mod r ) and related arithmetical functions I., A generalization of Möbius inversion, Pacific J. Math., 9 (1959), 13-23. [46] E. Cohen, Arithmetical functions associated with arbitrary sets of integers, Acta Arith., 5 (1959), 407-415. [47] E. Cohen, Arithmetic functions associated with the unitary divisors of an integer, Math. Z., 74 (1960), 66-80. [48] E. Cohen, The number of unitary divisors of an integer, Amer. Math. Monthly, 57 (1960), 879-880. [49] E. Cohen, On the inversion of even functions of finite abelian groups, J. Reine Angew. Math., 207 (1961), 192-202. [50] E. Cohen, Almost even functions of finite abelian groups, Acta Arith., 7 (1962), 311-323. [51] E. Cohen, Some analogues of certain arithmetical functions, Riv. Mat. Parma, 4 (1963), 115-125. [52] E. Cohen, A class of residue systems (mod r) and related arithmetical functions, II. Higher dimensional analogs, Pacific J. Math. 9(1959), 667-679. [53] G. L. Cohen and P. Hagis, Jr., Arithmetic functions associated with the infinitary divisors of an integer, Intern. J. Math. Math. Sci. 16(1993), no. 2, 373-384. [54] M. Content, F. Lemay and P. Leroux, Catégories de Möbius et fonctorialités: un cadre general pour l’inversion de Möbius, J. Combin. Theoory Ser. A 28(1980), no. 2, 169-190. [55] H. H. Crapo, The Möbius function of a lattice, J. Combin. Theory, 1 (1966), 126-131. [56] T. M. K. Davison, On arithmetic convolutions, Canad. Math. Bull., 9 (1966), 287-296. [57] D. E. Daykin, Generalized Möbius inversion formulae, Quart. J. Math. Oxford Ser. (2), 15 (1964), 349-354. 166


[58] D. E. Daykin, Generalized Möbius inversion formulae, Quart. J. Math. 15(1964), 349-354. [59] M. Deaconescu and J. Sándor, Variations on a theme by Hurwitz, Gaz. Mat. A (Bucures¸ti), 8 (1987), 186-191. [60] R Dedekind, Abrifs einer Theorie der höhern Congruenzen in Bezung auf einer reellen Primzahl-Modulus, J. Reine Angew. Math., 54 (1857), 1-26. [61] S. Delsarte, Fonctions de Möbius sur les groupes Abeliens finis, Annals of Math., 49 (1948), 600-609. [62] H. G. Diamond, A set of generalized numbers showing Beurling’s theorem to be sharp, Ill. J. Math. 14(1970), 29-34. [63] V. Diekert, Transitive orientation, Möbius functions and complete semi-Thue systems for free partially commutative monoids, Lecture Notes Comp. Sci., vol. 317, Springer, Berlin, 1988, 176-187. [64] V. Diekert and G. Rozenberg (eds.), The Book of Traces, World Sci. Singapore, 1995. [65] R. Dussaud, Functions de Möbius d’ordre quelconque, Publ. Centre Rech. Math. Pures, 18 (1983-84), 9-10. [66] M. H. Eggar, A two variable Möbius inversion formula with applications, Math. Student, 68 (1999), 185-194. [67] L. Euler, Introductio in analysis infinitorum, vol. I (Lausanne), 1748. [68] M. Ferrero, On generalized convolution rings of arithmetic functions, Tsukuba J. Math., 4 (1980), 161-176. [69] A. Fleck, Sitzungsber. Berlin Math. Gesell, 15 (1915), 3-8; see also L. E. Dickson, History of the theory of numbers, vol. I., 4th ed., 1992, p. 448, Chelsea Publ., Providence. [70] J. Folkman, The homology groups of a lattice, J. Math. Mech., 15 (1966), 631636. [71] W. Forman and H. N. Shapiro, Abstract prime number theorems, Comm. Pure Appl. Math. 7(1954), no. 3, 587-619. [72] I. P. Fotino, Generalized convolution rings of arithmetic functions, Pacific J. Math., 61 (1975), 103-116. 167

CHAPTER 2

[73] W. Gaschütz, Die Eulerische funktion endlische auflösbarer Gruppen, Illinois J. Math., 3 (1959),469-476. [74] M. D. Gessley, A generalized arithmetic convolution, Amer. Math. Monthly, 74 (1967), 1216-1217. [75] A. A. Gioia, The K -product of arithmetic functions, Canad. J. Math., 17 (1965), 970-976. [76] A. A. Gioia and M. V. Subbarao, Generalized Dirichlet products of arithmetic functions (Abstract), Notices A.M.S., 9 (1962), 305. [77] J. Golan, The theory of semirings with applications in mathematics and computer science, Longman, 1992. [78] R. R. Goldberg and R. S. Varga, Moebius inversion of Fourier transforms, Duke Math. J. 23(1956), 553-559. [79] S. W. Golomb, A new arithmetic function of combinatorial significance, J. Number Theory, 5 (1973), 218-223. [80] R. L. Graham, D. E. Knuth and O. Patashnik, Concret mathematics: A foundation for computer science, Addison-Wesley, 1989. [81] E. E. Guerin, A convolution related to Golomb’s root function, Pacific J. Math., 79 (1978), 463-467. [82] E. E. Guerin, Matrices and convolutions of arithmetic functions, Fib. Quart. 16(1978), 327-334. [83] H. Gupta, A generalization of the Möbius function, Scripta Mat., 19 (1953), 121-126. [84] H. Halberstam and H.-E. Richert, Sieve methods, Academic Press, London, 1974. [85] P. Hall, A contribution to the theory of groups of prime power order, Proc. London Math. Soc., 36 (1934), 24-80. [86] P. Hall, The Eulerian functions of a group, Quart. J. Math., 7 (1936), 134-151. [87] J. Hanumanthachari, On an arithmetic convolution, Canad. Math. Bull., 20 (1977), 301-305. 168


[88] J. Hanumanthachari and V. V. Subrahmanyastri, On some arithmetical identities, Math. Student, 46 (1978), 60-70. [89] R. T. Hansen, Arithmetic inversion formulas, J. Natur. Sci. Math. 20(1980), no. 2, 141-150. [90] G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, Oxford, Clarendon Press, 1979. [91] P. Haukkanen, Classical arithmetical identities involving a generalization of Ramanujan’s sum, Dissertation, Helsinki, 1988. [92] P. Haukkanen, Arithmetic equations involving semi-multiplicative functions and Dirichlet convolutions, Rend. Mat., Serie VII, 8 (1988), 511-517. [93] P. Haukkanen, Some generalized totient functions, Math. Student, 56 (1988), 65-74. [94] P. Haukkanen, On the Davison convolution of arithmetic functions, Canad. Math. Bull., 32 (1989), 467-473. [95] P. Haukkanen, Roots of sequences under convolutions, Fib. Quart., 32 (1994), 369-372. [96] P. Haukkanen, On a binomial convolution of arithmetical functions, Nieuw Arch. Wiskunde, 14 (1996), 209-216. [97] P. Haukkanen, On the real powers of completely multiplicative arithmetical functions, Nieuw Arch. Wiskunde, 15 (1997), 73-77. [98] P. Haukkanen, A class of rational arithmetical functions with combinatorial meanings, J. Math. Research and Exp., 17 (1997), 179-184. [99] P. Haukkanen, A further combinatorial number theoretic extension of Euler’s totient, J. Math. Research and Exp., 17 (1997), 519-523. [100] P. Haukkanen, Basic properties of the bi-unitary convolution and the semi unitary convolution, Indian J. Math., 40 (1998), 305-315. [101] P. Haukkanen, On a generalized convolution of incidence functions, Discrete Math., 215 (2000), 103-113. [102] P. Haukkanen, On characterizations of completely multiplicative arithmetical functions, Number Theory (Turku, 1999), 115-123, de Gruyter, Berlin, 2001. 169

CHAPTER 2

[103] P. Haukkanen and P. Ruokonen, On an anlogue of completely multiplicative functions, Port. Mat., 54 (1997), 407-420. [104] E. K. Haviland, An analogue of Euler’s ϕ function, Duke Math. J., 11 (1944), 869-872. ¨ [105] T. Hawkes, I. M. Isaacs and M. Ozaydin, On the Möbius function of a finite group, Rocky Mountain J. Math., 19 (1989), 1003-1033. [106] A. Hildebrand, The prime number theorem via the large sieve, Mathematika 33(1986), no. 1, 23-30. [107] E. Hille, The inversion problem of Möbius, Duke Math. J., 3 (1937), 549-569. [108] E. Hille and O. Szász, On the completeness of Lambert functions, Bull. Amer. Math. Soc., 42 (1936), 411-418. [109] E. M. Horadam, An extension of Daykin’s generalized Möbius function to unitary divisors, J. Reine Angew. Math., 346 (1971), 117-125. [110] E. M. Horadam, An extension of Daykin’s generalized Möbius function to unitary divisors, J. Reine Angew. Math. 246(1971), 117-125. [111] E. M. Horadam, Arithmetic functions of generalized primes, Amer. Math. Monthly 68(1961), 626-691. [112] E. M. Horadam, Ramanujan’s sum for generalized integers, Duke Math. J. 31(1964), 697-702. [113] E. M. Horadam, Solved, semi-solved, and unsolved problems in generalized integers: a survey, Fib. Quart. 16(1978), 370-381. [114] L. C. Hsu, A difference-operatorial approach to the Möbius inversion formulas, Fib. Quart. 33(1995), no. 2, 169-173. [115] L. C. Hsu and J. Wang, Some Möbius type functions and inversions constructed via difference operators, Tamkang J. Math., 29 (1998), 89-99. [116] B. Huppert, Endliche Gruppen I., Springer Verlag, 1967. [117] A. Ivić, An application of Dirichlet series to certain arithmetical functions, Math. Balkanica 3(1973), 158-165. [118] A. Ivić, On certain functions that generalize von Mangoldt’s function (n), Math. Vesnik 12(27)(1975), 361-366. 170


[119] J. P. Kahane, Sur les nombres premiers généralisés de Beurling. Preuve d’une conjecture de Bateman et Diamond, J. Théor. Nombres de Bordeaux 9(1997), 251-266. [120] J. P. Kahane, A Fourier formula for prime numbers, Canad. Math. Soc. Conf. Proc. 21(1997), 89-102. [121] J. P. Kahane, Un théorème de Littlewood pour les nombres premiers de Beurling, Bull. London Math. Soc. 31(1999), 424-430. [122] J. P. Kahane, Le rôle des algèbres A de Wiener, A∞ de Beurling et H 1 de Sobolev dans la théorie des nombres premiers généralisés de Beurling, Annales de l’Inst. Fourier 48(1998), no. 3, 611-648. [123] Paula A. Kemp, A note on a generalized Möbius function, J. Natur. Sci. and Math., 15 (1975), 55-57. [124] V. L. Klee, A generalization of Euler’s ϕ function, Amer. Math. Monthly, 55 (1948), 358-359. [125] J. Knopfmacher, Abstract analytic number theory, North Holland, Amsterdam-New York, 1975. [126] J. Knopfmacher, Arithmetic properties of finite rings and algebras, and analytic number theory, II. Categories and relative analytic number theory, J. Reine Angew. Math. 254(1972), 74-99. [127] Ch. Kratzer and J. Thévenaz, Fonction de Möbius d’un group fini et anneau de Burnside, Comment Math. Helv., 59 (1984), 425-438. [128] P. Laborde Montaner and H. N. Shapiro, On equivalent formulations of certain abstract prime number theorems, Dissertation by P. Laborde Montaner, New York Univ., 1951, 1-43. [129] G. Lallement, Semigroups and combinatorial applications, Wiley, New York, 1979. [130] V. Laohakosol, N. Pabhapote, N. Wechwiriyakul, Characterizing completely multiplicative functions by generalized Möbius functions, Int. J. Math. Math. Sci., 29 (2002), 633-639. [131] D. H. Lehmer, A new calculus of numerical functions, Amer. J. Math., 53 (1931), 843-854. 171

CHAPTER 2

[132] D. H. Lehmer, Arithmetic of double series, Trans. Amer. Math. Soc., 33 (1931), 945-957. [133] D. H. Lehmer, On a theorem of von Sterneck, Bull. Amer. Math. Soc., 37 (1931), 723-726. [134] A. Lenard, Private communication to H. Bercovici and C. Foias¸. [135] M. Li and N.-X. Chen, Möbius inversion transform for diamond-type materials and phonon dispersions, Physical Review B 52(1995), no. 2, 997-1003. [136] J. Liouville, Sur l’expression ϕ(n), qui marque combien la suite 1, 2, 3,...,n contient de nombres premiers a´ n, J. de Math., 2 (1857), 110-112. [137] S.-j. Liu, M. Li and N.-X. Chen, Möbius transform and inversion from cohesion to elastic constants, J. Phys. Condens. Matter 5(1993), 4381-4390. [138] J. H. Loxton and J. W. Sanders, On an inversion theorem of Möbius, J. Austral. Math. Soc., Ser. A, 30 (1980), 15-32. [139] E. Lucas, Sur les congruences des nombres eulériennes et des coefficients différentiels des fonctions trigonométriques, suivant un module premier, Bull. Soc. Math. France 6(1878), 49-54. [140] P. Malliavin, Sur le reste de la loi asymptotique de répartition des nombres premiers généralisés de Beurling, Acta Math., 106(1961), 281-298. [141] A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB78, Aarhus Univ., 1977. [142] D. S. Mitrinović, J. Sándor, B. Crstici, Handbook of number theory, Kluwer Acad. Publ., 1995. ¨ [143] A. F. Möbius, Uber einer besondere Art von Umkehrung der Reihen, J. Reine Angew. Math., 9 (1832), 105-123. ¨ [144] H. Muller, Uber die asymptotische Verteilung von Beurlinschen Zahlen, J. Reine Angew. Math. 289(1977), 181-187. [145] W. Narkiewicz, On a class of arithmetical convolutions, Colloq. Math., 10 (1963), 81-94. [146] C. A. Nicol, On restricted partitions and a generalization of the Euler phi number and the Möbius function, Proc. Nat. Acad. Sci. USA, 39 (1953), 963968. 172


[147] J. L. Nicolas and V. Sitaramaiah, Existence of unity in Lehmer’s ψ-product ring. II, Indian J. Pure Appl. Math. 33(2002), no. 10, 1503-1514. [148] I. Niven and H. S. Zuckerman, An introduction to the theory of numbers, Wiley, New York, 1980. [149] B. Nyman, A general prime number theorem, Acta Math. 81(1949), 299-307. [150] H. Pahlings, On the Möbius function of a finite group, Arch. Math. (Basel), 60 (1993), 7-14. [151] C. Popovici, A generalization of the Möbius function (Romanian), Studii Cerc. Mat. (Bucures¸ti), 3 (1963), 493-499. ˇ Porubský, Rényi’s formula with remainder term on arithmetical semigroups, [152] S. Math. Slovaca 40(1990), no. 1, 37-52. [153] D. Quillen, Homotopy properties of the poset of nontrivial p-subgroups of a group, Adv. Math., 28 (1978), 101-128. [154] D. Rearick, Semi-multiplicative functions, Duke Math. J., 33 (1966), 49-53. [155] D. Rearick, Operators on algebras of arithmetic functions, Duke Math. J., 35 (1968), 761-766. [156] L. Rédei, Zetafunktionen in der Algebra, Acta Math. Acad. Sci. Hung., 6 (1955), 5-25. [157] L. Rédei, Algebra I., Leipzig, 1959. [158] Sz. Révész, On Beurling prime number theorem, Period. Math. Hungar. 28(1994), 195-210. [159] H. Riesel, The cyclotomic polynomials, Prime numbers and computer methods for factorization, Birkhäuser, 2nd ed. Boston, 1994, pp. 305-308. [160] M. Rosen, Number theory in function fields, Springer Verlag, 2002. [161] G. C. Rota, On the foundations of combinatorial theory I. Theory of Möbius functions, Z. Wahrscheinlichkeitstheorie und Verv. Gebiete, 2 (1964), 340-368. [162] J. Sándor, On the arithmetical functions dk (n) and dk∗ (n), Port. Math., 53 (1996), 107-115. [163] J. Sándor, On an exponential totient function, Studia Univ. Babes¸-Bolyai, Math., 41 (1996), 91-94. 173

CHAPTER 2

[164] J. Sándor and A. Bege, The Möbius function: generalizations and extensions, Adv. Studies Contemp. Math. 6(2003), no. 2, 77-128. [165] J. Sándor and R. Sivaramakrishnan, The many facets of Euler’s totient: III. An assortment of miscellaneous topics, Nieuw Arch. Wiskunde, 11 (1993), 97-130. [166] J. Sándor and L. Tóth, On certain number theoretic inequalities, Fib. Quart., 28 (1990), 255-258. [167] K. P. R. Sastry, On the generalized type Möbius functions, Math. Student, 31 (1963), 85-88. [168] K. P. R. Sastry, Sukla I. L., Panda S. N., Convolution associated with a subnormal sequence, Bull. Calcutta Math. Soc., 90 (1998), 167-174. [169] U. V. Satyanarayana, On the inversion property of the Möbius’ µ-function, Math. Gaz. XVLII(1963), no. 359, 38-42. [170] H. Scheid, Einige ringe zahlentheoretischen functionen, J. Reine Angew. Math., 237 (1969),1-11. [171] H. Scheid, Funktionen u¨ ber lokal endlichen Halbordnung I., Monatsch. Math., 74 (1970), 336-347. [172] H. Scheid, Funktionen u¨ ber lokal endlichen Halbordnung II., Monatsch. Math., 75 (1971), 44-56. [173] A. Schinzel, A property of unitary convolution, Colloq. Math., 78 (1998), 9396. [174] E. Schwab and E. D. Schwab, Arithmetic convolution, applications in combinatorics, Seminar Arghiriade, Univ. Timis¸oara, No. 17 (1988), 1-8. [175] H. N. Shapiro, An elementary proof of the prime ideal theorem, Comm. Pure Appl. Math. 2(1949), 309-323. [176] K. Shindo, Exponential convolutions of arithmetic functions, Sci. Rep. Hirosaki Univ., 24 (1977), 4-7 [177] W. Sierpinski, Elementary theory of numbers, Warsawa, 1964. [178] V. Sitaramaiah, Arithmetical sums in regular convolutions, J. Reine. Angew. Math., 303/304 (1978), 265-283. 174


[179] V. Sitaramaiah and M. V. Subbarao, On a class of ψ-products preserving multiplicatively II, Indian J. Pure Appl. Math. 25(1994), 1233-1242. [180] V. Sitaramaiah and M. V. Subbarao, Convolutions with unbounded unity, Canad. Math. Bull. 34(1991), no. 4, 542-546. [181] R. Sivaramakrishnan, Classical theory of arithmetic functions, Marcel Dekker, 1989. [182] M. Skalba, On Euler - von Mangoldt’s equation, Colloq. Math. 69(1995), no. 1, 143-145. [183] N. J. A. Sloane, On-line encyclopedia of integer sequences, http://www.research.att.com/ñjas/sequences/seis.html. [184] D. Smith, Incidence functions as generalized arithmetic functions I., Duke Math. J., 34 (1967), 617-634. [185] D. Smith, Incidence functions as generalized arithmetic functions II., Duke Math. J., 36 (1969), 15-30. [186] D. Smith, Incidence functions as generalized arithmetic functions III., Duke Math. J., 36 (1969), 353-368. [187] D. Smith, Generalized arithmetic function algebras, Lectures Notes in Math., No. 251, Springer, 1972, pp. 205-245. [188] E. Spiegel and Chr. J. O’Donnell, Incidence algebras, Marcel Dekker, 1997. [189] R. P. Stanley, A survey of Eulerian posets, in: ”Polytopes: Abstract, convex and computational”, T. Bisztriczky, P. McMullen, R. Schneider, A. I. Weiss, eds., NATO ASI Series C, vol. 440, Kluwer Acad. Publ., 1944, 301-333. [190] R. D. von Sterneck, Ableitung zahlentheoretischer relationen mit Hilfe eines mehrdimensionalen systemes von Gitterpunkten, Monatscheffe Math. Phys., 8 (1894), 255-266. [191] M. V. Subbarao, On some arithmetic convolutions, Lecture Notes in Math., No.251, 1972, pp. 741-748. [192] M. V. Subbarao, V. C. Harris, A new generalization of Ramanujan sum, J. London Math. Soc., 41 (1966), 395-604. [193] V. V. Subrahmanyasastri, On a certain totient function for generalized integers, Math. Student 37(1969), no. 1, 2, 3, 4, 59-66. 175

CHAPTER 2

[194] D. Suryanarayana, The number of unitary, squarefree divisors of an integer, I. Norske Vid. Selsk. Forh. (Trondheim), 42 (1969), 6-13. [195] D. Suryanarayana, The number of unitary, squarefree divisors of an integer, II. Norske Vid. Selsk. Forh. (Trondheim), 42 (1969), 14-21. [196] D. Suryanarayana, On a theorem of Apostol concerning Möbius functions of order k, Pacific Journal of Math., 68 (1977), 277-281. [197] D. Suryanarayana, Some more remarks on uniform O-estimates for k-free integers, Indian J. Pure Appl. Math., 12 (11) (1981), 1420-1424. [198] D. Suryanarayana and R. Sitaramachandra Rao, The number of bi-unitary divisors of an integer, II., J. Indian Math. Soc., 39 (1975), 261-280. [199] D. Suryanarayana and P. Subrahmanyam, The maximal k-free divisor of m which is prime to n, Acta Math. Acad. Sci. Hung., 33 (1979), 239-260. [200] M. Swetharanyam, A note on the Möbius function, Math. Gaz. XLV (1961), no. 351, 43-47. [201] G. Szász, Einführung in die Verbandstheorie, B. G. Taubner, Leipzig, 1962. [202] M. Tanaka, On the Möbius function and allied functions, Tokyo J. Math. 3(1980), 215-218. [203] P. L. Tchebychef, Note sur differentes séries, J. de Math (1), 16 (1851), 337346. [204] J. Thévenaz, The top homology of the lattice of subgroups of a soluble group, Discrete Math., 55 (1985), 291-303. [205] L. Tóth, Contributions to the theory of arithmetical functions defined by regular convolutions (Romanian), Thesis, Babes¸-Bolyai University, Cluj, 1995. [206] L. Tóth, Asymptotic formulae concerning arithmetical functions defined by cross convolutions, I., Divisor sum functions and Euler type functions, Publ. Math. Debrecen, 50 (1997), 159-176. [207] L. Tóth and J. Sándor, On certain arithmetical products involving regular convolutions, Notes Numb. Th. Discrete Math. (Sofia), 3 (1997), 159-166. [208] R. Tschiersch, Zur Anzahl der Lösungen gewisser Diophantischer Gleichungen, Dissertation 1995, Frankfurt am Main, 1-68. 176


[209] C. Toubi, Une démonstration e´ lémentaire du théorème des idéaux premiers, Sém. Théor. Nombres Bordeaux (2)2(1990), no. 2, 333-348. [210] R. Vaidyanathaswamy, The theory of multiplicative arithmetic functions, Trans. Amer. Math. Soc., 33 (1931), 579-662. [211] A. C. Vasu, V. V. Subrahmanya Sastri and C. S. Venkataraman, On a new class of convolutions and Euler products, J. Indian Math. Soc. (N. S.) 54(1989), no. 1-4, 219-232, corrigenda 55(1990), no. 1-4, 251-252. [212] C. S. Venkataraman and R. Sivaramakrishnan, An extension of Ramanujan’s sum, Math. Student 60 A(1972), 211-216. [213] M. Ward, The algebra of lattice functions, Duke Math. J., 5 (1939), 357-371. [214] R. Warlimont, Arithmetical semigroups. V: Multiplicative functions, Mannscr. Math. 77(1992), no. 4, 361-383. [215] L. Weisner, Abstract theory of inversion of finite series, Trans. Amer. Math. Soc., 38 (1935), 474-484. [216] L. Weisner, Some properties of prime power groups, Trans. Amer. Math. Soc., 38 (1935), 485-492. [217] E. Weisstein, Cyclotomic polynomial, http://mathworld.wolfram.com/CyclotomicPolynomial.html [218] H. Weyl, Algebraic theory of numbers, Princeton Univ. Press, 1940. [219] R. Wiegandt, On the general theory of Möbius inversion formula and Möbius product, Acta Sci. Math. (Szeged), 20 (1959), 164-180. [220] A. Wintner, Eratosthenian averages, Baltimore, 1943. [221] K. L. Yocom, Totally multiplicative functions in regular convolution rings, Canad. Math. Bull., 16 (1973), 119-128. [222] W. Zhang, A generalization of Halász-theorem to Beurling’s generalized integers and its applications, Illinois J. Math. 31(1987), 645-664.

177

Chapter 3

THE MANY FACETS OF EULER’S TOTIENT

3.1

Introduction

Motivated by a generalization of Fermat’s divisibility theorem, in 1760 L. Euler [133] proved that a ϕ(n) ≡ 1(modn) for (a, n) = 1,

(1)

where ϕ(n) denotes the number of positive integers r < n such that (r, n) = 1. Euler studied also other important properties of this function, e.g. the multiplicativity property, which means that ϕ(mn) = ϕ(m)ϕ(n) whenever (m, n) = 1. (2) It was C. F. Gauss (see L. E. Dickson [103]) who introduced the symbol ϕ(n) for Euler’s ϕ-function, making the convention ϕ(1) = 1. In 1879 J. J. Sylvester introduced the word ”totient”, while E. Prouhet (1845) proposed the name ”indicator” (see [103]). Sylvester defined also the ”totatives” of n to be the integers r < n with (r, n) = 1. Euler’s totient is of major interest in number theory, as well as many other fields of mathematics. For example, the apparently simple result (1) allowed mathematicians to build a code which is almost impossible to break, even though the key is made public (see for instance R. Rivest, A. Shamir and L. Adleman [352]). Euler’s totient is connected to many notions and functions of various domains. Gauss proved the identity ϕ(d) = n (3) d|n

179

CHAPTER 3

which by the Möbius inversion formula (see Chapter 2) gives µ(d) 1 =n ( p prime) 1− ϕ(n) = n d p p|n d|n

(4)

For inequalities and estimates connecting ϕ to the arithmetical functions d (number of divisors), σ (sum of divisors), ω (number of distinct prime divisors), (total number of prime divisors), Jk (Jordan’s function), ψ (Dedekind’s function), (von Mangoldt’s function), ϕ ∗ , d ∗ , σ ∗ (unitary analogs of ϕ, d, σ ), etc., see D. S. Mitrinović, J. Sándor and B. Crstici [291] (which we shall call sometimes in what follows Handbook I). On the other hand, many other aspects of Euler’s totient were not considered in [291], for instance: congruence properties similar to (1) (and generalizations and extensions); other congruence properties of ϕ; identities (such as Kesava Menon or Brauer-Rademacher identities); generalizations and extensions of ϕ; various equations involving ϕ; the cyclotomic polynomial; matrices and determinants (as the Smith determinant); connections to congruences, etc. All these subjects will be treated in what follows. In this Introduction we want also to mention certain unfamiliar occurrences of Euler’s totient.

1

The infinitude of primes

E. Kummer (see [27]) derived the following simple proof of the infinitude of primes: suppose p1 < p2 < · · · < pk form the (finite) set of primes. Then by applying the prime factorization, for n = p1 p2 . . . pk we must have ϕ(n) = 1. On the other hand, one has ϕ(n) = ( p1 − 1) . . . ( pk − 1) > 1, a contradiction. Another proof, based on the divisibility property n|ϕ(a n − 1) (a, n > 1 integers)

(5)

is given in M. Deaconescu and J. Sándor [97] (see also J. Sándor [362]). Properties similar to (5) will be studied in the next paragraph.

2

Exact formulae for primes in terms of ϕ

There exist in the literature various exact formulae expressing the n-th prime pn , or the prime-counting function π(n) (i.e. the number of primes ≤ n). For example by Williams, Minácˇ , Sierpinski or Gandhi, see R. Ribenboim [349] (pp. 180-186), or [350] (where one can find also the following statement ”... c’est inutile, mais c’est joli...”). In 1992 K. Atanassov [16] has found the formula π(n) =

n

sg(k − 1 − ϕ(k))

k=2

180

(6)


0, if x = 0 1, if x = 0 He proved also that

where sg x =

pn =

2n

sg(n − π(k))

(7)

k=0

0, if x ≤ 0 1, if x > 0 M. Vassilev [464] proved that

where sg x =

π(n) =

n ϕ(k) k=2

k−1

(8)

where [x] denotes the integer part of x.

3

Infinite series and products involving ϕ, Pillai’s (Cesàro’s) arithmetic functions

Euler’s totient occurs in many identities for special functions or constants. In 1857 J. Liouville (see [103], p. 120) proved that ∞ n=1

xn x ϕ(n) = for |x| < 1. n 1−x (1 − x)2

(9)

More generally, E. Cesàro (see [103], p. 127) showed that ∞ n=1

if F(n) =

∞ xn f (n) = x n f (n), 1 − xn n=1

(10)

f (d). See also G. Pólya and G. Szegö [332] (vol. II, Part 8, paragraph

d|n

7). In [332] one can find also identities like ∞ n=1

xn 1 + x2 ϕ(n) = x (due also to J. Liouville), 1 + xn (1 − x 2 )2 ∞

xn 1+x =x , 1 − xn (1 − x)3

(12)

xn 1 + 2x + 6x 2 + 2x 3 + x 4 = x 1 + xn (1 − x 2 )3

(13)

n=1 ∞ n=1

J2 (n)

(11)

J2 (n)

181

CHAPTER 3

where J2 is the Jordan totient function Jk for k = 2, and |x| < 1. Similarly, ∞ −x (1 − x n )ϕ(n)/n = e 1−x

(14)

n=1

while the infinite product ∞ 1 + x n ϕ(n)/n −1 = e2/(x −x) n 1 − x n=1,odd

(15)

has been proposed by P. J. Forrester and M. L. Glasser [136] (in fact (15) follows from (14) on replacing x by −x). A Mercier [289] generalized (15) as follows: ∞ ∞ 2 F(n)x n /n 1 + x n f (n)/n n=1,odd =e 1 − xn n=1,odd

(16)

where F(n) is given in (10). An interesting infinite product identity, involving also Fibonacci and Lucas numbers Fn and L n is due to D. Redmond [348]: ϕ(n)/n ∞ √ √ Ln = e−(1+ 5)/2 5 (17) √ 5 · Fn n=1 For finite arithmetical products, involving e.g. the gamma-function, too, see [384]. The constant

∞ ∞ 1 1 1+ = 1.78657 . . . (18) = ϕ(n)σ (n) p 2k − p k−1 p prime n=1 k=1 is called also as the ”Silverman constant” (see D. Rusin [357]). For other constants related to the Euler totient function, we quote S. Finch [135]. In the same paper in which he proved (9), Cesàro considered also the sum of (n, i) for i ≤ n, where (n, i) is the g.c.d. of n and i: n i=1

(n, i) =

d|n

dϕ

n d

(19)

The left side of (19) is called often as the Pillai arithmetic function P(n), who in 1933 [330] studied certain properties (without reference to Cesàro) of this function. n n For three extensions of P(n), see R. Sivaramakrishnan [420]. The function (i, n) i=1 occurs also in group theory, and for a common generalization of this function and Pillai’s see J. Sándor and A.-V. Krámer [382]. A generalization involving regular 182


convolutions of Narkiewicz (see Chapter 2) is due to L. Tóth [455] (see [456] for a unitary analogue of P(n), along with asymptotic evaluations). See also [459]. For n other Cesàro type functions, and particularly for the study of [i, n] (where [i, n] = i=1

lcm(i, n)) see H. W. Gould and T. Shonhiwa [153], [154].

4

Enumeration problems on congruences, directed graphs, magic squares

n 2d − 1 in the first term of the product dϕ in reIf one replaces d with d d lation (19), one obtains the solution of an enumeration problem for a congruence equation. More precisely, R. A. Brualdi and M. Newman [56] have shown that the number of n-tuples (x0 , x1 , . . . , xn−1 ) of nonnegative integers such that

n−1 i=0

is given by

xi = n,

n−1

i xi ≡ 0 (mod n)

(20)

i=0

1 2d − 1 n ϕ n d|n d d

(21)

In fact, this result follows also from a theorem by K. G. Ramanathan [344]. The number (21) gives also the number of formally distinct diagonal products of an n by n circulant matrix (see [56]). In 1994 A. Ehrlich [107] defined for two positive integer a and n the directed graph G(a, n) with vertex set {0, 1, . . . , n − 1} such that there is an arc from x to y if and only if y ≡ ax (mod n). Let C(a, n) denote the number of cycles in G(a, n). Erlich proved that C(2, n) is odd or even according as 2 is or not a quadratic residue mod n. (22) E. Brown [54] has considered the general case, by proving that for C(a, n) one has the formula ϕ(d) C(a, n) = (23) or dd (a) d|n where or dd (a) is the least positive integer r such that a r ≡ 1 (mod d). This implies e.g. that for (a, n) = 1, n odd, one has a 1+ n C(a, n) ≡ (mod 2) (24) 2 a where is the Legendre-Jacobi symbol. n 183

CHAPTER 3

For n even, n = 2k n (n odd) C(a, n) is even, for k = 1; and −1 1− n (mod 2) (25) C(a, n) ≡ 2 A generalization of Euler’s totient is the Schemmel totient function (see [103]), defined by S2 (n) = car d{(x, x + 1) : 0 < x, (x, n) = (x + 1, n) = 1, x ≤ n}. It can be proved that 2 (26) 1− S2 (n) = n p p|n D. N. Lehmer [244] used Schemmel’s totient to the enumeration problem of certain magic squares. Many other generalizations of Euler’s totient will be studied in the next paragraphs of this Chapter.

5

Fourier coefficients of even functions (mod n)

Let n be a fixed positive integer, and let F be a field of characteristic 0 containing the nth roots of unity. In 1952 E. Cohen [76] defined a function f : N → F to be (n, F)-arithmetic, if f (a) = f (b) whenever a ≡ b (mod n). An example of such a function is f (a) = exp(2πi ja/n) which is (n, F)-arithmetic for any integer j. Let An (F) denote the set of all (n, F)-arithmetic functions. If f ∈ An (F), then f is called even (mod n) if f (a) = f ((a, n)), where (a, n) denotes the greatest common divisor of a and n. Taking F = C, the field of complex numbers, let Bn (C) denote the set of even functions (mod n). Let C(a, d) be the Ramanujan sum, defined by C(a, d) = e(ax, d) (27) (x,d)=1, 1≤x≤d

with e(a, b) = e2πia/b . In fact C(a, d) can be defined for all integers a, and positive integers d, leading to a common generalization of Euler’s totient ϕ, and Möbius’ function µ. Indeed, it is immediate that C(0, d) = ϕ(d), C(1, d) = µ(d) for all d ≥ 1

(28)

E. Cohen [77] proved that if f ∈ Bn (C), then f can be written uniquely as f (a) = α(d)C(a, d), (29) d|n

where the coefficients α(d), d|n are called as the Fourier coefficients of f . These coefficients may be explicitly written (see P. J. McCarthy [382]) as 1 α(d) = f (a)C(a, n) (30) nϕ(d) a (mod n) 184


For f, g ∈ Br (C) let us introduce the inner product n n = (ϕ ∗ f g)(n) ϕ(d) f g f, g = d d d|n

(31)

where g(a) = g(a) is the complex conjugate of g(a), and ∗ is the Dirichlet convolution. It is known (see J. Knopfmacher [229]) that Bn (C), ·, · ) is a complex Hilbert space, with norm

1/2 2

f = n |α(d)| ϕ(d) (32) d|n

P. Haukkanen and R. Sivaramakrishnan [189] have introduced a subspace Sq (C) of Bn (C) as follows. Let f ∈ Bn (C) and q be a fixed divisor of n. Associated with f , one can construct an even function f (a, q) (even (mod n)) by defining α(d)C(a, d) (33) f (a, q) = d|q

If d|n, d q, then α(d) = 0 in the representation of f (a, q) as an element of Bn (C) (therefore we have actually a truncated sum). Let Sq (C) be the set of functions of form (33). Then Sq (C) becomes a subspace of Bn (C), of dimension d(q), where d is the number-of-divisor function. By the Riesz representation theorem one can write Br (C) = Sq (C) ⊕ Sq⊥ (C)

(34)

where Sq⊥ (C) is the orthogonal complement of Sq (C) (of dimension d(n) − d(q)). The set 1 C(·, d) : d|n (35) (nϕ(d))1/2 forms an orthonormal basis of the Hilbert space Bn (C) (see [189]). For a measure theoretic approach, as well as linear transformations, see [189]. For multiple trigonometric sums, a similar study has been done in [190].

6

Algebraic independence of arithmetic functions

In 1948 R. Bellman and H. N. Shapiro [36] have introduced a notion of algebraic independence of real valued arithmetic functions. A set of arithmetic functions f i (i = 1, N ), f i : N → R are called algebraic independent over R if there exists no polynomial P(X 1 , . . . , X N ) ≡ 0 with real coefficients, which is irreducible over R N such that P( f 1 (n), . . . , f N (n)) = 0, for all n ∈ N (36) 185

CHAPTER 3

Bellman and Shapiro obtain various general theorems, for example: Let E : N → R be the identity function; i.e. E(n) = n for all n; and let f be a multiplicative function. If E and f are algebraically dependent, then f (n) = n r , n ∈ N (where r is a fixed rational number). (37) Let f k+1 (n) = f k (d), k = 0, N , where f 0 is multiplicative, and suppose d|n

that f 0 ( p) takes on an infinite set of values over some set of primes p ∈ P. Then f 0 , . . . , f N are algebraically independent. (38) As a corollary one gets that the functions E, ϕ, σ are algebraically independent

(39)

Another result says that

as well as:

7

E, ϕ, σ, d, d ∗ are algebraically independent

(40)

E, ϕ, σ, d, d ∗ , µ are algebraically independent

(41)

Algebraic and analytic application of totients

In what follows, in this Introduction we mention an algebraic and an analytic application of totients. Jordan’s totient Jk is defined by Jk (n) = car d{(a1 , . . . , ak ) : 1 ≤ a1 , a2 , . . . , ak ≤ n, (a1 , . . . , ak , n) = 1}

(42)

Clearly J1 ≡ ϕ. This function has applications in the theory of linear groups (see C. Jordan [216]). For some recent applications in group theory, see J. Schulte [400]. R. Guitart [167] has applied this function to explicit computation of internal exponentiation of isomorphic classes of objects in the topos of permutations. See also [168]. The function Jk should not be confused with Jk , given by Jk (n) = car d{(a1 , . . . , ak ) : 1 ≤ a1 ≤ a2 ≤ · · · ≤ ak ≤ n, (a1 , . . . , ak , n) = 1} (42 ) n k µ(d) , one has on the other hand, While Jk (n) = d d|n Jk (n)

=

d|n

µ

n d + k − 1 d 186

k


For the more general functions Jkm (n), where in (42) 1 ≤ a1 , . . . , ak ≤ n and (a1 , . . . , ak , m) = 1; and Jkm (n) where in (42’), 1 ≤ a1 ≤ · · · ≤ ak ≤ n, and (a1 , . . . , ak , m) = 1, see T. Shonhiwa [412]. Remark that Jkn (n) = Jk (n) and Jkn (n) = Jk (n). Shonhiwa studies also the functions Jk (n) = car d{(a1 , . . . , ak ) : 1 ≤ a1 < a2 < · · · < ak ≤ n, (a1 , . . . , ak , n) = 1}, and the corresponding function Jk m (n). For example, one has n d Jk (n) = µ d k d|n The sum-of-divisors function σ is strongly related to Euler’s totient (see [291]). Now the following inequality is equivalent to the famous Riemann Hypothesis on the zeta function: The Riemann Hypothesis is true if and only if, for sufficiently large n one has σ (n) < eγ n log log n

(43)

(Here γ is Euler’s constant). This is due to G. Robin [354].

1 Recently A. Verjovsky [470] proved the following result: Let ≤ a ≤ 1. Then 2 the Riemann zeta function has no zeros in the half-plane Re s > a if and only if ∞ n=1

ϕ(n) f

n x

= m 0 ( f, x) + O(x a+ε ),

ε > 0,

(44)

for any smooth function f : R+ → R with compact support, where ∞ 6 m 0 ( f, x) = 2 x 2 t f (t)dt. π 0

8

ϕ-convergence of Schoenberg

In 1959 I. J. Schoenberg [398] defined the ϕ-convergence of a sequence {γn } of real numbers as follows: ϕ − limit γn = λ if and only if lim sn = λ, where n→∞

sn =

1 ϕ(d)γd n d|n

A sequence which is ϕ-convergent, but not convergent is given e.g. by 1, if n = 2 · 3 · 5 . . . pk γn = 0, otherwise 187

(45)

CHAPTER 3

where pk is the kth prime (see the solution of Problem 6090 [361]). Schoenberg proved that if {n k } is a given sequence of increasing natural numbers, then the assumption ϕ − limit γn = λ implies that lim γn k = λ if and only if k→∞

lim inf ϕ(n k )/n k > 0 k→∞

(46)

From the existence of an asymptotic distribution function for ϕ(n)/n, it follows that if the sequence (n k ) has the property that lim ϕ(n k )/n k = 0, then the density of k→∞

(n k ) is 0. Write d − lim γn = λ if d{n : |γn − λ| ≥ ε} = 0 for every ε > 0, where d denotes (asymptotic) density. Now, Schoenberg proves that if ϕ − lim γn = λ, then one has also d − lim γn = λ. (47) 1, n = prime The converse is evidently false (put γn = ). 0, otherwise A criterion for d − lim γn = λ is contained in the following necessary and sufficient condition: 1 lim (eitγ1 + eitγ2 + · · · + eitγn ) = eitλ (48) n→∞ n for every real t (see [398]).

3.2 1

Congruence properties of Euler’s totient and related functions Euler’s divisibility theorem

The most famous congruence property of Euler’s totient is clearly Euler’s divisibility theorem (see also paragraph 3.1): a ϕ(n) ≡ 1 (mod n) for (a, n) = 1

(1)

For the early history of this theorem, one can find in Dickson’s book [103], that in 1776 P. S. Laplace obtained a proof different from Euler’s. In 1831 V. Bouniakowsky gave a proof similar to that by Laplace, while in 1832 Giovanni de Paoli gave another proof. In 1845 L. Poinsot proved Euler’s theorem by geometrical considerations: Let a be prime to n and < n. Join any vertex of a regular polygon of n sides with the ath vertex following it, the new vertex with the ath vertex following it, etc., thus defining a regular star polygon of n sides. With the same a, derive similarly a new n-gon, etc., until the initial polygon is reached. The number k of distinct polygons thus obtained is seen to be a divisor of ϕ(n), the number of polygons corresponding to the various 188


a’s. If in the initial polygon we take the a k th vertex following any one, etc., we obtain the initial polygon. Hence a k , so a ϕ(n) has the remainder unity when divided by n. In 1896 H. Weber deduced the first proof of (1) based on Group theoretical considerations. In 1913 G. Frattini noted that if F = F(a, b, . . . ) is a homogeneous symmetric polynomial, of degree g with integral coefficients, in the integers a, b, . . . less than n and prime to n, and if F is prime to n, then kg ≡ 1

(mod n) for any integer k, (k, n) = 1

(2)

In fact, F(a, b, . . . ) ≡ F(ka, kb, . . . ) ≡ k g F(a, b, . . . ) (mod n). So if F = ab . . . , we reobtain Euler’s theorem. There is an interest, even today in the new proofs of Euler’s theorem. See H. Alzer [8] (where, in fact Rédei’s theorem (11) is proved). K. Heinrich and P. Horak [197] obtain a combinatorial proof of (1) when m is a prime power. The proof of the general case follows from this fact by usual methods. For combinatorial and geometrical investigations of congruence theorems, see also K. Härtig and J. Surányi [180]. R. T. Hansen [176] formulated for general a and n as follows: Let (a, n) = d. (1) n ϕ(n)+1 Then a = 1. (1 ) ≡ a (mod n) iff d, d

2

Carmichael’s function, maximal generalization of Fermat’s theorem

It follows from Euler’s theorem that if (a, n) = 1, there exists the smallest positive exponent r such that a r ≡ 1 (mod n), (3) called the order of a modulo n, and denoted r = or dn (a). It is immediate that a m ≡ 1 (mod n) if and only if m is a multiple of r ; thus in particular, r |ϕ(n). It is natural to ask: given n > 2, does there always exist an integer a, (a, n) = 1 such that or dn (a) = ϕ(n)? When n = p is a prime, such numbers exist, namely the primitive roots mod p. If n = p k , p odd prime, it is also true. However, if n is divisible by 4 p, or pq, where p, q are distinct odd primes, then there is no number a, (a, n) = 1 such that or dn (a) = ϕ(n). Indeed, in 1910 R. D. Carmichael [65] (see also [66]) introduced a function λ, defined as follows: λ(1) = 1, λ(2) = 1, λ(4) = 2, λ(2a ) = 2a−2 (r ≥ 3), λ( pa ) = ϕ( pa ) = pa−1 ( p − 1) (r ≥ 1, p odd prime); λ(2a p1a1 p2a2 . . . psas ) = [λ(2a ), λ( p1a1 ), . . . , λ( psas )] where [. . . ] denotes the least common multiple. 189

(4)

CHAPTER 3

Note that λ(n)|ϕ(n)

(5)

so λ(n) ≤ ϕ(n), but λ(n) = ϕ(n) only for n = 1, 2, 4, pa , 2 pa . Carmichael proved the following divisibility theorem: a λ(n) ≡ 1 (mod n) for (a, n) = 1

(6)

As a corollary of (6) one obtains that, except for the cases n = 1, 2, 4, pa or 2 pa , we have 1 a 2 ϕ(n) ≡ 1 (mod n) (6 ) He also showed that there always exists an element a such that or dn (a) = λ(n). One can find in [103] that E. Lucas (1890) stated, without proof the following result: Let n = p1a1 p2a2 . . . pkak be the prime factorization of n and put H (n) = max{a1 , a2 , . . . , ak }.

(7)

Then for all positive integers a and n a λ(n)+H (n) ≡ a H (n)

(mod n)

(8)

This is a maximal generalization of Fermat’s theorem written in the form a p ≡ a (mod p) for any prime p, any integer a. For a proof of (8), see D. Singmaster [419]. The fact that (8) is maximal generalization, follows also from the following remark (see [419]): Let r > s. Then a r ≡ a s (mod n) for all a and n iff λ(n)|(r − s) and s ≥ H (n). (9) The following inequalities are true: λ(n) + H (n) ≤ ϕ(n) + H (n) ≤ n

(10)

with simultaneous equality iff n is prime, or n = 4. From (8), (9), (10) the following corollaries can be stated: a n ≡ a n−ϕ(n) ≡ a n−λ(n) a ϕ(n)+H (n) ≡ a H (n)

(mod n);

(mod n), for any a and n.

(11) (12)

We note that the first congruence of (11) is attributed to L. Rédei (see T. Szele [451], S. Schwarz [404]), while (12) is mentioned in N. Nielsen [321]. It is interesting to note also that Carmichael’s theorem (6) has applications in the theory of the so-called ”3x + 1 problem” (a famous unsolved problem), see J. C. Lagarias [234] and E. Belaga and M. Mignotte [35]. 190


In [404] and [403] S. Schwarz developed a semigroup approach to the Fermat and Euler’s theorems. In 1996 M. Laˇssˇa´ k and S, Porubský [240] generalized the idea to finite commutative rings, and to residually finite Dedekind domains. (For Dedekind domains, see also W. Narkiewicz [314]). F. Smarandache [430] obtained a generalization of Euler’s theorem by applying a terminating divisibility algorithm. For a best possible variant of this result, with an algebraic extension, see the recent paper by S. Porubský [338]. A generalization of another type of Euler’s theorem, involving Lucas sequences, appears in [349] (see pp. 53-63). This result is based on a Lucas sequence-generalization of Euler’s totient function, and was proved essentially by E. Lucas in 1877 (see [103], p. 398).

3

Gauss’ divisibility theorem

In 1770 J. L. Lagrange (see [103]) obtained a common generalization of Fermat’s and Wilson’s divisibility theorem: a p−1 − 1 ≡

p−1 (a − i) (mod p)

(13)

i=1

Indeed, for a prime p, and for (a, p) = 1, a p−1 ≡ 0 (mod p). Comparing the constants on both sides of (13) one obtains Wilson’s theorem ( p − 1)! + 1 ≡ 0

(mod p)

(14)

For the early history of Wilson’s theorem, and generalizations, see [103]. In a little known paper, N. Gruber [158] has proposed to study (13) for composite n (in place of p − 1) in the following manner: a ϕ(n) − 1 ≡ (a − a1 )(a − a2 ) . . . (a − aϕ(n) ) (mod n)

(15)

where a1 , a2 , . . . , aϕ(n) is a complete system of reduced residues (mod n) (i.e. (ai , n) = 1 for i = 1, ϕ(n). It is proved in [158] that (15) holds true for all composite n and all a if and only if n = 4 or n = 2Fk , where Fk is a Fermat prime (i.e. k Fk = 22 + 1, prime). (16) A different kind of generalization of Fermat’s theorem was first stated by K. F. Gauss (see [103]) in 1863: G a (n) = µ(d)a n/d ≡ 0 (mod n) for all a, n. (17) d|n

In fact, Gauss proved (17) only for a = prime, while the case a = p m ( p prime) 1 is due to T. Schönemann (1846), who showed that G a (n) in this case is the number n 191

CHAPTER 3

of all irreducible polynomials over the finite field of p m elements. The first proof for general a is due to J. A. Serret (1855). In 1880 S. Kantor deduced (17) by proving that 1 G a (n) is the number of cyclic groups of order n in any birational transformation of n order a in the plane. In 1899 L. E. Dickson obtained an inductive proof. He showed also that ϕ(d) (18) G a (n) = d|(a n −1), d (a s −1) f or sK ≥H

Then for any a ∈ Z \ {0}, µ(H, T )a c(T ) ≡ 0

(mod |NG (H )|/|H |)

(24)

T ≥H

4

Minimal, normal, and average order of Carmichael’s function

As we have seen, Carmichael’s λ function is closely related to Euler’s totient. For an applet, which computes the values ϕ(n) and λ(n), see the Internet address: http://www.math-it.de/Mathematik/Zahlentheorie/Zahl/ZahlApplet.html Relations (10) inform us on certain estimates related to ϕ, λ and H . We note that the following elementary properties of H are true (see [419]) a|b ⇒ H (a) ≤ H (b);

(25)

max{H (a), H (b)} ≤ H (a, b) ≤ H (a) + H (b);

(26)

(a, b) = 1 ⇒ H (a, b) = max{H (a), H (b)}

(27)

In what follows we shall investigate the minimal, normal, and average order of Carmichael’s function λ. Estimates for the minimal order are implicitly stated in the analysis of the primality testing arguments of L. M. Adleman, C. Pomerance and R. S. Rumely [1]. These are stated explicitly in P. Erdös, C. Pomerance and E. Schmutz [129] as follows: For any increasing sequence (n i ) of positive integers, and any positive constant c0 < 1/ log 2 one has λ(n i ) > (log n i )c0 log log log ni (28) for sufficiently large i. On the other hand, there exists a sequence m 1 < m 2 < · · · < . . . and a constant c1 with λ(m i ) < (log m i )c1 log log log m i for all i. (29) 193

CHAPTER 3

λ(n) was stated without proof in P. Erdös The normal order of magnitude of log n [109]. A stronger result appears in [129]: There is a set S of positive integers of aymptotic density 1 such that, for all n ∈ S one has −1+ε λ(n) = n/(log n)log log log n+A+O(log log log n) (30) log p where A = −1 + = .2269688 . . . , and ε > 0 is fixed, but arbitrarily ( p − 1)2 p prime small. In [109] appeared also without proof an estimate for the average order of λ: for all ε > 0, k > 0 and x > x0 (ε, k), 1 x x λ(n) ≤ (log log x)k ≤ log x x n≤x (log x)1−ε The following sharper result appears in [129]: For all x ≥ 16, we have B log log x x 1 exp (1 + o(1)) λ(n) = x n≤x log x log log log x 1 = .34537 . . . ( p − 1)2 ( p + 1) p prime As a corollary of theorem (30) we obtain that ϕ(n) < (log log n)2 , n ∈ S P λ(n)

where B = e−γ

(31)

(32)

1−

(33)

where S has asymptotic density 1, and P(r ) denotes the greatest prime divisor of r . (For many results on the function P, see [291], Chapter 4). Let N (k) be the number of solutions to λ(n) = k. The following results appear in [129] (without proof): N (k) < exp[exp[(log 2 + o(1)) log k/(log log k)],

(34)

for all k ≥ k0 , and N (k) > exp[exp[(c2 − o(1)) log k/(log log k)]] for infinitely many k (where c2 is a constant).

194

(35)


Similarly, for car d{n : λ(n) ≤ x} one has the estimates: (c2 − o(1)) log x < car d{n : λ(n) ≤ x} < exp exp log log x (log 2 + o(1)) log x < exp exp log log x

(36)

Let Rλ (x) = car d{m ≤ x : m = λ(n)}. The exact order of Rλ is not known. Clearly Rλ (x) = o(x) (37) since few numbers have a large divisor of the form p − 1 (see P. Erdös and S. S. Wagstaff, Jr. [132]). On the other hand, Rλ (x)

x log x

(38)

since this is already attained on the primes. The authors of [129] conjecture that Rλ (x) = x/(log x)c+o(1)

(39)

where c is a constant. Probably c ∈ (0, 1), but the correct value of c remains in doubt.

5

Divisibility properties of iteration of ϕ

Certain properties of the iteration of ϕ were included in [291], Chapter 1. Here we will study the divisibility properties of ϕ ( j) , where ϕ (1) (n) = ϕ(n), ϕ ( j) (n) = ϕ(ϕ ( j−1) (n)) ( j > 1), as well as of certain related functions. W. Sierpinski [414] determined all n such that ϕ(n)|n

(40)

It is not difficult to see that all solutions of (40) are n = 1, and n = 2a · 3b , where a > 0, b ≥ 0. (41) F. Smarandache [431] has considered mϕ(n)|n, for a fixed m, but clearly this implies (40). In 1982 M. Hausman [193] completely described the solutions of ϕ ( j) (n)|n

(42)

This was rediscovered in 1989 by D. Marcu [284]. However, in 1988 V. Siva Rama Prasad and Ph. Fonseca [423] have studied a general class of functions, including (42).

195

CHAPTER 3

For j = 2, the solutions of (42) are n = 1, 2a , 3, 2a · 3b , 2a · 5, 2a · 7, where a, b ≥ 1

(43)

This has been rediscovered by L. Tóth [454], too. A problem proposed by A. H. Stein [438] asks for the determination of all pairs of positive integers m, n such that ϕ(m)|n and ϕ(n)|m

(44)

For m = n this generalizes Sierpinski’s problem (40). It is not difficult to see that the relations of (44) imply that ϕ(ϕ(n))|n, ϕ(ϕ(m))|m so n, m, must be in the sets of (43). Another method is based on the fact that all solutions can be generated by primitive solutions (m, n), i.e. when gcd(m, n) = squarefree. Since ϕ( pn) = pϕ(n) for p|n, p prime, all other solutions can be obtained from primitive ones by the following rule: If p is a prime dividing both m and n, then the pair (m, n) is a solution iff the pair ( pm, pn) is a solution. There are eleven primitive pairs of solutions, namely: (1,1), (1,2), (2,2), (2,3), (2,4), (2,6), (4,6), (4,10), (6,6), (6,14) and (6,18). (45) In 1950 H. N. Shapiro [411] introduced a class F of arithmetic functions f which r are of the form: f (1) = 1 and if 1 < n = piai is the prime factorization of n, then i=1

f (n) =

r

f ( pi )[A( pi )]ai −1

(46)

i=1

where f ( pi ), A( pi ) are integers satisfying 0 < f ( pi ) < pi , 0 < A( pi ) ≤ pi , f ( pi )A( pi ) > 1 for odd primes pi (i = 1, r ), while f (2) = 1, A(2) = 2. Since f (n) < n, whenever n > 2, by denoting by f (k) the kth iterate of f , for n > 2 there is a unique integer k = k f (n) such that f (k) (n) = 2.

(47)

Define k f (1) = k f (2) = 0, and put c f (n) =

if n is odd, k f (n), k f (n) + 1, if n is even

(48)

Shapiro proved that for any f ∈ F, the function c f is completely additive, i.e. c f (mn) = c f (m) + c f (n) for all m, n; iff f ( p) is even, and c f (2A( p)) = c f ( p) + 1 for all odd primes p. (49) 196


Let now f ∈ F such that (49) is true, and let {qi } denote the sequence of odd primes in increasing order. Let F1 be the class of all f ∈ F such that f (qi ) = qi − εi and A(qi ) = qi

(50)

where (εi ) are odd integers satisfying 0 < εi < qi , i = 1, 2, 3, . . . Remark. If εi = 1 for all i, then by (46) and (50) one gets f = ϕ, so that ϕ ∈ F1 . Clearly, the set F1 is uncountable. Let f ∈ F1 , and define S f ( j) = {n ∈ N : f ( j) (n)|n}, i.e. the set of n such that (42) holds true. Let P f ( j) denote the set of primitive solutions of (42), i.e. n P f ( j) = n ∈ N : n ∈ S f ( j) and ∈ S f ( j) 2

(51)

(52)

Siva Rama Prasad and Fonseca [423] have proved the following result: For f ∈ F1 , j ≥ 1 one has ∞ 2i P f ( j); (53) S f ( j) = i=0

therefore it is enough to characterize the primitive solutions. For these, the following theorem is valid: Let n ∈ P f ( j). Then: c f (n) < j iff n is odd;

(54)

c f (n) = j iff n = 2m, where m is odd, and c f (m) = j − 1;

(55)

c f (n) > j iff n = 2(εi + 2)l , for some i and l ≥ j.

(56)

(Here c f (n) is given by (48)). Since ϕ ∈ F1 , results (53)-(56) are extensions of the theorems by Sierpinski, Hausman. Another generalization of (42) has been studied by F. Halter-Koch and W. Steindl [175], namely ϕ ( j) (n)|Qn (57) where Q is a fixed positive integer. Let S Q ( j) = {n ∈ N : ϕ ( j) (n)|Qn}, n PQ ( j) = n ∈ N : n ∈ S Q ( j), ∈ S Q ( j) 2 197

(58) (59)

CHAPTER 3

and C(n) = min{ j ≥ 0 : ϕ ( j) (n) ≤ 2}

(60)

S Q ( j) = {2k n : m ∈ PQ ( j), k ≥ 0},

(61)

Since

we need a characterization of primitive solutions given by (59). It can be shown that if C(n) < j, then n ∈ S Q ( j) and n ∈ PQ ( j) only when 2 n. If C(n) ≥ j, Q odd, and n ∈ PQ ( j), then n ≡ 2 (mod 4). For odd n one has n ∈ S2Q ( j) \ S Q ( j) only if 2n ∈ PQ ( j). (62) If Q is odd, then if n ∈ PQ ( j) and C(n) ≥ j, then n ≡ 2 (mod 4). If n ≡ 2 (mod 4), and C(n) = j, then n ∈ PQ ( j). So we may assume in what follows C(n) > j. For odd Q the following complete characterization is true (see [175]): Let Q be odd, and suppose C(n) > j. Then n ∈ PQ ( j) if and only if one of the following cases holds true. a) n = 2 · 3s with s ≥ j + 1; b) n = 2 p, where p is a prime of the form p = 2 · 3s + 1, with s ≥ max{2, j} and 3s+1− j |Q; c) n = 2 j ( p + 1) − 2, where p > 3 is a prime such that p−1 j |(2 − 1)Q, and the numbers 2r p + 2r − 1 (r = 0, 1, . . . , j − 1) 2 are all primes. (63) When Q is even, a similar characterization is an open question. By assuming Schinzel’s Hypothesis H (see e.g. [414]) for linear polynomials, the following can be proved (see [175]): Let p be a prime, and put L = C( p). Let j ≥ L + 2. Then there exist infinitely many even numbers Q such that 2 L Q and for each such Q there is an n ∈ PQ ( j) with p|n, but p Q. (64) For certain remarks on the divisibility properties of the iteration of Euler’s totient, see also W. Steindl [439]. By studying certain asymptotic properties of functions like ϕ ( j) (n)/ϕ ( j+1) (n), P. Erdös, A. Granville, C. Pomerance and C. Spiro [124] (see also [291] for details) proved also certain results on prime factors of ϕ ( j) (n). For example: There is a positive absolute constant c > 0, such that the set of natural numbers n, for which there is some j with ϕ ( j) divisible by every prime up to (log n)c , has asymptotic density 1. (65) 198


Let (n) = n

∞

ϕ ( j) (n). Then

j=1

log n ω( (n)) ≤ log 2

(66)

(Here ω(m) denotes the number of distinct prime factors of m). In particular, for all n there is some prime p, with p log n log log n such that p (n)

(67)

The following two conjectures are also stated in [124]: 1) For each prime p, let N (x, p) denote the number of n ≤ x with p| (n). Then for every ε > 0, N (x, p) = o(x) uniformly for p > (log x)1+ε ; (68) (69) and N (x, p) ∼ x uniformly for p < (log x)1−ε . 2) For each ε > 0, the upper asymptotic density of the set {n ∈ N : ω(ϕ ( j) (n)) > n ε } tends to 0 as j → ∞ (70) The authors state (without proof) that by sieve methods they can prove (70) for ε > 2/3. Results related to the distribution of the distinct prime divisors of ϕ(n) are summarized in [291]. Recently these have been extended to the iteration function ϕ ( j) (n) as follows (see N. L. Bassily, I. Kátai and M. Wijsmuller [29]): √ For each fixed integer j ≥ 1 let a j = 1/( j + 1)! and b j = 1/ 2 j + 1 · ( j!). Then for each real number z, ω(ϕ ( j) (n)) − a j (log log x) j+1 1 lim car d n ≤ x : 0 constants. It is not known if m(n) ∼ cx log x

(82 )

n≤x

for certain constant c (see I. Z. Ruzsa [359]). Finally we note that Murányi used the notation m(n) = grav(n) (i.e. the ”gravaritm” of n), in concordance with the logarithm of n.

6

Congruence properties of ϕ and related functions

We now study other congruence properties of Euler’s totient and related functions. Perhaps, the simplest congruence satisfied by ϕ(n) is ϕ(n) ≡ 0

(mod 2) for n ≥ 3

(83)

From the known form of ϕ (see formula (4) of 3.1) it follows that if for each prime p|n ⇒ p|m, then ϕ(mn) = nϕ(m) (84) Particularly, if n = p (prime), and p|m, then ϕ(mp) = pϕ(m), a formula frequently used in the theory of Euler’s totient. This is due to J. A. Grunert (see [103], p. 117). Another simple, but useful divisibility property of ϕ is m|n ⇒ ϕ(m)|ϕ(n) (so, ϕ(m) ≤ ϕ(n))

(85)

As a consequence of (85), ϕ(m)ϕ(n)|ϕ(mn) ⇔ gcd(m, n) ∈ {1} ∪ {2a · 3b : a > 0, b ≥ 0}

(86)

d , where d = gcd(m, n) (due to ϕ(d) E. Prouhet ([103], p. 118), we must have ϕ(d)|d, and this is Sierpinski’s relation (40), Indeed, by the identity ϕ(mn) = ϕ(m)ϕ(n)

201

CHAPTER 3

having solutions given by (41). A similar property is ϕ(mn) = (m, n)ϕ([m, n]), due to E. Lucas [272]. A counterpart of (85) is m|n, m < n ⇒ n − ϕ(n) > m − ϕ(m)

(87)

(see I. Niven and H. S. Zuckerman [323] (problem 22 of 2.4)). In 1913 U. Scarpis (see [103]) proved that if a is a prime, then n|ϕ(a n − 1) for all n ≥ 1, a ≥ 2.

(88)

In fact, (88) is true for all positive integers a. Indeed, since a n ≡ 1 (mod a n − 1), (a, a n − 1) = 1, but a s ≡ 1 (mod a n − 1) for s < n, so the order of a in Z a∗n −1 (the multiplicative group of reduced classes (mod a n − 1)) is n, which divides the order of the group, i.e. ϕ(a n − 1). More generally, N. G. Guderson [164] proved that if a > b and m = γ (n) = greatest squarefree divisor of n, then n2 |ϕ(a n − bn ), and n|ϕ(a n + bn ) γ (n)

(89)

See also P. Kesava Menon [221] for related results. See also a problem by R. E. Shafer [409] for the second relation of (89). In 1961 A. Rotkiewicz [356], by using (85) and the Zsigmondy-Birkhoff-Vandiver theorem on prime divisors of a n −bn (see e.g. [349], p. 43) deduced that T (n)|ϕ(a n − bn ) if a > b, n ≥ 1

(90)

where T (n) denotes the product of divisors of n. (In fact, T (n) = n d(n)/2 , where d(n) is the number of divisors of n, see Chapter 1). M. Deaconescu and J. Sándor [97] (see also J. Sándor ([363], pp. 232-233)) have considered functions f : N → N such that n| f (a n − 1) for all n, a > 1.

(91)

Relation (91) is true iff ϕ(n)| f (n) for all n. Related to the factors of a n − bn is also the following non-divisibility property (see [364], ([363], pp. 230-231)). Let a > b, (a, b) = 1. Suppose that (a, n) = (b, n) = (a − b, n) = 1. Then n (a n − bn ), and n (a n−ϕ(n) − bn−ϕ(n) )

(92)

n (2n−ϕ(n) − 1) for any n > 1.

(93)

Particularly,

202


An improvement of (88) is due to H. Gupta [169]: For all a ≥ 2, p prime and j ≥ 1 one has p j ( j+1)/2 |ϕ(a p − 1) j

(94) j

This implies (88). Indeed, writing n = kp j with (k, p) = 1, since p j |ϕ(b p − 1) for all b ≥ 2, putting b = a k one gets p j |ϕ(a n − 1), and the result follows. Another improvement of (88) is the following divisibility property (see M. Deaconescu and J. Sándor [98]): n|ϕ(φn (a)) for all n ≥ 1, a ≥ 2

(94 )

where φn denotes the nth cyclotomic polynomial. Since φn (a)|(a n − 1), by (85) we get that (88) is a consequence of (94 ) (by the transitivity property of ”|”). Another refinement is n a −1 m|n, m < n ⇒ n|ϕ |ϕ(a n − 1), (94 ) am − 1 see [98]. There are also some congruence properties of the totient function, which are connected to other number-theoretical functions. For example, M. V. Subbarao [443] considered the relations ϕ(n)|(nσ (n) − 2),

(95)

n|(ϕ(n)d(n) + 2)

(96)

Clearly, (95) and (96) are satisfied by any n = p (prime). On the other hand, it is not difficult to see that all composite solutions of (95) are n = 4, 6 and 22. (97) The determination of all composite solutions of (96), however, is an Open problem (see [443]). Though n = 4 is a solution, no other solution is known. If n > 4 composite satisfies (96), Subbarao proves that n must have at least 4 distinct prime factors; n is squarefree; if p is an odd prime divisor of n, then there is no prime divisor of the form px + 1; if ϕ(n)d(n) + 2 = K n, then K and n are of opposite parity, and 4 K . (98) Also, for 1 ≤ K ≤ 1023 the possible number of prime divisors of n is studied. M. Zhang [486] considers the divisibility n|(ϕ(n) + σ (n)),

(99)

and proves that numbers of the form n = p α (α > 1) or n = p α q (α ≥ 1), where p, q are distinct primes, are not solutions of (99). For n < 107 there are 17 composite solutions. (Clearly, all n = p are solutions). The following Open problems are stated: 203

CHAPTER 3

a) Is there a solution n of (99) with ω(n) = 2? b) Is there an odd composite solution? c) Is there a solution n ≡ 2 (mod 6)? d) Are there infinitely many composite solutions? (100) For the values of ϕ at Fibonacci, or Lucas numbers, S. Singh [418] proves the following (note that 4|ϕ(Fn ) for all n ≥ 5, see C. Kimberling [224] (see also V. E. Hogatt and H. Edgar [113])) 2n|ϕ(F2n ), if n = 1, 2, 3, 4, 8, 16;

(101)

80n|ϕ(F5n ), if n > 1 is odd;

(102)

n|ϕ(L n ), if n > 3 is odd;

(103)

10n|ϕ(L 5n ), for all n;

(104)

2n |ϕ(L 2n+1 ), for all n.

(105)

The congruences like ϕ(F2n+1 ) ≡ 0 (mod 2n + 1)), ϕ(L 2n ) ≡ 0 (mod 2n) are not true in general. It is conjectured that 2n |ϕ(L 2n ) for infinitely n

7

(106)

Euler’s totient in residue classes

K. Ford [137] remarks that the following congruences are true: ϕ(n) ≡ 1 (mod 6) iff n = p 2α or 2 p 2α , (107) If n > 6, then 2 where α is a positive integer, and p is a prime, p ≡ 11 (mod 12). Similarly, ϕ(n) (108) ≡ 3 (mod 6) is n = p α or 2 p α , 2 where α is a positive integer, and p ≡ 7 (mod 12) is a prime; or else p = 3 and α > 1. ϕ(n) (109) ≡ 5 (mod 6) iff n = p 2α−1 or 2 p 2α−1 , 2 where α is a positive integer, and p ≡ 11 (mod 12) is a prime. ϕ(n) Relations (107)-(109) together cover all residues of (mod 6). Similar con2 gruences can be determined for any modulus of the form 2q, where q is an odd prime, or more generally to find all integers n such that ϕ(n) ≡k 2

(mod 2q),

204

(110)


where k is odd (see [137]). Let Sm,r denote the set of integers n with ϕ(n) ≡ r

(mod m)

(111)

Then e.g. (107) can be rewritten as S12,2 = {3, 4, 6} ∪ {n : n or n/2 = p 2α } where p ≡ 11 (mod 12), etc. Let N (x, m, r ) = car d{n ∈ Sm,r : n ≤ x}, (112) which counts how many members Sm,r has up to x. P. Erdös (see [102]) proved the asymptotic result: N (x, m, 0) ∼ x as x → ∞,

(113)

for any integer m. The following asymptotic results are considered in the cases m = 12 or m = 3 (see T. Dence and C. Pomerance [102]) √ x 1 1 + √ ; (114) N (x, 12, 2) ∼ 2 2 2 log x x ; N (x, 12, 4) ∼ c1 log x

(115)

x 3 · ; 8 log x x N (x, 12, 8) ∼ c2 ; log x

(116)

3 x · ; 8 log x x ; N (x, 3, 1) ∼ c1 log x x N (x, 3, 2) ∼ c2 log x

(118)

N (x, 12, 6) ∼

(117)

N (x, 12, 10) ∼

where

√ 2 3 −1/2 c (2c3 + c4 ) and c3 = c1 = 3π 3 c4 =

p≡2(3) prime

1 1− , ( p + 1)2

p≡2(3) prime

(119) (120)

1 , 1+ 2 p −1

√ 2 3 −1/2 c2 = (2c3 − c4 ) c 3π 3

205

(121)

CHAPTER 3

Dence and Pomerance prove also (inspired by an argument by W. Narkiewicz [315]) that if the residue class r (mod m) contains a multiple of 4, then it contains infinitely many numbers ϕ(n). (122) In what follows, by a ”totient” we mean a value taken by Euler’s function ϕ(n). Since 1 is the only odd totient, by result (122) of Dence and Pomerance, it remains to examine residue classes consisting entirely of numbers ≡ 2 (mod 4). K. Ford, S. Konyagin and C. Pomerance [143] have characterized which of these residue classes contain infinitely many totients and which do not. The following negative result is true: For any ε > 0 there exist such m that at least (1 − ε)m residue classes a (mod 4m), 0 < a < 4m, a ≡ 2 (mod 4) are totient-free. (123) As a corollary of (123) one gets that the union of all totient-free residue classes has density 3/4. (124) On the other hand, holds true a positive result: The set of all odd numbers m such that for any s ≥ 1 and for any even a the residue class a (mod 2s m) contains infinitely many totients, has a positive lower density. (125) If a residue class r (mod m) contains infinitely many totients, the authors in [143] remark that using the methods of [102] and [316], it is possible to get asymptotic formulas for N (x, m, r ). A result of H. Delange [101] can be used to give an asymptotic formula for the number of n ≤ x for which m ϕ(n) (where m is fixed). For the distribution in residue classes of values of general multiplicative functions we quote also [315], [316], [101]. It is well known that the set of values of the function ϕ (i.e. the set of totients) has ˇ at [38] prove (asymptotic) density 0 (see [323], section 11.3). H. Bereková and T. Sal´ that the sets of positive values of the functions ϕ + d and ϕ − d have density 0. R. B. Killgrove [223] poses the problem if the set of values of ϕ is or not a Dirichlet set?

8

Prime totatives

If we consider the ϕ(30) = 8 integers that are ≤ 30 and relatively prime to 30, we find these to be 1, 7, 11, 13, 17, 19, 23, 29. Thus, apart from 1, all of these integers are primes. It is interesting that 30 is the largest integer with this property, i.e.: The number 30 is the largest integer such that all the integers less than it that are relatively prime to it are prime (apart from 1). (126) Usually, this result is attributed to H. Bonse [46] (who obtained a proof based on 2 his inequality p1 p2 . . . pk ≥ pk+1 , where pk is the kth prime (see [291], Chapter 7)). 206


However, this was first proved by S. Schatunowsky (see [103], p. 132). E. Maillet [278] gave a generalization, as a solution to an Open problem posed by G. de Rocquigny [355] (see also [103]). In 1984 H. Iwata [207] rediscovered this result which can be stated as follows: There are only finitely many integers b such that all smaller positive integers n, with (n, b) = 1, are products of at most k prime factors. (127) In 1989 L. Cseh [91] shows that if k = 1 and n, b are restricted to be odd integers, then the largest b is 105. (128) This was an Open question of S. W. Golomb. In fact, Cseh extends the Maillet (Iwata) theorem for Beurling’s generalized primes (see Chapter 2). We note that Bonse [46] proved Maillet’s theorem (127) for k = 1, 2, 3 without using Chebysheff’s theorem, which states that there is always a prime between a and 2a (a ≥ 2). Later, in 1909, R. Remak (see [103], p. 138) proved completely (127) for all k, without using the Chebysheff theorem. Another proof was obtained by E. Landau (see [103], p. 138). For integers a such that (a, n) = (a + 1, n) = 1. L. Carlitz [61] showed the following: Let n be odd. Then ≡ 1 (mod n) and ≡ −1 (mod n) (129) 1≤a hω(n) (140) h= ϕ(n) where P(n) is the greatest prime factor of n. In 1959 W. Sierpinski asked, whether there are infinitely many integers not of the form ϕ(n) (i.e. noncototients, see [171], p. 91). Recently, J. Browkin and A. Schinzel [53] have shown that the equation ϕ(x) = 2k · 509203 208

(k = 1, 2, . . . )


has no solutions. The following Open problem is stated: do the integers not of the form ϕ(n), have a positive lower density? It is not known if there exist infinitely many composite solutions of (139). (141) A number of asymptotic results involving ϕ are included in [328]. For a fixed positive integer m, m ϕ(n) x2 (k − 1)! 2 . +O =x ϕ(n) 2k (log x)k logm+1 x 2≤n≤x k=1

(142)

For any a > 0, n≤x

m 1 (k − 1)! +O = x k a (ϕ(n)) k=1 log x

x logm+1 x

.

(143)

For a fixed positive integer k one has

ϕ(n) · ϕ(n + k) = x

n≤x

2

4 1 c(k) + − 2 3 π

+ O(x 2 log2 x),

(144)

2 1 1 . 1− 2 1+ where c(k) = 3 p prime p p( p 2 − 2) p|k In 1980 P. Erdös [110] (see also R. K. Guy [171]) has conjectured that: i) ϕ(n) > ϕ(ϕ(n)) for almost all n; (145) ii) ϕ(n) < ϕ(ϕ(n)) for infinitely many n. Recently, A. Grytczuk, F. Luca and M. Wójtowicz [160] have settled ii), by proving that there exists an infinite sequence of positive integers (n k ) such that ϕ(n k ) + 2k ≤ ϕ(ϕ(n k ))

(146)

For conjecture i) of (145) it is proved that if n > 2 is such that the odd part of n is squarefull, then n satisfies the inequality of i). (147) Particularly, the lower asymptotic density of numbers n with inequality of i) is ≥ 0.54. (148) It is immediate that lim sup n→∞

ϕ(n) − ϕ(ϕ(n)) =1 n

The exact value of lim inf, however is an Open question (see [160]). n→∞

209

(149)

CHAPTER 3

10

Euler minimum function The Euler minimum function is defined by E(n) = min{k ≥ 1 : n|ϕ(k)}

(150)

It was introduced by P. Moree and H. Roskam [297], and independently by J. Sándor [365] (see also [363], pp. 141-149) as a particular case of the more general function (151) F fA (n) = min{k ∈ A : n| f (k)}, (A ⊂ N) if such a function exists. For A = N, f = ϕ one obtains the function E given by (150). Since by Dirichlet’s theorem on arithmetical progressions there exists a ≥ 1 such that k = an + 1 is prime, by ϕ(k) = an is a multiple of n, so E(n) exists. We note that for A = N, f (k) = k! one obtain the Smarandache function, while for A = P (set of primes), f (k) = k! one gets a new function [365]. There is also a ”dual” of (151), namely G gA (n) = max{k ∈ A : g(k)|n},

(152)

if this is well defined. For A = N, g(k) = k! this is denoted by S∗ (n) and studied in [365]. For f (k) = ϕ(k), A ⊂ N in (151) one obtains a generalization of the Euler minimum function, while from (152) one can introduce the Euler maximal function by (see [366]) E ∗ (n) = max{k ≥ 1 : ϕ(k)|n} (153) Since ϕ(1) = 1|n for all n, this function is well defined. It can be proved that (see [366]) that max{E( pa ), E(q b )} ≤ E( pa · q b ) ≤ [E( pa ), E(q b )] for p = primes

(154)

so one needs to study first E on prime powers. Let q be a prime, and denote by A(q) the set of squarefree numbers composed of only primes p satisfying p ≡ 1 (mod q). For convenience, let the empty set have minimum equal to ∞. Then Moree and Roskam prove ([297]): E(q n ) = min{m, q n+1 }, where m = min{a ∈ A(q) : q n divides ϕ(a)/q n < q} (155) For (u, v) = 1 let p(v, u) denote the smallest prime with p ≡ u (mod v) and pi (v, u) (i ≥ 2) the ith smallest such prime. As a corollary of theorem (155) one has: The largest prime divisor of ϕ(E(q n )) is q; The smallest prime divisor of E(q n ) is ≥ q; 210


log q ; If q is odd, then ω(E(q )) < min n + 1, log 2

n

(156)

E(q) = min{q 2 , p(q, 1)}; E(q 2 ) = min{q 3 , p(q 2 , 1), p(q, 1) p2 (q, 1)}. This corollary shows that the behaviour of E is strongly related to the distribution of primes in arithmetic progressions. Another consequence of (155) is that E( pa ) = E(q b ) if p = q (primes); E( pa ) = E( p b ) if a = b

(157)

The prime 2 has the property that E(2n ) = 2n+1 for infinitely many n. Let M denote the set of primes p such that E( p n ) = p n+1 for infinitely many n. Let q be an odd prime, and suppose that there are integers a, d, n 0 such that E(q n ) = min{q n+1 , p(q n , 1)} for n ≥ n 0 , and n ≡ a (mod d). Then q ∈ M. (158) It can be proved that 2, 3, 5, 7, 13, 19, 31 ∈ M, and in [297] it is conjectured that every prime is in M. Another function, connected also to the Euler minimum function is the Euler l.c.m. sequence, defined by ek = lcm(ϕ(1), ϕ(2), . . . , ϕ(k)), Let ak =

k = 1, 2, . . .

(159)

ek

(k ≥ 2). We say that k ≥ 2 is a jumping point if ak > 1. Then ek−1 the following interesting fact is true: The number k ≥ 2 is a jumping point iff k = E( pr ) for some prime p and positive integer r > 1. (160) This implies that for k ≥ 2, ak is a prime, or equals 1. (161) For the growth of the Euler l.c.m. sequence we have (see [297]): exp(k .6687 ) ek exp((1 + ε)k)

(162)

for ε > 0 fixed, but arbitrary. We note that the result on the functions E and e are used in [297] in the study of the discriminator D( j, n) = smallest positive integer k for which the first n jth powers are distinct modulo k. This notion has been introduced by L. K. Arnold, S. J. Benkoski and B. J. McCabe [15]. (For more References, see [297]). The study of the discriminator involves also the Fermat’s quotient of a prime p, related to the congruence a p−1 − 1 ≡ 0 (mod p 2 ). 211

CHAPTER 3

For many results, as well as open problems on Fermat’s quotients, see e.g. [349] (pp. 335-346). Recently, the Fermat’s quotients have been extended to composite moduli m by A. Takashi, K. Dilcher and L. Skula [452] who considered the congruence a ϕ(m) − 1 ≡ 0 (mod m 2 ) (163) for composite m. If m is such an integer, then P(m) = largest prime factor of m, satisfies the congruence a P(m)−1 − 1 ≡ 0

(mod (P(m))2 )

(164)

(i.e., is a Wieferich prime). With a given P(m), all solutions of (163) can be determined (see [452]).

11

Lehmer’s conjecture, generalizations and extensions

Finally, we shall deal with a famous divisibility problem on Euler’s totient, namely Lehmer’s conjecture. We will include also some analogues problems on Euler’s or related totients. In 1932 D. H. Lehmer [250] considered the relation ϕ(n)|(n − 1),

(165)

and asked if there are any composite solutions. This problem is still open (see e.g. [171]), ”many people feeling it is as difficult as the odd perfect number problem” (quotation from C. Pomerance [333]). Let n be a composite solution of (165). Lehmer proved that then n must be squarefree, odd, and ω(n) ≥ 7 (where ω(n) denotes the number of distinct prime factors of n). Further, he showed that if pq|n ( p, q distinct primes), then q ≡ 1 (mod p). (166) In 1944 F. Schuh [399] proved that if 3|n, then k ≡ 1 (mod 3), where k=

n−1 . ϕ(n)

(167) (168)

Clearly, k = 1 iff n = prime. He ”proved” also that ω(n) ≥ 11, (169) but this proof was not correct. In 1970 E. Lieuwens [256] corrected Schuh’s proof, so result (169) was established. Lieuwens proved also that if 3|n, then ω(n) ≥ 212 and n > 5.5 · 10570 212

(170)


Similarly, he proved that if 3 n, 5 n (i.e. the least prime factor of n is ≥ 7), then ω(n) ≥ 13. (171) In 1977 M. Kishore [225] proved without any condition that (171) is true, i.e. ω(n) ≥ 13. (172) Even Lehmer ([250]) showed that if k = 3 in (168), then ω(n) ≥ 32, (173) and Kishore proved that for any k > 2 one has ω(n) ≥ 33. (174) In 1980 G. L. Cohen and P. Hagis Jr. [86] improved result (171) to ω(n) ≥ 17, and result (172) to ω(n) ≥ 14. (175) D. W. Wall [472] improved (171) to ω(n) ≥ 26. (176) Cohen and Hagis have obtained without any condition the bound n > 1020 ,

(177)

which apparently is the best current result of this type. In 1985 M. V. Subbarao and V. Siva Rama Prasad [445] have studied the analogue of Lehmer’s problem to the unitary totient function ϕ ∗ , i.e. ϕ ∗ (n)|(n − 1) Since ϕ ∗ (n) =

(178)

( p α − 1), it is immediate that ϕ ∗ (n) = n − 1 if and only if n is

p α n

a prime power: n = p α ( p prime, α ≥ 1). We shall call n a proper solution of (178), if ϕ ∗ (n) = n − 1, i.e. when n−1 >1 (179) k∗ = ∗ (ϕ (n) Let S denote the set of composite solutions of (165) and S ∗ , the set of proper solutions of (178). Since S contains only squarefree numbers n, and ϕ(n) = ϕ ∗ (n), for such n, clearly (180) S S∗ i.e. S is a proper subset of S ∗ . Subbarao and Siva Rama Prasad prove that any solution is odd, and not a powerful number; (181) if 3|n, then ω(n) ≥ 1850. (182) By (180), relation (182) improves on Lieuwen’s bound on ω(n) given by (170). Further, if 3 n, 5 n,then ω(n) ≥ 11; (183) if 3 n, 5 n, then ω(n) ≥ 17; (184) if k ∗ = 3, 4, 5 in (179), then ω(n) ≥ 33. (185) ∗ Similarly: If k = 5 and n is squarefree, then ω(n) ≥ 53. (186) If k ∗ = 6, then ω(n) ≥ 140 or 48, according as n is squarefree, or not. (187) 213

CHAPTER 3

If k ∗ = 7, then ω(n) > 200 or 103 according as n is squarefree, or not. If k ∗ ≥ 8, then ω(n) > 200. Another result says that if 2 < ω(n) ≤ 16, then k ∗ = 2, 3 n, 5|n and 7|n.

(188) (189)

(190) Let Jk be the Jordan totient function (see (42) of 3.1). The analogue of Lehmer’s problem for Jk can be easily settled. Namely, it is not difficult to prove (see [445]) that if k > 1, then Jk (n)|(n k − 1) iff n = prime (191) In 1989 V. Siva Rama Prasad and M. Rangamma [424] have obtained certain results on the form of solutions of Lehmer’s problem (165). Let s be the number of primes of the form p ≡ 2 (mod 3) in the prime factorization of n. If 3 n, then n must have the form 214 · 3 · m + 1 or 214 · 3 · m + 65537, according as s is even, or odd. (192) P. Hagis, Jr. [173] further refined Kishore’s result (174) that for any k > 2, ω(n) ≥ 1991 and n > 108171 . (193) Estimates (182) are further improved to 3|n ⇒ ω(n) ≥ 298848, and n > 101937042

(194)

In an unpublished manuscript, M. Deaconescu and J. Sándor [99] have shown that if a composite n has an odd number of prime factors p ≡ 3 (mod 4), then n cannot be a solution of (165). Recently, A. Grytczuk and M. Wójtowicz [163] have shown that if n is a composite solution to (168) with least prime divisor p1 = 3, then ω(n) ≥ 3049k/4 − 1509. If p1 > 3, then ω(n) ≥ 143k/4 − 1. C. A. Nicol [318] proved that n ≥ 2 is prime iff ϕ(n)|(n − 1) and (n + 1)|σ (n). We now give estimates for the solutions, or the number of solutions of the considered problems. Let n ∈ S be a solution of Lehmer’s problem (165). Then r

n < r2 ,

(195)

where r = ω(n) (see C. Pomerance [334]). Subbarao and Siva Rama Prasad [445] have refined this (on view of (180)) to: If n ∈ S ∗ is a solution of problem (178), then r −1

n < (r − 1)2

(196)

Let N (x) = car d{n ≤ x : n ∈ S}. By sharpening a result of P. Erdös [109], in 1977 Pomerance [334] derived: N (x) = O(x 1/2 (log x)3/4 (log log x)−1/2 ). 214

(197)


Shan Zun [410] improved the exponent 3/4 to 1/2. (198) Let P denote the set of all odd primes. Grytczuk and Wójtowicz [163] have proved that for all m ≥ 2 there exists an infinite subset P(m) of P such that: i) for every distinct primes p1 , . . . , pm ∈ P(m) the square-free number n = p1 . . . pm is not a solution of (168); ii) P(m) is maximal with respect to inclusion. For the corresponding set N ∗ (x) = car d{n ≤ x : n ∈ S ∗ } one has N ∗ (x) = O(x 1/2 (log x)2 (log log x)−2 );

(199)

see [445]. Based on a remark of A. Schinzel (see [171], p. 92) that for n = 2, p or 2 p (where p is an odd prime) one has (ϕ(n) + 1)|n, and if the converse is true, G. L. Cohen and S. L. Segal [88] have studied the relation (ϕ(n) + 1)|n.

(200)

They proved the following theorem: If n satisfies (200), then one of the following assertions is true: a) n = 2, p, or 2 p (where p is an odd prime); b) n = mt, where m = 3, 4, or 6; (m, t) = 1 and t − 1 = 2ϕ(t); c) n = mt, where (m, t) = 1, ϕ(m) = j ≥ 4 and t − 1 = jϕ(t). Thus, in case b) one can write (according to (175)) ω(t) ≥ 14, while in case c) ω(t) ≥ 140. As a corollary, if Lehmer’s problem has no solutions, then n = 2, p, 2 p are the only solutions of (200). If there are other solutions, too, then they have at least 15 distinct prime factors. (201) Let N1 (x) = car d{n ≤ x : n = 2, p, 2 p and satisfies (200)}. Then, (see [88]), N1 (x) = O(x 1/2 (log x)3/4 (log log x)−5/6 )

(202)

Finally, we want to mention certain other analogs of Lehmer’s problem. R. L. Graham (see [171], p. 93) makes the following conjecture: For all k there are infinitely many n such that ϕ(n)|(n − k)

(203)

This is true for k = 0, k = 2α (α ≥ 0) and k = 2α · 3β (α, β > 0). For fixed k, C. Pomerance [335] has shown that the number of elements n ≤ x satisfying (203) is x ; (204) O log x 215

CHAPTER 3

in particular, for fixed k, the numbers n have asymptotic density 0. He also showed that for each k, (203) has at least four solutions. V. Meally (see [171], p. 93) remarks that ϕ(n)|(n + 1)

(205)

has at least two solutions. Are there infinitely many? M. Deaconescu [95] proved the inequality ϕ(n)(ϕ(n) − 1) ≥ (n − 1)S2 (n),

(206)

where S2 (n) is the case k = 2 of Schemmel’s totient ([391]) (see relations (26) of 3.1 and (131)), and with equality iff n = prime. Therefore (n − 1)|ϕ(n)(ϕ(n) − 1) iff n = prime

(207)

Deaconescu conjectures that for n ≥ 2 S2 (n)|(ϕ(n) − 1) iff n = prime,

(208)

and expects that this to be as hard as Lehmer’s conjecture. For an extension of S2 (n) with applications in group theory, see M. Deaconescu and H. K. Du [96]. Let n ≥ 3. Then (ϕ(n))2 |(n 2 + 1). (209) is impossible, since ϕ(n) is even, and −1 is not a quadratic residue mod4. On the other hand, if (ϕ(n))2 |(n 2 − 1), (210) one obtains a difficult (but treatable) problem. By applying primitive divisors of Lucas sequences, related to a Pell equation, as well as a form of the Brun-Titchmarsh theorem (see [291], Chapter 8) due to H. L. Montgomery and R. C. Vaughan [294]. F. Luca and M. Kriˇzek [270] have recently proved that all solutions of (210) are n = 1, 2, 3. (211)

3.3 1

Equations involving Euler’s and related totients Equations of type ϕ(x + k) = ϕ(x)

Perhaps the oldest equation related to Euler’s totient is ϕ(x) = ϕ(x + 1) 216

(1)


In 1917 R. Ratat (see [103] p. 140) noted that x = 1, 3, 15, 104 are solutions; a year later R. Goormaghtigh found the solutions x = 164, 194, 255, 495. All other solutions up to x ≤ 10000 are x = 584, 975, 2204, 2625, 2834, 3255, 3705, 5186, 5187 (see V. Klee [227] and L. Moser [302]). (2) In 1972 M. Lal and P. Gillar [236] used an IBM1620, Model1, to determine all solutions for x ≤ 105 . In 1978 M. Yorinaga [485] found 146 solutions for x ≤ 10928925, by using a computer HITAC20. R. Baillie [23] made extensive computations to obtain all solutions for x ≤ 108 . He found 306 solutions of equation (1). (3) In 1999, S. W. Graham, J. J. Holt and C. Pomerance [156] by using C++ programming language to implement simple sieving and scanning procedures to compute the necessary ϕ-values and then look for solutions of (1), have obtained all solutions for x ≤ 1010 . There are 1267 solutions. (4) It is known that ϕ(30n + 1) > ϕ(30n) for all n ≤ 2 · 107 . However, D. J. Newman [317] points out that this kind of numerical evidence may be extremely misleading. In fact, he proves that if a, b, c, d are nonnegative integers with a, c > 0 and ad − bc = 0, then there exists a positive integer n for which ϕ(a · n + b) < ϕ(c · n + d). The equation ϕ(x + 2) = ϕ(x), (5) has the solutions x = 4, 7, 8, 10, 26, 32, 70, 74 for x ≤ 100. There are 80 solutions satisfying x ≤ 10000. L. Moser [302] noted that if p and 2 p − 1 are both odd primes, then x = 2(2 p − 1) is a solution. However, it is not known (and it is an extremely difficult problem) that there are infinitely many such primes. Lal and Gillard [236] obtained all solutions x ≤ 105 , M. Yorinaga [485] those of x ≤ 4 · 106 (in total 7998), while for x ≤ 1010 there are in total a number of 7558421 solutions (see [156]). (6) The equation ϕ(x + 3) = ϕ(x) (7) has the curious property that has only two solutions for x ≤ 10000, namely x = 3, 5 (see A. Schinzel [394]). D. H. Lehmer extended the range to x ≤ 106 (see [171], p. 90). Finally, Graham, Holt and Pomerance considered x ≤ 1011 , (8) without finding any new solutions. In 1956 W. Sierpinski [415] has shown that the equation ϕ(x + k) = ϕ(x)

(9)

has at least one solution for each value of k. In 1958 A. Schinzel [394] showed that there are at least two solutions to (9) for all k ≤ 8 · 1047 . (10) A year later, A. Schinzel and A. Wakulicz [396] have increased the bound to k ≤ 2 · 1058 . (11) 217

CHAPTER 3

In fact, the following two propositions by Schinzel have been applied: Let k be odd. Then suppose that a sequence of primes 3 = p1 < p2 < · · · < pm satisfies the conditions i) ( pi − 2)| p1 p2 . . . pi−1 (2 ≤ i ≤ m), (12) ii) ( pi − 1)|∗ 2 p1 p2 . . . pi−1 (2 ≤ i ≤ m), where a|∗ b means that each prime factor of a also is a prime factor of b. Suppose k is not divisible by p1 p2 . . . pm , and let p j be the smallest prime in the product that does nor divide k. Then pjk (13) x= pj − k is a solution to (9). Let now k be even. Let q1 , q2 , . . . , qm be a sequence of primes such that a) 2qi − 1 is prime (1 ≤ i ≤ m), (14) b) 2qi − 1 = q j (1 ≤ i, j ≤ m). Suppose k < q1 q2 . . . qm . Then there exists a prime q j in the sequence such that q j and 2q j − 1 both do not divide k, and x = (2q j − 1)k

(15)

is a solution to equation (9). Using Mathematica, and the built-in function Prime Q, which test primality using a combination of the Miller-Rabin and Lucas tests, recently J. J. Holt [199] has raised the bound to k ≤ 5 · 1038926 is the result (10) (k = even). (16) There is a conjecture of L. E. Dickson [104] known as the ”prime k-tuple conjecture”. A special case of this conjecture is that there are infinitely many primes p with 2 p − 1 prime. Therefore, this conjecture implies that for k even, there are infinitely many solutions to equation (9) (known as Schinzel’s conjecture). This remark (by Schinzel) appears also in M. Zhang [487]. There are also some solutions of particular type of the considered equation. n D. Klarner [226] remarks that equation (1) has solutions x = 22 − 1 only for n = 0, 1, 2, 3, 4, 5. (17) A. Schinzel [394] shows that for all positive integers n, there exists a positive integer m such that the equation (9) for k = n m has at least two solutions. (18) Another method of finding solutions to equation (9) is due to Graham, Holt and Pomerance [156]: Suppose that k is even and that j and j + k have the same prime factors. Let g = ( j, j + k), and suppose that for a positive integer r , j j +k r + 1 and r +1 g g 218

(19)


are both primes that do not divide j. Then j +k x= j r +1 g

(20)

is a solution of equation (9). It is known that, for a given k, there are only finitely many values of j such that j and j + k have the same prime factors (see e.g. R. Tijdeman [453], and the References therein). For example, for each even k ≤ 30 all possible values of j can be completely determined by elementary techniques (based on the study of certain exponential diophantine equations). Related to the asymptotic number of solutions of the considered equations, many conjectures have been stated. Based on the Hardy-Littlewood conjecture on the distribution of prime pairs ( p, 2 p − 1), p ≤ n (see [178]), M. Yorinaga conjectures that P(2, n) ∼

c2 n as n → ∞, · 2 log2 n

(21)

where P(k, n) denotes the number of solutions x ≤ n of the equation (9), and 1 c2 = 1− = 0.6601618 . . . is the twin-prime constant. His ( p − 1)2 p>2 prime conjecture is supported by numerical tables. Without any assumption, Graham, Holt and Pomerance [156] prove the following result. Let P1 (k, n) be the number of solutions x ≤ n of equation (9), which are not in the form (20). In particular, when k is odd, P1 (k, n) = P(k, n). Then for every k, there is some n 0 (k) such that if n ≥ n 0 (k), then P1 (k, n) < n/ exp(log1/3 n). (22) The case k = 1 is due to P. Erdös, C. Pomerance and A. Sárközy [128]. Assume now that the following conjecture of Hardy-Littlewood type (see P. T. Bateman and R. A. Horn [111]) is true: Suppose that a and b are relatively prime, and b < a. Then n p−1 1 1 ∼ 2c2 dt (23) p − 2 log(at) log(bt) 2 r ≤n,an+1,bn+1 primes p|ab(a−b), p>2 Now, as a corollary of theorem (22) one obtains. ∗ ∗ p − 1 ∗ g , where runs over all Let k be even, and let c(k) = j ( j + k) p−2 ∗ runs over all primes p > 2 j such that j and j + k have the same prime factors, such that p| jk( j + k)/g 3 , and g = ( j, j + k). Then 0 < c(k) < ∞; and if conjecture (23) is true, then as n → ∞ P(k, n) ∼ 2c2 c(k) 219

n log2 n

(24)

CHAPTER 3

Let now P0 (k, n) be the number of solutions x ≤ n of equation (9) in the form (20). Then P(k, n) = P0 (k, n) + P1 (k, n), and corollary (24) asserts that if (23) is true, then P(k, n) ∼ P0 (k, n) as n → ∞

(25)

for each k. The following theorem is surprising, since it shows fixed even number P(k, n) ∼ P0 (k, n) or P(k, n) ∼ P0 (k, n) are not that k≤n

k≤n

true: Let c=

k≤n, k even

∗∗ 1≤a 1011 . (30) P. Erdös [111] has conjectured that for k = 1 and arbitrary q, equation (29) is solvable. By numerical verifications many progressions of length 3 (i.e., q = 3) can be found. For example, there is exactly one progression of length 3, when k ∈ {1, 2, 4, 5, 8, 11, 14, 23, 25, 26, 28, 29, 31, 37, 38, 41, 46, 47, 52, 53, 55, 56, 58, 59, 62, 67, 71, 73, 74, 76, 79, 80, 85, 86, 89, 92, 94, 97, 98} (31) There are exactly two progressions of length 3, when k ∈ {16, 17, 22, 32, 34, 43, 44, 61, 82, 83, 88}. (32) There are exactly three progressions of length 3, when k ∈ {64, 68}. (33) The first progression of length 6 has k = 30; x = 583200 (see also the Sloane encyclopedia [429], sequence A050518). An extension of theorem (20) for the equation (29) can be stated as follows (see [156]): 220


Suppose that j, j + k, . . . , j + qk all have the same prime factors. Define B = j ( j + k) . . . ( j + qk). For i = 0, . . . , q define B , g = gcd(b0 , b1 , . . . , bq ), bi = j + ik (34) bi B = ai = g ( j + ik)g Suppose that for some positive integer r , a0r + 1, a1r + 1, . . . , aq r + 1

(35)

are all primes that do not divide j. Then x = j (a0r + 1) =

Br +j g

(36)

is a solution to (29). As a corollary one obtains that, if one assumes the conjecture (a particular case of Dickson’s conjecture, or Schinzel’s Hypothesis H [395]) that for distinct positive integers a0 , a1 , . . . , aq , the integers (35) are all primes for infinitely many r , then for any positive integer q there exists a positive integer k such that (29) has infinitely many solutions. An arithmetic progression of length 10 with equal phi-values is the following (see [156]): ϕ(502781177052210 + 210i), 0 ≤ i ≤ 9 (37)

2

ϕ(x + k) = 2ϕ(x + k) = ϕ(x) + ϕ(k) and related equations A similar equation to the above considered ones is ϕ(x + k) = 2ϕ(x)

(38)

A. Makowski [279] has shown that for each positive integer k has at least a solution. Indeed, if (k, 6) = 1, let x = 2k; if k is even, i.e. k = 2a b (a ≥ 1, b odd), put x = 2a b; if k is odd and divisible by 3, i.e. k = 6s + 3, let x = 2s + 1. Therefore, (38) is solvable for any k. (39) J. Sándor [368], as well as L. Cseh and I. Merényi [92] have studied the equation ϕ(x + k) = 3ϕ(x)

(40)

The density of positive integers k for which (40) has at least a solution is at least 1/2; (41) in fact D. B. Tyler [461] stated that the density is at least 0.864 221

(42)

CHAPTER 3

but no doubt, that the equation is solvable for all k, except k = 2. This seems to be still open. Particular solutions for 1 ≤ k ≤ 10 have been analyzed by Sándor [368] and recently by J. Sándor and L. Kovács [381]. For k = 2 there are no solutions up to x ≤ 106 , while for k = 1 there are 42, for k = 3 there are 18, for k = 5 there are 83, for k = 7 there are 63 solutions up to x ≤ 106 . For k = 4 the single solution is x = 3; for k = 6 the single solution is x = 3, for k = 8 there are two solutions: x = 5, 6; and for k = 10, x = 4, 9 (where x ≤ 106 ). A. Makowski [280], [281] has studied the equation ϕ(x + k) = ϕ(x) + k

(43)

Since ϕ(x) ≡ 0 (mod 2) for x ≥ 3, it easily follows that for k = odd, equation (43) is solvable only when k + 2 is prime, in which case the only solution is x = 2. (44) For k = 2a or k = 3 · 2a (a ≥ 1) one may take x = 3 · 2a and x = 7 · 3a , so in these cases the equation is solvable. (45) a More generally (see [281]) if p and q = p − p + 1 are prime numbers, for k = ( p − 1) pa one obtains the solution x = q p s . (46) Therefore, the number of solutions of this form depends essentially on the number of known Mersenne primes (see Chapter 1 of this book). Hypothesis H of Schinzel ([395]) states the following: Suppose there are given s irreducible polynomials f 1 (x), f 2 (x), . . . , f s (x) with integer coefficients, positive for large values of x and such that there is no integer > 1 which is a divisor of f 1 (x) f 2 (x) . . . f s (x) for every x. Then there exist infinitely many x such that all of f 1 (x), f 2 (x), . . . , f s (x) are prime numbers. (47) By assuming (47), Makoswski shows that for all even k, equation (43) has infinitely many solutions. (48) For k = 2 the equation (43) is particularly interesting, since all x with (x, x + 2) twin primes, is a solution. But there are also composite solutions, e.g. x = 12, 14, 20, 44. L. Moser [302] has shown that there are no composite odd solutions x < 10000. (49) Perhaps there are no other odd solutions x excepting when (x, x + 2) is a twinpair. It is easy to see that if p > 2 and 2 p + 1 are both primes, then x = 4 p is a solution of the equation. Another open problem related to this question is due to A. Makowski ([414], p. 232): Has the system of equations ϕ(x + 2) = ϕ(x) + 2,

σ (x + 2) = σ (x) + 2

(50)

at least a composite solution? Another equation introduced by A. Makowski [282] is ϕ(x + k) = ϕ(x) + ϕ(k) 222

(51)


He showed that at least one solution exists if k is even, or 3 k, or k = i . . . Fsas , where Fi = 22 + 1 is a Fermat number, ai > 1 (i = 0, s), Fs+1 = prime, and (m, 2F0 F1 . . . Fs Fs+1 ) = 1. (52) A particularly interesting case is k = 3, when it is at least not known whether there is a solution (see [282]). (53) In [171] (p. 91) one can read that J. Browkin showed that for k = 3 there is no solution with x < 37182142. Recently J. Sándor and L. Kovács [381] have verified this for x ≤ 3 · 108 . P. Jones [214] has considered the case k = 3, too. She showed that any solution, if exists, must be of the form x = 2 p α or x = 2 p α − 3, where p > 3 is a prime. (54) Further, if x is a solution, then (i) x or x + 3 has at least 33 distinct prime factors, or (ii) x = 2 p α (α odd), p ≡ 2 (mod 3), x > 1011 and x + 3 has at least 9 distinct prime factors. (55) For the general equation (51), Jones has proved that for k = 3m odd it has a solution, in the following cases: a) p α k, p β = q − 2, α > β and q k; b) p k, p = 3q − 4, and q k; (56) c) p k, p = 9q − 16, and q k; d) p k, p = 3α q − 2a r, 3α − 1 = 2a−1 (r + 1), q k, and r k. Finally, if 2m + 1 = 3α n, where (3, n) = 1, α ≥ 0; and if we suppose there exists a positive integer j such that j − ϕ( j) = n and 3α j − 2m+1 = p, then if k = 3 pv, with (3v, 2 pj) = 1, the equation (51) has at least a solution. (57) A more general context of the above equation is the theory of so called ϕ-partitions introduced in 1991 by P. Jones [215]. A partition n = a1 + a2 + · · · + ai of n is said to be a ϕ-partition if

m F0a0 F1a1

ϕ(n) = ϕ(a1 ) + ϕ(a2 ) + · · · + ϕ(ai )

(58)

In the above paper there are studied characterizations of positive integers which have at least one ϕ-partition and those which have exactly one ϕ-partition, the number of ϕ-partitions of prime numbers, as well as techniques for constructing ϕ-partitions and reduced ϕ-partitions for various types of integers. A ϕ-partition is said to be reduced if each summand has exactly one ϕ-partition. In 1996 C. Powell [340] proved that Jones’ recursive algorithm gives a unique reduced ϕ-partition. Powell characterizes also the integers having exactly one reduced ϕ-partition. (59) A number x is called a Phibonacci number if satisfies the equation ϕ(x) = ϕ(x − 1) + ϕ(x − 2), 223

x ≥3

(60)

CHAPTER 3

A. Bager [22] raised the problem if there exists any composite Phibonacci number? The answer is yes, 1037 being the smallest one. P. J. Weinberger found 70 such numbers < 200, 000, 000. All known Phibonacci numbers are odd. An even Phibonacci number, if it exists, must exceed 101600 . C. A. Nicol [320] proved that there exist infinitely many numbers n such that ϕ(n) ≤ ϕ(n − k) for all 1 ≤ k ≤ n − 1, and infinitely many m such that ϕ(m) ≥ ϕ(k) + ϕ(m − k) for 1 ≤ k ≤ m − 1. The equation of k variables ϕ(x1 ) + ϕ(x2 ) + · · · + ϕ(xk ) = ϕ(x1 x2 . . . xk )

(61)

has been solved independently by J. Sándor [367] and F. Luca [261]. There are at most a finite number of solutions, which can be found step-by-step. For example, when 2 ≤ x1 ≤ x2 ≤ · · · ≤ xk , the inequality ϕ(x1 ) + · · · + ϕ(xk ) ≤ ϕ(x1 x2 . . . xk )

(62)

holds except for k = x1 = 2 and x2 = odd; and becomes an equality only in the following three instances: ϕ(2·2) = ϕ(2)+ϕ(2), ϕ(3·4) = ϕ(3)+ϕ(4), ϕ(2·2·3) = ϕ(2)+ϕ(2)+ϕ(3). (63) Essentially, besides k = 1 and x1 , and the above, all other solutions can be obtained by ”completing with 1”, i.e. whenever (x1 , . . . , xl ) is not in the above class, since u = ϕ(n 1 . . . n l ) − (ϕ(n 1 ) + · · · + ϕ(n l )) > 0, set k = l + u and xl+1 = · · · = xl+u = 1. (64) The equation xϕ(x) = yϕ(y) (65) of two arguments has the only solutions x = y. For this well-known property see e.g. [323] (Problem 19 of section 2.4). Related to the function f (n) = nϕ(n) (n = 1, 2, . . . ) in W. Janous [212] it is proved that if F(x) = car d{n > 0 : f (n) ≤ x 2 }, then 1 F(x) 1 = (66) lim 1+ √ − x→∞ x p p( p − 1) p prime By the same method, K.-W. Lau [241] showed that if f a,b (n) = n α (ϕ(n))β (α, β ≥ 0, αβ = 0), then putting Fa,b = car d{n > 0 : f a,b (n) ≤ x a+b }, one has Fa,b (x) = lim {1 + ( p − 1)−b/(a+b) · p −a/(a+b) − p −1 } (67) x→∞ x p 224


P. Erdös and C. W. Anderson [123] propose that for a given positive integer a there are only a finite number of integers b, with (b, a) = 1, such that the equation bϕ(x) = ax

(68)

x has solutions. R. B. Eggleton [106] states that ϕ(x) = for infinitely many x, but 3 x ϕ(x) = for all x. 4

3

Equation ϕ(x) = k, Carmichael’s conjecture Another old equation with a considerable interest is ϕ(x) = k

(69)

In 1900 A. Pichler (see [103], pp. 134-135) noted that for k > 1 there is no solution, while for k = 2n has the solutions x = 2a bc . . . (a = 0, 1, . . . , n + 1) if u v b = 22 + 1, c = 22 + 1 are distinct Fermat primes, and 2u + 2v + · · · = n or n − a + 1, according as a = 0 or a > 0. For k = 2 · q n (q > 3, prime) the equation has no solutions if p = 2q n + 1 is not prime; if p is prime, then has two solutions: x = p, 2 p. For q = 3, p = prime, it has the additional solutions x = 3n+1 , 2 · 3n+1 . For k = 2q n the equation has no solutions if no one of the numbers ps = 2n−s q + 1 (s = 0, 1, . . . , n − 1) is prime and q is not a prime of the form 2h + 1, h = 2l ≤ n; but if q is such a prime, or if at least one ps is prime, then the equation has solutions of forms bq 2 , with ϕ(b) = 2n−h ; resp. aps , with ϕ(a) = 2s . For k = 2qr (q, r primes), the equation has no solutions if p = 2qr + 1 = prime and r = 2q + 1. If p is a prime, but r = 2q + 1, the two solutions are x = p, 2 p. If p = prime, but r = 2q + 1, the two solutions are x = r 2 , 2r 2 . If p = prime and r = 2q + 1, all four solutions occur. In 1907 R. D. Carmichael proved that (see [103], p. 137) for k = 2m, with m > 1 odd, x must have the forms x = p α or x = 2 p α , where p is a prime of the form p ≡ 3 (mod 4). In 1908 he gave a method of solving equations like (69), based on the testing of the equation for each factor x of a definite function of k. He solved also the equation ϕ( p α ) = ϕ(q β ) ([68]). In the same year, A. Ranum (see [103], p. 137) discovered a method for finding solutions of (69) when there are known all solutions of the equation ϕ(x) = m with m < k. This can be summarized as follows. When x is a prime power solution, i.e. x = n p , one can have solutions only if k = p n−1 ( p − 1). Let now x = ab, (a, b) = 1, 1 < a < b. Then ϕ(a)ϕ(b) = k. Hence, either ϕ(a) and ϕ(b) are both even or ϕ(a) = 1, 225

CHAPTER 3

i.e. a = 2. In the latter case, b is odd, yielding two solutions ϕ(b) = ϕ(2b) = k. In the former case ϕ(b) and ϕ(a) are both even, so k is a product of two even integers. This gives the following procedure for obtaining new solutions. Write k = (2u)(2v) and solve the equations ϕ(a) = 2u, ϕ(b) = 2v. We obtain new solutions by multiplying together relatively prime solutions for each of the two equations. For a discussion, with numerical examples, see N. S. Mendelsohn [288]. In 1950 H. Gupta [170] showed that for k = m! (m > 1) the equation is solvable. Namely, x = (m!)2 /ϕ(m!) is an integer, and a solution to (69). See also P. Erdös [112]. Similarly, for k = m! · 2m , the equation has the solution x = 4m (m!)2 /ϕ(m! · 2m ), proved by C. S. Venkataraman [468]. In 1977 A. Aigner [2] showed that if a > 1 is a squarefree integer, then there exist infinitely many solutions x, when k is of the form k = ab2 (where b ≥ 1), and also infinitely many solutions x = y 2 (y = 1, 2, . . . ), when k = ac2 (c ≥ 1). There are integers k such that (69) has exactly 2 or 3, etc. solutions. Let Vϕ be the valence function of ϕ, i.e. let Vϕ (k) denote the number of solutions x of equation (69). For example, Vϕ (1) = 2, Vϕ (2) = 3, Vϕ (4) = 4, Vϕ (10) = 2, Vϕ (14) = 0, Vϕ (20) = 5, Vϕ (22) = 2 etc. H.-J. Kanold and W. Sierpinski (see P. Erdös [113]) have proved that Vϕ (n) = 2 for infinitely many n, such are the integers n = 2 · 36k+1 (k = 1, 2, . . . ). Similarly, Vϕ (n) = 3 for infinitely many n, due to A. Schinzel [392] (we may take n = 12 · 712k+1 , k = 0, 1, 2, . . . ). S. S. Pillai [331] was the first to prove that lim sup Vϕ (n) = +∞ n→∞

and that for almost all n, Vϕ (n) = 0. This result was given by A. Schinzel [393] (see also [414], p. 233). P. Erdös [113] proved that if Vϕ (n) = a, then there exist infinitely many such integers n. In 1935 P. Erdös [114] showed that there exists δ > 0 such that Vϕ (m) > m c for infinitely many m, and in 1979 K. R. √Wooldridge [484] proved that the above statement holds in fact for every δ < 3 − 2 2 (by using estimates from Selberg’s upper bound sieve). 226


C. Pomerance [336], by using certain improvements on average in the BrunTitchmarsh theorem due to Hooley, together with Bombieri’s sieve, obtained the refinement δ < 0.55655 This implies

Vϕ (m) > m 5/9 for infinitely many m.

A. Balog in 1984 obtained δ < 0.65 (see [349], p. 321). This has been further refined by J. B. Fridlander [144]. As a consequence of the above results one has Vϕ (n) = c0 x + (x 5/9 ) n≤x

where c0 = ζ (2)ζ (3)/ζ (6). P. T. Bateman [30] has shown Vϕ (n) = c0 x + O(x exp{−c1 (log x log log x)1/2 }), n≤x

√

where c1 < 1/ 2 is arbitrary. C. Pomerance in [336] proves Vϕ (n) ≤ n exp(−(1 + o(1)) log n log log log n/ log log n) and conjectures, that this is best possible. This if true, would imply log log log x Vϕ (n) = c0 x + x exp −(1 + ε) log x log log x n≤x for every ε > 0. H. Heilbronn and H. Davenport (see [113]) proved 1 (Vϕ (n))2 → ∞ as x → ∞ x n≤x and conjectured that

(Vϕ (n))2 x 1+c for some c > 0. n≤x

P. Erdös [113] conjectures that (92) is true for every c < 1. The value c = 1/9 appears in [336]. If Vϕ∗ (k) denotes the number of squarefree solutions to (69), then Vϕ∗ (n) ≤ n/e(1+o(1)) log n log log log n/ log log n , see [336]. 227

(70)

CHAPTER 3

Let Vϕ# (k) be the number of 1 ≤ m ≤ k such that Vϕ (m) > 0. P. Erdös (see [349], p. 321) showed in 1935 and in 1945, respectively that Vϕ# (n)
n(ε) (ε > 0 arbitrary, but fixed) Vϕ# (n) >

n(log log n)k log n

(72)

for every k > 0 and sufficiently large n. These results were further improved by P. Erdös and R. R. Hall [126]. H. Maier and C. Pomerance [277] deduced Vϕ# (n) =

n exp{C + o(1)(log log n)2 } log n

(73)

where C = 0.81781465. K. Ford [138] further improved this to n exp C(log3 n − log4 n)2 + D log3 n− Vϕ# (n) = log n 1 (73 ) − D + − 2C log4 n + O(1) 2 where logk n denotes the kth iterate of the logarithm of n, and D = 2.17696874 . . . K. B. Stolarsky and S. Greenbaum [441] denoted by L(k) the l.c.m. of the solutions of equations (69). If G(k) = gcd of all numbers a k = 1 (1 ≤ a ≤ L(k), G(k) can be arbitrarily large. (a, L(k)) = 1), then they proved that the ratio L(k) In 1907 R. D. Carmichael (see [103], p. 137) proposed as an exercise to prove that for every n ≥ 1 it is possible to find an m such that ϕ(n) = ϕ(m), i.e. Vϕ (n) = 1 for all n.

(74)

For a few years it was thought that Carmichael had proved this. (74) is the famous Carmichael conjecture. (75) Already in 1922 Carmichael [67] showed that if Vϕ (n) = 1, then n > 1037 . In 1947 V. L. Klee [228] showed n > 10400 , while P. Masai and A. Valette [285] in 1982 raised the bound to n > 1010000 . (76) In 1994, still based essentially on Klee’s method, A. Schlafly and S. Wagon [397] 7 improved this to n > 1010 . (77) K. Ford [138], [139] showed that if there is a counterexample to Carmichael’s conjecture, then a positive proportion of totients are counterexamples. He improved 10 (77) to 1010 . (78) 228


Ford ([138], [139], [140]) has proved also a famous conjecture of Sierpinski, namely that every integer n ≥ 2 is a value of the function Vϕ (i.e. all integers ≥ 2 occur as multiplicities). (79) The corresponding conjecture (due also to Sierpinski) for the function σ (i.e. that for every n ≥ 0 there is a number m for which σ (x) = m has exactly n solutions) has been settled by K. Ford and S. Konyagin [142]. There are examples of even numbers n such that there is no odd number m such that ϕ(m) = ϕ(n). L. Foster (see [171], p. 94) has given n = 29 · 2572 as the least such number. (80) Some conditions for the validity of Carmichael’s conjecture are given in W. A. Ramadan-Jradi [343]. M. V. Subbarao and L.-W. Yip [447] have considered the equation Sm (x) = k

(81)

where Sm (n) denotes the Schemmel totient function. Let VSm (k) denote the number of solutions of equation (81). They proved the following result: Let m ≥ 3 be of the form p α − 2, where p is an odd prime, and α ≥ 1. The H-Hypothesis by Schinzel implies that for any given integer n > 1, there exist infinitely many integers k such that VSm (k) = n. (82) They conjecture that this is true for all m ≥ 1 fixed. (83) ∗ Let ϕ be the unitary analogue of the totient function. M. Ismail and M. V. Subbarao [206] consider the equation ϕ ∗ (x) = k

(84)

Since for k odd, (84) has a solution iff k = 2m − 1, the unitary analogue of the Carmichael’s conjecture is clearly false. However, for k = even, there are some evidences that the conjecture could be true (see [206]). As we have seen, equation (69) is not solvable for odd k > 1. But this may be true for even values of k, too. In 1956 A. Schinzel [392] showed that for every a ≥ 1 and k = 2 · 7a , (69) is not solvable. (85) More generally, for every positive integer s there exists a positive integer k divisible by s such that the equation ϕ(x) = k has no solutions. (86) D. Lind [258] proved that if m is a prime such that 2m + 1 is composite, then ϕ(x) = 2m has no solutions. (87) Since, by Dirichlet’s theorem on arithmetic progressions, there are infinitely many primes of the form 3n + 1, and 2(3n + 1) + 1 = 3(2n + 1) is composite, there are an infinite number of primes satisfying theorem (87). In 1963 J. L. Selfridge [406], and also P. T. Bateman [31] gave the solution of a problem proposed by O. Ore: 229

CHAPTER 3

For every a ≥ 1 there exists an odd integer ka such that for k = ka · 2a , equation (69) is not solvable. (88) (i.e. ka · 2a is not a value of Euler’s function, or it is a ”nontotient”). In 1976 N. S. Mendelsohn [288] proved that there exist infinitely many primes p such that for every a ≥ 1, p · 2a is a nontotient. (89) More general theorems have been obtained in 1989 by K. Spyropoulos [436]. For example, let p1 , . . . , pm be distinct odd primes, and let a(1), . . . , a(m) be arbitrary positive integers. Suppose that pi ≡ 1 (mod L), i = 1, 2, . . . , m, where L = lcm{1 + 2, 1 + 22 , . . . , 1 + 2n }. Then 2n p1a(1) . . . pma(m) is a nontotient. (90) M Zhang [488] proves that a nontotient can have an arbitrary divisor, and gives two classes of odd numbers such that for the odd number k of the first class 2α k is a nontotient for a given positive integer α, while for the odd number k of the second class, 2α k is a nontotient for arbitrary positive integer k. (91) A (n) m Finally, if Am (n) = car d{x ≤ n : ϕ (k) (x) = m for some k}, then lim is n→∞ n s equal to 1 if m = 2 , and to 0 otherwise. See E. Jacobson [209].

4

Equations involving ϕ and other arithmetic functions

There are many equations on Euler’s or related totient, connected to other arithmetic functions. In 1894 A. P. Minin (see [103], p. 313) proved that all solutions of ϕ(x) = d(x)

(92)

are x = 1, 3, 8, 10, 18, 24 and 30. In fact ϕ(n) ≥ d(n) for n odd, with equality only for n = 1, 3;

(93)

ϕ(n) > d(n) for all n > 30,

(94)

and se e.g. [363], pp. 110-111. By answering a problem by Jankowska, P. Erdös [115] proved that the system of equations of two arguments ϕ(x) = ϕ(y),

d(x) = d(y),

σ (x) = σ (y)

(95)

has infinitely many solutions. More generally, for every k there are k (squarefree) integers x1 , . . . , xk satisfying ϕ(xi ) = ϕ(x j ),

d(xi ) = d(x j ),

σ (xi ) = σ (x j ), 230

1≤i < j 0, b ≥ 0} (see [363], p. 112), and in fact ϕ(n)(ω(x) + 1) ≥ n for all n ≥ 1

(101)

σ (x) = ϕ(x) + d(x)(x − ϕ(x))

(102)

The equation has the solutions x = 1, or x = prime. In fact, σ (n) ≤ ϕ(n) + d(n)(n − ϕ(n)) for all n ≥ 1,

(103)

improving nd(n) ≥ ϕ(n) + σ (n), due to C. A. Nicol (see [363], p. 114). Let ψ be the Dedekind arithmetical function, given by (1 + 1/ p). ψ(n) = n p|n, p prime

The equation

ψ(x) = ϕ(x) + 2ω(x)

(104) ω(n)

has x = 1 or x = prime, as general solutions. In fact, ψ(n) ≥ ϕ(n)+2 , improving (by ψ(n) ≥ σ (n)) relation σ (n) ≥ ϕ(n)+2ω(n) , due to C. A. Nicol (see [363], p. 196). All solutions of ψ(x) = 3ω(x) ϕ(x) (105) are x = 1 and 2. Indeed, for n even one has ψ(n) ≤ 3ω(n) ϕ(n) with equality only for n = 1 or n = prime, while for n odd one can write ψ(n) ≤ 2ω(n) ϕ(n) (see [363], p. 195) so (105) is impossible for x odd, x = 1. 231

CHAPTER 3

All solutions of

σ (x) + ϕ(x) = x · 2ω(x)

(106)

are x = 1 or x = prime, see C. A. Nicol [319]. Let k > 1 be a fixed integer. The equation σ (x) + ϕ(x) = kx

(107)

has been studied by C. A. Nicol, too. He proved that all solutions must satisfy ω(x) >

log(k − 1) log 2

(108)

and conjectured that for k > 2, all solutions are even. If k is odd, then x is even, or the square of an odd composite number. For k > 2, x cannot be squarefree. (109) For k = 3, a particular solution of equation (107) is given by x = 2α · 3 · q, if one assumes that q = 7 · 2α−2 − 1 is a prime (α > 2). (110) In 1971 S. A. Sergusov [408] proved that √ ϕ(x) = x + 1 − 2 x + 1 (111) iff x = p · q, where p < q are twin primes (i.e. p, q are primes with q = p + 2). A similar result is true for √ σ (x) = x + 1 + 2 x + 1 (112) W. G. Leavitt and A. A. Mullin [242] proved that the solutions of (x − 1)2 − σ (x)ϕ(x) = 4

(113)

are the products of two twin primes. In fact, if x = pq, with p − q = m ( p, q primes), then x is a solution of the more general equation (x − 1)2 − σ (x)ϕ(x) = m 2 (114) For particular m, however there are also solutions of other type. For example, when m = p k − 1, with p and 2 p − 1 being primes, x = p k (2 p − 1) is a solution of (114). The equation doesn’t have solutions of type x = pq r for r ≥ 2, and for any m ( p < q primes). (115) The complete study of equation (114) remains however, open. Another interesting equation is ([371]) σ (x) = ϕ(x)d(x)

(116)

In 1988 J. Sándor [369] (see p. 11) proved that σ (n) ≤ ϕ(n)d(n) for all n odd 232

(117)


with equality only for n = 1, 3 (see also [363], p. 211, and [370], p. 65). Therefore the odd solutions are x = 1, 3. Equation (116) is included also in D. Wells [480], p. 127, where it is mentioned that the least three solutions are x = 1, 3, 14. The only even solutions of type x = 14k, where k is odd and 7 k are x = 14 and 42 (see [371]). (118) Sándor proves also that there are no even solutions x with 3 x and ω(x) ≥ 3; and also with 6|x and ω(x) ≥ 4. (119) All even solutions up to x ≤ 105 are x = 14 and 42. A further refinement of (117) can be found in [372]. Let ϕ ∗ , d ∗ , σ ∗ be the unitary analogues of the functions ϕ, d, σ . Note that, d(n) ≥ d ∗ (n) and σ (n) ≥ σ ∗ (n), but ϕ(n) ≤ ϕ ∗ (n). Since

and

σ (n) σ ∗ (n) ≤ ∗ , with equality only for squarefree n, d(n) d (n)

(120)

σ ∗ (n) ≤ d ∗ (n)ϕ(n) for all n ≥ 3, odd,

(121)

with equality only for n = 3, we get σ (n) σ ∗ (n) ≤ ∗ ≤ ϕ(n) for all n ≥ 3, odd d(n) d (n)

(122)

with equality only for n = 1 and 3. Relation (120) is proved also in [373]. Results of type (123) d ∗ (n) · n ≤ ϕ ∗ (n)(d ∗ (n))2 ≤ n 2 as well as additive variants, are included in [385]. The inequality √ σ (n) ( n − 1)2 √ ≥ + n, d(n) d(n)

(124)

with equality only if n is 1, p, or p 2 , where p is a prime, is due to E. S. Langford [239]. r r If n = piai is the prime factorization of n > 1, let B(n) = ai pi (see [291], i=1

pp. 143-147), B(1) = 0. Then the only solutions of the equations

i=1

ϕ(x)σ (x) + 1 = x B(x)

(125)

ϕ(x) + σ (n) = x + B(x)

(126)

and are x = p (prime), see K. T. Atanassov [17]. 233

CHAPTER 3

Let pn be the nth prime. L. Moser [303] proposed the equation 1 + ϕ(1) + ϕ(2) + · · · + ϕ(x) = px

(127)

and showed that x = 1, 2, 3, 4, 5, 6 are the only solutions. In fact 1 + ϕ(1) + ϕ(2) + · · · + ϕ(n) > pn for n > 100

(128)

A famous, unsolved equation is (see e.g. [171], p. 94) ϕ(x) = σ (y)

(129)

Since for p, q primes ϕ( p) = p − 1 and σ (q) = q + 1, clearly p − 1 = q + 1 iff p = q + 2, so any pair of twin primes is a solution. If M p = 2 p − 1 is a Mersenne prime, then by ϕ(2 p+1 ) = 2 p = σ (M p ), x = 2 p+1 , y = M p is a solution pair of (129). On the other hand, it is not known if there exist infinitely many twin primes, or infinitely many Mersenne primes.

5

The composition of ϕ and other arithmetic functions

In what follows we shall study equations, and related inequalities, for the composition of ϕ and other functions or sequences. In a paper by L. Alaoglu and P. Erdös [3] from 1944 one can read that P. Poulet gave many solutions to the equation ϕ(σ (x)) = x

(130)

For x ≤ 2500 all solutions are x = 1, 2, 8, 12, 128, 240, 720. Two further solutions are x = 215 and 231 . They note also that it can be shown that for every c > 0, σ (ϕ(n)) ≥ cn

(131)

except for a set of density zero. Based on numerical investigations and particular cases by K. Kuhn, A. Makowski 1 and A. Schinzel [283] conjecture that (131) holds true for all n, with c = : 2 n σ (ϕ(n)) ≥ for all n ≥ 1 (132) 2 Kuhn showed that this is true for all n with ω(n) ≤ 6. Further, she found the i solutions x = 22 +1 − 2 (0 ≤ i ≤ 5) of the equation σ (ϕ(x)) = 234

x 2

(133)


After Makowski and Schinzel’s paper, inequality (132) was first investigated in 1988 and 1989 by J. Sándor [374], [375], [376]. Similar problems, with stronger conjectures (σ replaced with ψ) were included also in [369] and [377]. In [376] the following lemma is proved: Let A denote the set of all numbers m with the property σ (ϕ(m)) ≥ m, m odd (134) Then for all even numbers n, having greatest odd divisor in A one has (132). Since for odd m one has ϕ(2m) = ϕ(m), this easily implies that (132) is true iff (134) is true. This has been rediscovered in 1997 by G. L. Cohen [85]. Let a ∧ b denote the property that there exists at least a prime divisor of a which doesn’t divide b. Let Js (s ≥ 1 integer) be the Jordan totient. The following is proved in [376]: Let S denote the set of all m > 1 such that σk (Js (m)) ≥ m ks · 2−(k−1)ω(m) d k ). (where k, s ≥ 1 are positive integers, and σk (a) =

(135)

d|a

Let p denote a prime. Then, if m ∈ S and p|m, then mp ∈ S, too. If n ∈ S, p m, and ( p s − 1) ∧ Js (m), then mp ∈ S, too. As a corollary one obtains a set B ⊂ S of odd numbers, for which inequality (135) is true. (Note that for k = s = 1, this inequality reduces to (134)). If n ≥ 2 is an even number with greatest odd divisor m ∈ B, then σk (Js (n)) ≥

n ks (2s − 1)k · 2−(k−1)ω(n) 2ks − k + 1

(136)

We conjecture that (135) holds true for all odd m ≥ 1, and (136) holds true for all even n ≥ 2. Inequality (136) reduces to (132) for k = s = 1. In Guy [171] one finds that Selfridge, Hoffman and Schroeppel found 24 solutions to equation (130). Cohen [85] notes that Terry Raines found 10 further solutions, and that he has found 8 more. There are all solutions up to 109 . (137) In [429], sequence A001229 one finds that F. Helenius has found 365 solutions. Any solution of (130) gives a solution to σ (ϕ(x)) = x

(138)

Indeed, let x = σ (y), where y is a solution to (130). Then ϕ(x) = y, so σ (ϕ(x)) = σ (y) = x. For further results on the Makowski-Schinzel conjecture we note that, by using Brun’s sieve, C. Pomerance [337] proved that inf

σ (ϕ(n)) >0 n 235

(139)

CHAPTER 3

In 1992 M. Filaseta, S. W. Graham and C. Nicol [134] verified (132) for n = p1 p2 . . . pk for k ≥ k0 , where pi is the ith prime. U. Balakrishnan [24] proved the same for all squarefull integers n. More generally, if n is k-full (k ≥ 2), then 1 σ (ϕ(n)) ≥ n ζ (k)

(140)

Various classes of integers n for which (132) is true, are described also in [85]: 1◦ Any positive integer n of the form 2a m, where i) the distinct prime factors of m are either Fermat primes or primes p ≡ 1 (mod 3), with at most eight of the latter; ii) m is a product of primes of the form 2b r + 1 with b ≥ 1 and r prime (similar example is given in [375]); 2◦ Any positive integer n which is a product of primes less than 1780. (141) In [161] A. Grytczuk, F. Luca and M. Wójtowicz prove that the lower density of the set of integers satisfying the inequality is greater than 0.74. (142) In [162] they give various sufficient conditions for the validity of inequality (132). For example, if the prime factorization of n > 1 is n = p1a1 p2a2 . . . prar , where 2 ≤ p1 ≤ · · · ≤ pr , and if p1 ≥ ω(n), then the inequality is true. (143) More generally, if r −1 1 1 2 ≤1− r + , (144) p 2 2 pr i=1 i then the inequality is true. Other results state that if n ≥ 2, and if 1 1 ≤ , a p 2 pa n

(145)

then (132) is true. For n = m! (m ≥ 1), relation (132) is true, with equality only for m = 2 or 3. Recently, K. Ford [141] has shown that (131) is true with c = 1/39.4 for all n. Further results can be found in F. Luca and C. Pomerance [271]. Cohen [85] proves also that (134) holds true for m equal to a product of Fermat primes. For such a product, there is equality iff m = F0 F1 . . . Fk for 0 ≤ k ≤ 4. (146) S. W. Golomb [150] remarks that if p > 3 and 2 p − 1 are primes, and m ∈ {2, 3, 8, 9, 15}, then x = (2q − 1)m is a solution to ϕ(σ (x)) = ϕ(x)

(147)

There are also other solutions, like x = 1, 3, 15, 45. Are there infinitely many? He gives also the particular solutions x = 1, 87, 362, 1257, 1798, 5002 and 9374 to 236


the equation σ (ϕ(x)) = σ (x)

(148)

If p and (3 p − 1)/2 are both primes, then x = 3 p−1 are solutions to σ (ϕ(x)) = ϕ(σ (x))

(149)

In fact, it can be proved that for all primes p ≥ 5, σ (ϕ( p)) > p > ϕ(σ ( p))

(150)

ϕ(σ (2 p−1 )) > 2 p−1 > σ (ϕ(2 p−1 ))

(151)

and for all primes p,

For these, and related results, see H. Iwata [208]. For two arithmetic functions f, g : N → N, put f,g (n) = | f (g(n)) − g( f (n))|,

n = 1, 2, . . .

(152)

J. Sándor [378] (see also [363], pp. 175-178) has proved that lim sup σ,ϕ (n) = +∞

(153)

lim inf σ,ϕ (n) = 0

(154)

n→∞

and conjectures that n→∞

He proves also that lim sup d,ϕ (n) = +∞, n→∞

lim inf d,ϕ (n) = 0 n→∞

(155)

and remarks that x = 1 and x = 2 p−1 ( p ≥ 3 prime) are solutions to d(ϕ(x)) = ϕ(d(x))

(156)

and asks for the general solutions. Let S(n) be the Smarandache function, defined by S(n) = min{k ≥ 1 : n|k!}. Without any assumptions, one has lim sup S,ϕ (n) = +∞, n→∞

lim inf S,ϕ (n) ≤ 1 n→∞

(157)

Now, x = p prime is a solution of the equation S(ϕ(x)) = ϕ(S(x)) 237

(158)

CHAPTER 3

What are the most general solutions of this equation? The equation σ (x) =x (159) ϕ x x (where [a] denotes the greatest positive integer ≤ a) has the single solution x = 1, since A. Oppenheim [326] showed that σ (n) ϕ n ≤ n for all n, (160) n with equality only for n = 1. A similar inequality is valid when σ is replaced with ψ (see [369], p. 7), so x = 1 is again the solution of the similar equation to (159), when σ is replaced with ψ. Also n ϕ n ≤ (ϕ(n))2 , (161) d(n) with equality only for n = 1, see [379]. The equation ϕ(|x m − y m |) = 2n

(162)

where m, n are given positive integers and m ≥ 2 has been studied by F. Luca [262]. He first proves that it suffices to find those (x, y) for which x > y ≥ 1; (x, y) = 1, and m = 4. (163) All solutions satisfying (163) are given by k−1

k−1

k

(x, y) = (22 + 1, 22 − 1), where k ≥ 1 and 22 + 1 prime; k or (x, y) = (22 , 1) for k = 0, 1, 2, 3

(164)

The determination of all positive integers x, y, m, n of the equation ϕ(x m − y m ) = x n + y n

(165)

is the main objective of another paper by F. Luca [263]. These solutions are given by (x, y, m, n) = (2k + 1, 2k − 1, 2, 1)

k ≥ 1 integer

(166)

The equation ϕ(|x m + y m |) = |x n + y n |

(167)

where x, y are integers, and m, n positive integers, has been studied in [264]. It suffices to consider x ≥ 0 and x ≥ |y|. A solution (x, y, m, n) of (167) is called trivial, if (k, 1 − k, 1, 1) for some positive integer k, or (168) (x, y, m, n) = (1, 0, m, n) for some positive integers m, n 238


All nontrivial solutions (i.e. satisfying x ≥ 0, x ≥ |y| and (168)) are given by  (2, 0, n + 1, n) for some positive integer n, or    (2, 2, n + 1, n) for some positive integer n, or (x, y, m, n) = (169) (3, 3, n + 1, n) for some positive integer n, or    (3, 1, 2, 1) It is not known (see [265]) if the equation ϕ(5m − 1) = 5n − 1

(170)

in positive integers m, n, has any solutions at all. The equation n ϕ = 2a (171) k n n has been considered in [266]. Since = , it suffices to suppose n ≥ 2k. k n−k Let A = {k ≥ 1 : ϕ(k) is a power of 2} (172) Then all solutions of equation (171) for n ≥ 2k are the following: 1) k = 1 and n ∈ A; 2) k = 2 and n is either a Fermat prime, or n ∈ {22 , 2 · 2 3 4 5 (173) 3, 22 , 22 , 22 , 22 }; 3) k = 3 and n ∈ {6, 10, 17, 18, 257, 65537}. Remark. It is well known that n ∈ A iff n either is a power of 2, or n = 2α p1 . . . pt , for some α ≥ 0, t ≥ 1, where p1 < · · · < pt are Fermat primes (i.e. n = 1, 2 or for n ≥ 3, the regular polygon with n sides can be constructed using only the ruler and compass), due to A. Cunningham from 1915 (see [103]. p. 140). Equations on the composition of Euler’s totient with Fibonacci or Lucas sequences appear in [267] and [268]. For example, in [267] it is proved that ϕ(Fn ) ≥ Fϕ(n) for all n ≥ 1,

(174)

with equality only for n = 1, 2, 3. A similar inequality is valid for d (with equality for n = 1, 2, 4), while for σ the sign of inequality is reversed (with equality for n = 1, 3). In [268] one can find: ϕ(L m ) = L n

(175)

iff (m, n) = (0, 1), (1, 1), (2, 0), (3, 0) (where L n+2 = L n+1 + L n , L 0 = 2, L 1 = 1 is the classical Lucas sequence); ϕ(Fm ) = L n 239

(176)

CHAPTER 3

iff (m, n) = (1, 1), (2, 1), (3, 1), (4, 0), (5, 3), (6, 3) (where F2 = Fn+1 + Fn , F0 = 0, F1 = 1 is the classical Fibonacci sequence). Let r and s be two non-zero integers with r 2 + 4s > 0. A binary recurrence sequence (u n )n≥0 is a sequence such that u 0 and u 1 are integers and u n+2 = r u n+1 + su n ,

n≥0

Let α, β denote the two roots of the equation x 2 − r x − s = 0. It is well known that u n = aα n + bβ n (n ≥ 0), where a, b are two constants. If (r, s) = 1, u 0 = 0, u 1 = 1, then (u n ) is called a Lucas sequence of the first kind; while if (r, s) = 1, u 0 = 2, u 1 = r , then (u n ) is called a Lucas sequence of the second kind. In [269] the following is proved: Let (u n ) be a Lucas sequence of the first kind such that its characteristic equation has real roots. Then ϕ(|u n |) ≥ |u ϕ(n) | for all n ≥ 1 (177) with equality iff: i) n = 1; ii) n = 2 and |r | = 1, 2; iii) n = 3, |r | = 1, and s = 1. A binary recurrent sequence is called nondegenerate if ab = 0. In [268] there are studied equations of type ϕ(|au n |) = |bvn |

(178)

where (u n ), (vn ) are certain binary recurrent sequences, and (u n ) is nondegenerate.

6

Perfect totient numbers and related results

As we have seen in 5. of 3.2, the iteration of Euler’s totient has some interesting congruence properties. In 1975 T. Venkataraman [469] defined a perfect totient number n by T (n) ≡ ϕ(n) + ϕ (2) (n) + ϕ (3) (n) + · · · + ϕ (r ) (n) = n

(179)

where r = r (n) is the smallest integer such that ϕ (r ) (n) = 1. We note that the function r (n) was first considered by S. S. Pillai, for its properties see e.g. [291], p. 35. Venkataraman proves that if n = 3 · (4 · 3m−1 + 1) with 4 · 3m−1 + 1 = prime, then n is a perfect totient number. (180) The study of PTN (for perfect totient numbers) however was initiated by L. P. Cacho [59], who in fact proved that 3 p, for an odd prime p, is a PTN if and only if p = 4n + 1, where n is a PTN. Then Venkataraman’s result (180), follows as a corollary. A. L. Mohan and D. Suryanarayana [292] proved that 3 p ( p = odd prime) is not a PTN, if p ≡ 3 (mod 4). They found also sufficient conditions on an odd prime p for 32 · p and 33 · p to be PTNs. For example, if b ≥ 0 is an integer, and 240


if q = 25 · 3b + 1, p = 2 · 32 · q + 1 are both prime, then 32 p is a PTN; and if q = 24 · 3b + 1 and p = 22 · q + 1 are both prime, then 33 · p is PTN. (180’) In a recent paper, D. E. Iannucci, D. Moujie and G. L. Cohen [205] have obtained similar results. They gave also a table on all PTN less than 5 · 109 , which are not powers of 3 (3k is PTN, as immediately follows). There are 30 such PTN. We quote the following results from [205]: If b ≥ 0 and q = 23 · 3b + 1 and p = 2q + 1 are both prime, then 32 · p is PTN. If r = 22 · 3b + 1, q = 24 · r + 1, p = 22 · q + 1 are all prime, then 33 p is PTN. There are no PTNs of the form 3k p (k ≥ 4), where p = 2c · 3d · q + 1 and q = 2a · 3b + 1 are primes with a, c ≥ 1 and b, d ≥ 0. (180”) Equation (179) has been considered also by D. L. Silverman [416]. P. Erdös and M. V. Subbarao [130] note that T (n) = (1 + o(1))ϕ(n), for almost all n,

(181)

T (n) < n, for almost all n.

(182)

so that They also note that

T (n) >

3n for infinitely many n, 2

(183)

and that

T (2n) =1 (184) 2n n→∞ Let F(x, c) = car d{n ≤ x : T (n) > cn}, where c > 0. Then for every 3 1 < c < we have for every t > 0 and ε > 0, that 2 x x (185) (log log x)t < F(x, 1 + c) < log x (log x)1−ε lim sup

for all x ≥ x0 (c, t, ε). Further, we have F(x, 1) = (c + o(1))

x log log log log x

(186)

The details of proofs for (183)-(186) are not worked out in [130], but the authors state that they follow by the methods of this paper and that of [117]. 3 Erdös and Subbarao conjecture that for 1 < c1 < c2 < , 2 lim

x→∞

F(x, 1 + c1 ) =∞ F(x, 1 + c2 ) 241

(187)

CHAPTER 3

x 3 =o F x, 2 log x Some other unanswered questions are: r (n) have a distribution function? Does log n r (n) approach a limit for almost all n? Does log n ∗ Let r ∗ = r ∗ (n) be the smallest integer such that (ϕ ∗ )(r ) = 1, where ϕ ∗ unitary analogue of Euler’s totient. It is not known if and that

r ∗ (n) < c log n has infinitely many solutions for some c > 0.

(188)

(189) (190) is the (191)

M. Lal [235] computed for n ≤ 105 the maximum and minimum values of n for ∗ a given r ∗ such that (ϕ ∗ )(r ) = 1. He obtained the bounds log n < r ∗ (n) < 2.5 log n for n ≤ 105

3.4 1

(192)

The totatives (or totitives) of a number Historical notes, congruences

As we have mentioned in the introduction, in 1879, J. J. Sylvester called the positive integers r < n which are coprime with n the totatives (or ”totitives”, see e.g. [103], p. 124, or [194]). We note that theorem (126) of 3.2 gives all totatives of a number, which are prime numbers (except 1), a result due to S. Schatunowsky. In 1888 H. W. Lloyd Tanner (see [103], p. 131) studied the group G of the totatives of a number, finding all of its subgroups and the simple groups whose direct product is G. nϕ(n) , (1) It is easy to see that the sum of totatives of n is 2 due to A. L. Crelle from 1845. Let t (n) denote the set of totatives of n, i.e. t (n) = {k : 1 ≤ k < n, (k, n) = 1}. In 1850 A. Thacker introduced the function φ j (n) = t j , j ≥ 0, (2) t∈t (n)

(i.e. the sum of jth powers of totatives of n), and noted that for j = 0 it reduces to Euler’s totient. Let n = p1a1 . . . prar be the prime factorization of n, and put s j (m) = 1 j + 2 j + · · · + m j . Thacker proved the following formula: j n j j n + − ... (3) φ j (n) = s j (n) − p1 s j p1 p2 p1 p1 p2 p1 , p2 p−1 242


where the summation indices range over the combinations of p1 , p2 , . . . one, two,... at a time. Various authors, as J. Binet, J. Liuoville, E. Lucas, E. Cesàro, L. Gegenbauer, etc. obtained other formulae, by using Bernoulli numbers or binomial coefficients. W. Brennecke in 1852 proved that 1 2 ω(n) γ (n) (4) φ2 (n) = ϕ(n) n + (−1) 3 2 1 φ3 (n) = nϕ(n)[n 2 + (−1)ω(n) γ (n)] (5) 4 where γ (n) = p1 p2 . . . pr is the ”core” of n, while ω(n) denotes the number of distinct prime factors of n. For new proof, see [98]. J. Binet in 1851 proved that φk (n) ≡ 0 (mod n) if k is odd;

(6)

and Mennesson showed in 1878 that 1 φk (n) ≡ ϕ(n k+1 ) (mod k), if k is odd 2

(7)

N. Nielsen proved in 1915 that φ2k (n) ≡ 0 (mod n),

φ2k+1 (n) ≡ 0

(mod n 2 )

(8)

p1 − 3 , with p1 = p(n) = smallest prime divisor of n. J. Liouville where 1 ≤ k ≤ 2 in 1857 proved the identity n φk (d) = sk (n) = 1k + 2k + · · · + n k , (9) d d|n which for k = 0 reduces to Gauss’ formula

ϕ(d) = n.

d|n

In 1932 H. Davenport [94] rediscovered Thacker’s function and proved an asymptotic formula on it. For generalizations, in the regular convolutions setting, see L. Tóth and P. Haukkanen [459]. In 1985 P. S. Bruckman [57] proposed for the Dirichlet series of φk (n) given by ∞ φk (n) the identity f k (s) = ns n=1 k+1 k+1 1 Bk+1− j ζ (s − j) f k (s) = 1 + j (k + 1)ζ (s − k) j=1 243

CHAPTER 3

where Bm are Bernoulli numbers. For a generalization, see H. W. Gould and T. Shon hiwa [153], where functions of type f (t) and f (t) are also 1≤t≤n,(t,a)=m

studied. (Here (t, a) = gcd(t, a), [t, a] = lcm(t, a)). In 1889 C. Leudesdorf [253] introduced the function ψ j (n) =

1 , tj t∈T (n)

1≤t≤n,[t,a]=m

j ≥0

(10)

which is another extension of Euler’s totient. He proved that for j = odd one has ψ j (n) =

1 2 1 An − jnψ j+1 (n) 2 2

(11)

for certain integer A. As a corollary he deduced, that if n = p s q, where q is not divisible by the prime p > 3, then ψ j (n) ≡ 0 (mod p 2s ). (12) unless ( j, p) = 1 and ( p − 1)|( j + 1). For example, ψ j ( p) ≡ 0 (mod p 2 ). Similarly, if p = 3, ψ j (n) ≡ 0 (mod 32s ) if j is an odd multiple of 3; (13) and ψ j (n) ≡ 0 (mod 22s−1 ) if p = 2, except when q = 1

(14)

For j = 1, by putting S = ψ1 (n) one obtains (see also [179]) S ≡ 0 (mod n 2 ) 1 S ≡ 0 (mod n 2 ) 3 1 S ≡ 0 (mod n 2 ) 2 1 S ≡ 0 (mod n 2 ) 4

if 2 n, 3 n; if 2 n, 3|n; if 2|n, 3 n, n not a power of 2

(15)

if n = 2a

We note that the congruence S ≡ 0 (mod p 2 ) (n = p = prime) was first proved by J. Wolstenholme [483] (see also [367]). Extensions of Leudesdorf’s theorem were obtained e.g. by M. Rama Rao [345], I. Sh. Slavutskii [427]. See also [428]. For example, Slavutskii [427] proves the following:  n (1 − p t−1 )Bt (mod n 2 ) for 2| j     p|n  ψ j (n) ≡ (15 )  t  t−2 2    2 n (1 − p )Bt−1 (mod n ) otherwise p|n 244


where t = (ϕ( pl ) − 1)n (l ≥ 1 integer), and (n, 6) = 1. Here Bt denotes the tth Bernoulli number (the Bernoulli numbers (Bn ) are generated by x/(e x − 1) = ∞ Bn x n /n!, |x| < 2π , see Chapter V). n=0

By applying the von Staudt-Clausen theorem for Bernoulli numbers (see Chapter V), (15’) implies the following corollary: 1) If 2| j and ( p, n) = 1 for all prime numbers p such that ( p − 1)| j, then ψ j (n) ≡ 0 (mod n) 2) Let j be odd. a) If p − 1 does not divide j + 1 for any prime p with p|n, then ψ j (n) ≡ 0 (mod n 2 ) b) If p| j for all primes p such that ( p − 1)|( j + 1) and p|n, then ψ j (n) ≡ 0

(mod n 2 ).

For a positive integer x, and t ∈ t (n), let (x − t) f n (x) =

(16)

t∈t (n)

By the classical Lagrange theorem one has f n (x) ≡ x ϕ(n) − 1 (mod n), if n is prime

(17)

However, for all n, the congruence (17) is not valid. In 1902 M. Bauer proved that if pa n ( p prime), then f n (x) ≡ (x p−1 − 1)ϕ(n)/( p−1)

(mod pa )

(18)

Particularly, f pa (x) ≡ (x p−1 − 1) p

a−1

(mod pa )

(19)

Another result by M. Bauer states that for m > 2 even and 2a n one has f n (x) ≡ (x 2 − 1)ϕ(n)/2

(mod 2a )

(20)

(mod 2a )

(21)

Particularly, a−2

f 2a (x) ≡ (x 2 − 1)2

For proofs of Bauer’s theorems see Hardy-Wright [179]. 245

CHAPTER 3

Recently A. Junod [217] has extended (18) as follows: If p is a prime and m, n ≥ 0 are integers, and f (x) ∈ Z p [x]; or d p (m) ≥ 1, then

f (x − km) ≡ f (x)n

(mod

0≤k 30 (39) Theorems (36) and (37) are based on more advanced results of Number theory, as the Siegel-Walfisz theorem; as well as an improvement of (39) for large values of n: p ∗ (n) < c log n (c > 0, constant)

(40)

In fact, the arithmetical function p ∗ was introduced by B. R. Srinivasan [437], who proved that p ∗ (n) lim sup = 1, (41) n→∞ log n 248


and

p ∗ (n) ∼ Ax,

(42)

n≤x ∞ pr +1 − pr , and pr is the r th prime. p p . . . pr r =1 1 2 In 1969 Y. Sankaran [387] improved (42) to

where A = p1 +

p ∗ (n) = Ax + O(log x)

(43)

n≤x

4

Adding units (mod n)

When n ≥ 2, for the set of totatives of n, t ∈ t (n), the classes t in the ring Zn of residue classes modulo n, form a multiplicative group Z∗n , called also as the group of units of the ring Zn . If 1 ≤ k ≤ n − 1, one can ask how many solutions (t, t ) ∈ Z∗n × Z∗n there are, such that

t +t =k

(44)

Let s(k) be the number of solutions to (44). Then M. Deaconescu [95] proves that s(k) is given by ϕ(n) s(k) = ψ(d, n) (45) ϕ(n/d) where d = (k, n), and ψ(d, n) is the number of those automorphisms of the additive group of Zn , having exactly d fixed points (i.e. with the property f (k) = k for such r piai is the prime an automorphism f of (Zn , +)). In [96] it is proved that if n = factorization of n, and d =

r

i=1

pibi

is a divisor of n (0 ≤ bi ≤ ai ), then

i=1

ψ(d, n) =

piai −bi −1 ( pi − 1)

pi |n/d pi |d

a −1

pj j

( p j − 2)

(46)

p j |n/d p j d

A corollary of (45) and (46) is the following proposition: 1) If n ≥ 2 is odd, then every element of Zn is a sum of two units (i.e. (44) has always solutions). (47) 2) If n ≥ 2 even, then k ∈ Zn is a sum of two units if and only if k is even. 249

CHAPTER 3

5

Distribution of inverses (mod n)

For each t ∈ t (n) there exists a unique totative t, which is the multiplicative inverse of t (i.e. t · t ≡ 1 (mod n)). Then Z. Zheng in 1993 [493] proved that when n is odd, √ 1 car d{t ∈ t (n) : t + t ≡ 1 (mod 2)} = ϕ(n) + O( n · d(n) log2 n) 2

(48)

The proof makes use of estimates for character and Kloosterman-sums. When n is a prime power, or a product of two distinct primes, similar results have been deduced by W. Zhang [489]. In the same year, he settled also the general case (i.e. n = odd), too, see [490]. A generalization of (48) is given in [494]: car d{t ∈ t (n) : t +t ≡ 1 (mod 2), t ≤ m} =

√ m ϕ(n) · + O(d(n) n ·log2 n) (49) 2 n

where n is odd, and 1 ≤ m < n is a fixed integer. For m = n − 1, one reobtains (48). Another generalization of (48) has been obtained by I. Z. Ruzsa and A. Schinzel [360]: For every choice of ε = 0, 1 and d = −1, +1 and odd n we have t car d t ∈ t (n) : t + t ≡ ε (mod 2), =δ = n =

√ ϕ(n) cn,δ + O(2ω(n) n · log2 n) 4

(50)

t denotes a where cn,δ = 1 + δ if n is a perfect square; and =1, otherwise. Here n Legendre symbol, and ω(n) is the number of distinct prime factors of n. Let n > 2 be arbitrary and 0 < δ ≤ 1 be fixed. Then √ car d{t ∈ t (n) : |t − t| < δn} = δ(2 − δ)ϕ(n) + O(d 2 (n) n · log3 n) (51) This is due to W. Zhang [491]. In [492] W. Zhang shows that for n > 2,

(t − t)2k =

t∈t (n)

ϕ(n)n 2k + O(4k d 2 (n)n (4k+1)/2 log2 n) (2k + 1)(k + 1)

where k ≥ 1 is a fixed positive integer. 250

(52)


Let n > 2 be an odd integer such that there exists a primitive root mod n. Let A denote the set of all primitive roots modulo n which are < n. Then t ∈ A ⇒ t ∈ t (n), and ∗

(t − t)2k =

t∈A

ϕ(ϕ(n))n 2k + O(4k d 2 (n)n 2k+3/4 log2 n) (2k + 1)(2k + 2)

(53)

where the sum is taken for t + t ≡ 1 (mod 2) (i.e. t and t are of opposite parity). Formula (53) is due to H. Wang, Z. Hu and L. Gao [474].

3.5 1

Cyclotomic polynomials Introduction, irreducibility results

The nth cyclotomic polynomial n (x) is given by (x − ζt ) n (x) =

(1)

t∈t (n)

where ζt are the primitive roots of unity of order n, i.e. ζt = e2πit/n for 1 ≤ t < n, (t, n) = 1. Another notation used in the literature, is Fn (x) for n (x), which has an old and long history. Since every nth root of unity is a primitive dth root of unity for some uniquely determined d|n, one has xn − 1 = d (x), (2) d|n

which by the Möbius inversion formula (see Chapter 2) implies log n (x) = {log(x n/d − 1)}µ(d), d|n

giving n (x) =

(−1 + x n/d )µ(d)

(3)

d|n

If the prime factorization of n > 1 is n = p1a1 p2a2 . . . prar , then (3) implies n (x) =

(x n − 1)(x n/ p1 p2 − 1)(x n/ p1 p3 − 1) . . . (x n/ p1 − 1)(x n/ p2 − 1) . . . (x n/ p1 p2 p3 − 1) . . .

(4)

Formula (4) was proved by A. Cauchy in 1829 (see [103], p. 184), and it implies immediately that n (x) is of integer coefficients (with leading coefficient 1) with degree ϕ(n). 251

CHAPTER 3

From (3) (or (4)) follows that np (x) =

n (x p ) , if p n ( p prime), n (x)

np (x) = n (x p ), if p|n

(5) (6)

For an odd prime p, (4) gives p (x) = 2 p (x) = 4 p (x) =

xp − 1 = x p−1 + x p−2 + · · · + x + 1, x −1

(7)

(x 2 p − 1)(x − 1) = x p−1 − x p−2 + · · · − x + 1, (x p − 1)(x 2 − 1)

(x 4 p − 1)(x 2 − 1) = x 2 p−2 − x 2 p−4 + · · · − x 2 + 1, (x 2 p − 1)(x 4 − 1)

(8)

etc., so one can write the following special cyclotomic polynomials: 1 (x) = x − 1, 2 (x) = x + 1, 3 (x) = x 2 + x + 1, 4 (x) = x 2 + 1, 5 (x) = x 4 + x 3 + x 2 + x + 1, 6 (x) = x 2 − x + 1, 7 (x) = x 6 + x 5 + x 4 + x 3 + x 2 + x + 1, 8 (x) = x4 + 1, 9 (x) = x 6 +x 3 +1, 10 (x) = x 4 −x 3 +x 2 −x +1, 11 (x) = x 10 +x 9 +x 8 +x 7 +x 6 + x 5 +x 4 +x 3 +x 2 +x +1, 12 (x) = x 4 −x 2 +1, 15 (x) = x 8 −x 7 +x 5 −x 4 +x 3 −x +1, 20 (x) = x 8 − x 6 + x 4 − x 2 + 1, 21 (x) = x 12 − x11 + x 9 − x 8 + x 6 − x 4 + x 3 − x + 1. For n > 1, n (0) = 1 (i.e. constant term =1); p, if n = pa ( p prime) (9) n (1) = 1, otherwise (i.e. ω(n) ≥ 2) An important result is the irreducibility of the cyclotomic polynomial n (x) over the rational field. For n = prime, this was established by C. F. Gauss [146] in 1801. The first proof of the general case was given by L. Kronecker [232] in 1854. He proved actually a stronger result, namely that n is relatively prime to the discriminant of a polynomial with integer coefficients f (x), then n (x) remains irreducible over the field generated by any root of f (x). (10) There are many other irreducibility proofs for n (x). In 1857, 1858, resp. 1859 R. Dedekind [100], F. Arndt [14], resp. V. A. Lebesgue [243]; for a survey of proofs up to 1907 see M. Ruthinger [358]. Further proofs are due to K. Grandjot (1924) [155], H. Späth (1927) [435], E. Landau (1929) [238], I. Schur (1929) [401], F. Levi (1931) [254], T. Skolem (1949) [426], etc. L. Weisner [475] considered quadratic fields over which the cyclotomic polynomials are reducible, and more generally polynomials f (g(x)) reducible in fields in which f (x) is reducible [476]. The factorization of n (x) in quadratic fields and their composites was studied by D. Pumplün [341], 252


who generalized previous work by H. Petersson [329]. Simple proofs of factorization (mod p) of n (x) may be found in R. Ballieu [25] or W. J. Guerrier [166]. In 1960 I. Seres [407] considered questions concerning the irreducibility of polynomials of the form n (P(x)), where P(x) is a polynomial. In [478] one can read that C. Nicol proved that p (x) + q (x) is irreducible for p, q primes; while generally for m, n > 1, if m (x) + n (x) factors, then for m, n ≤ 150, the factors contain a cyclotomic polynomial, e.g. 7 (x) + 22 (x) = 4 (x)(x 8 − x 7 + 2x 4 + 2)

(11)

Is this generally true (or what conditions should be assumed)?

2

Divisibility properties

There are many divisibility properties of the cyclotomic polynomials or related objects. The following theorem is due essentially to L. Kronecker [233] (see also T. Nagell [306], p. 164-167): If p n is a prime, then n (x) ≡ 0 (mod p)

(12)

is solvable iff p ≡ 1 (mod n). If p ≡ 1 (mod n), the solutions of congruence (12) are the numbers which belong to the exponent n(modulo p). If x is a solution, then the number n (x) is divisible by exactly the same power of p as x n − 1. (13) The particular case n = p k was discussed by A. S. Bang in 1886 (see [103], p. 385). Bang proved also that if a > 1, n ≥ 3, then n (a) has a prime factor ≡ 1 (mod n) except for 6 (2). (14) In 1905 L. E. Dickson (see [103], p. 388) showed that for a > 1, n (a) has a prime factor not dividing a m − 1 (m < n) except in the cases n = 2, a = 2k − 1, and n = 6, a = 2. (15) The following result is due essentially to Dickson (see also [306] p. 166): Suppose p is a prime factor of n, and put n = pa n 1 , where p n 1 . Then the congruence (12) is solvable iff p ≡ 1 (mod n 1 ). In this case, the solutions are the numbers which belong to the exponent n 1 (modulo p). If x is a solution, then n (x) is divisible by p (16) and not by p 2 , provided that n > 2. More general results for the homogeneous form of n (x) were obtained by R. D. Carmichael in 1909. As a corollary of theorem (13) we note that: For n > 1 there are infinitely many primes ≡ 1 (mod n). (17) Indeed, if there would be only a finite numbers of such primes, let P be their product. Put x = n P y (y > 0, integer). Then by (13), every prime factor of n (n P y) must 253

CHAPTER 3

be ≡ 1 (mod n). But this is impossible, since n (n P y) ≡ n (0) ≡ 1 (mod n P) (see [306], p. 168). Similar proofs of theorem (17) (i.e. a particular case of Dirichlet’s Theorem on primes in arithmetic progressions), by use of cyclotomic polynomials were obtained by A. S. Bang and J. J. Sylvester (see [103], p. 418). In 1896 A. Hurwitz (see [103], p. 378) proved the following primality criterion: If there exists an integer a such that n−1 (a) ≡ 0 (mod n) then a = prime. For example, when n = 2k + 1, since 2k (x) = x 2 theorem on the primality of Fermat numbers. We note that for n odd one has 2n (x) = n (−x), and that for all n, 1 ϕ(n) = n (x) x n x

(18) k−1

+ 1, we get a (19) (20)

which can be proved also by (3). (For an irrationality result based on (20), see [363], p. 286). In 1880 A. E. Pellet (see [103], p. 245) considered the equation f n (y) = 0,

(y = x +

1 , n (x) = 0) x

(21)

i.e. the equation of degree ϕ(n) derived from n (x) = 0 by the substitution y = 1 x + . He proved that if p n is a prime, and x f n (y) ≡ 0

(mod p)

(22)

has an integral root a, then n (x) is divisible modulo p by x 2 − 2ax + 1. Either the latter has two real roots and n (x) and f n (y) have all their roots real and p − 1 is divisible by n, or it is irreducible and n (x) is a product of quadratic factors (modulo p) and the roots of f n (y) are all real and p + 1 is divisible by n. If n divides neither p + 1 nor p − 1, f n (y) is a product of factors of equal degree (modulo p). (23) 1 J. J. Sylvester (1880) introduced similarly gn (y) by setting y = x + in x n (x)/(x ϕ(n)/2 ) (see [103], p. 384). He stated that every divisor of gn (y) is of the form ±1 (mod n), with the exception that, if n = p k ( p ∓ 1)/m, then p is a divisor (but not p 2 ). Conversely, every product of powers of primes of the form ±1 (mod n) is a divisor of gn (y). (24) 254


In 1888 L. Kronecker and M. Bauer (see [103], p. 385) remarked that x+y ϕ(n) (x − y) n = h n (x, y 2 ) x−y

(25)

is a polynomial with integer coefficients, involving only even powers of y. For the prime factors of h n (x, s), the following is true (s is given): If p is prime, and p n, p s, then s (mod n) (26) p≡ p In 1912 G. Fontené (see [103], p. 390) considered the homogeneous form a n (a, b) derived from n (x) by setting x = . If a and b are relatively primes, b then every prime divisor of n (a, b) is of the form ≡ 1 (mod n), unless it is divisible by the greatest prime factor p of n. It has this factor p if p −1 is divisible by n/ p α (where p α n), and a, b satisfy n/ pα (a, b) ≡ 0 (mod p), the latter having for each (b, p) = 1 a number of roots a equal to the degree of the congruence. In particular, if n = pa ( p prime), every prime factor of n is of the form ≡ 1 (mod n), with the exception of a divisor p occurring if a ≡ b (mod p), and then to the first power if n = 2. (27) When a, b are special complex numbers, results on the prime factors of n (a, b) have been obtained by T. N. Shorey and C. L. Stewart [413]. Let a, b ∈ C such that a (a +b)2 and a ·b are nonzero, relatively prime integers, with not a root of unity. Let b P(m) denote the greatest prime divisor of m, and let by convention P(0) = P(±1) = 1. Put Pn = P( n (a, b)) for n ≥ 3. Then for any k with 0 < k < 1/ log 2, and any integer n > 3, with at most k log log n distinct prime factors, we have Pn > C(ϕ(n) log n)/2ω(n)

(28)

where C > 0 is effectively computable in terms of a, b and k. For almost all integers n, Pn > n(log n)2 /k(n) log log n,

(29)

where k : N → R is any function with the property k(n) → ∞ as n → ∞. Finally we state certain simple divisibility properties related to n . As we have seen by relation (94 ) (see 5 of 3.2) one has n|ϕ( n (a)) for any a > 1. A similar property is due to A. Bartholomé [28]: k| n (a k ) for infinitely many n for any (a, n) = (2, 1). 255

(30)

CHAPTER 3

R. Wang [473] proves that if p is a prime, and n > 2, n| p − 1; if p1 , . . . , pϕ(n) are primes satisfying n ( pi ) ≡ 0 (mod p),

i = 1, ϕ(n),

(31)

then ϕ(m) ≡ α or 1 (mod p) according as ω(n) = 1 and n is an αth power of a prime, or ω(n) > 1, with m = p1 . . . pϕ(n) . E. Vantieghem [463] proves the congruence (x − y t ) ≡ n (x) (mod n (y)) for n ≥ 2 (32) t∈t (n)

By using (32) with x = 1, y = 2 he proves the following primality criterion: Let p > 2. Then p is prime iff p−1 (2k − 1) ≡ p

(mod (2 p − 1))

(33)

k=1

H. W. Leopoldt [252] rediscovered Bang’s result (14), and used it to solve a problem by Kostrikhin: find all pairs (a, n) with a, n > 1 such that for all primes (34) p|(a n − 1) one can find an m < n such that p|(a m − 1). For n = 2 all pairs (2s − 1, 2) with s ≥ 2 satisfy the property, while for n ≥ 3 the only pair is (2,6). (35) Cyclotomic polynomials are also used for factorization methods of integers, see e.g. E. Bach and J. Shallit [20], or R. P. Brent [52].

3

The coefficients of cyclotomic polynomials We will now treat the coefficients of cyclotomic polynomials. Let n (x) =

ϕ(n)

a(m, n)x m

(36)

m=0

If n is prime, then a(m, n) = 1 for all m. When n = pq, with p, q distinct primes, then A. S. Bang [26] and A. Migotti [290] have proved that a(m, n) ∈ {−1, 0, +1} for all m

(37)

Migotti showed also that a(7, 105) = −2. Since for all n ≤ 104, (37) holds true (see P. Erdös [120]), 105 (x) is the first cyclotomic polynomial which has other coefficients than 0 and ±1. The number m = 7 is minimal, with |a(m, n)| > 1 for some n, see M. Endo [108]. In fact, every integer appears as a coefficient of a certain cyclotomic polynomial, see J. Suzuki [450]. 256


Now, when n = pq, besides (37) there are known some special results. M. Beiter [34] has proved that a(m, n) =

(−1)δ , if n = αq + βp + δ in exactly one way, 0, otherwise

(38)

where α, β are nonnegative integers and δ = 0, 1. L. Carlitz [62] proved that if p < q, the number of positive coefficients is equal to θ = ( p − u)(uq + 1)/ p (39) where u is defined by qu ≡ −1 (mod p), 0 < u < p. Therefore, the total number of nonzero coefficients is 2θ − 1 = 2( p − u)(uq + 1)/ p − 1

(40)

T. Y. Lam and K. H. Leung [237] have recently rewritten the results in another form. Write ( p − 1)(q − 1) = r p + sq (41) and let 0 ≤ k ≤ ( p − 1)(q − 1). Then a(m, n) = 1 iff k = i p + jq for some i ∈ [0, r ] and j ∈ [0, s]; a(m, n) = −1 iff k + pq = i p + jq for i ∈ [r + 1, q − 1] and j ∈ [s + 1, p − 1]; otherwise a(m, n) = 0. (42) The number of terms having ak = 1 is (r + 1)(s + 1), and those with ak = −1 is ( p − s − 1)(q − r − 1). Furthermore, for p < q, the middle coefficient is (−1)r . (43) Let A(n) = max{|a(m, n)| : m = 0, 1, . . . , ϕ(n)}. The following result is essentially due to Bang [26]: If n has three distinct odd prime factors p < q < r , then An ≤ p − 1 (44) If n has fewer than three odd prime factors, then An = 1. (45) D. M. Bloom [45] showed that if An = p − 1 in (44), with p ≥ 5, then neither q nor r is ≡ ±1 (mod p). (46) Bloom proved also that if n has four odd prime factors p < q < r < s, then An ≤ p( p − 1)( pq − 1)

(47)

In 1931 I. Schur showed that (see [251]) lim sup An = +∞ n→∞

257

(48)

CHAPTER 3

by proving that if m is any odd number and if n = p1 p2 . . . pm , p1 < p2 < · · · < pm , p1 + p2 > pm ( pi primes), then a( pm , n) = m − 1

(49)

E. Lehmer [251] showed that (An ) is unbounded, even when n is a product of only three primes, by proving that if p, q = kp + 2 and r = (mpq − 1)/2 are all primes, and if h = ( p − 3)(qr + 1)/2, then a(h, pqr ) =

p−1 2

(50)

W. Bosma [47] has recently used Magma system for computational algebra to list for |a| ≤ 50 the least n for which a appears as a coefficient of n (x). In fact, values n ≤ 26565 suffice for all a with |a| ≤ 50 with the exception of a = −50, which occurs for the first time in 40755 (x) as coefficient of x 1082 . ϕ(n) n has ϕ(n) roots x j , j = 1, ϕ(n). Let αk = αk (n) = x kj be the Ramanujan j=1

sum (denotes also as C(k, n)). By using Newton’s formulae concerning symmetric polynomials, we can write α1 b0 + b1 = 0 α2 b0 + α1 b1 + 2b2 = 0 ... αi b0 + αi−1 b1 + · · · + ibi = 0 ... αϕ(n) b0 + αϕ(n)−1 b1 + · · · + ϕ(n)bϕ(n) = 0

(51)

where n (x) =

ϕ(n)

a(m, n)x m = b0 x ϕ(n) + b1 x ϕ(n)−1 + · · · + bϕ(n) = 0

(52)

m=0

We may view (51) and (52) as a system of equations in the ϕ(n) + 1 unknowns b0 , b1 , . . . , bϕ(n) (x being an arbitrary primitive root of unity), and since b0 = 1, the determinant of thus homogeneous system must be zero. By developing this determinant under the ϕ(n) + 1 th row (i.e. the one which contains x ϕ(n) , x ϕ(n)−1 , . . . , 1) one gets that n (x) = x ϕ(n) +

(−1) (−1)i (−1)ϕ(n) A1 x ϕ(n)−1 +· · ·+ Ai x ϕ(n)−i +· · ·+ Aϕ(n) (53) 1! i! n! 258


where Ai (obtained by Laplace’s rule) is given by α1 1 0 0 0 ... 0 α2 α1 2 0 0 ... 0 α3 α α 3 0 . . . 0 2 1 Ai = ... ... ... ... ... αi−1 αi−2 αi−3 . . . . . . . . . i − 1 α αi−1 αi−2 . . . . . . . . . α1 i

(i = 1, ϕ(n))

(54)

Since by Hölder’s theorem n n /ϕ αk (n) = ϕ(n)µ (n, k) (n, k)

(55)

by (54), all coefficients of n (x) can be determined (at least, in theory), see M. Deaconescu and J. Sándor [98] or D. H. Lehmer [246]. For example, in (52) one has

b1 = −µ(n),

 u(u − 1), if n is odd    u(u − 1) , if n = 2m, m odd b2 = 2  u   − , if n = 2k m, m odd, k > 1 2

(56)

where u = µ(m). A complicated formula can be written for b3 . When (n, 6) = 1, 1 b3 = − (u 3 − 3u 2 + 2u) 6

(57)

for a particular table of values up to b10 , see [246]. By using Bernoulli and Stirling numbers, Lehmer determines exactly also the coefficients of n (x + 1). For example, the constant term is e(n) ; the coefficient 1 of x is ϕ(n)e(n) , where (n) is the von Mangoldt function. (These were known 2 essentially to Lebesgue and Hölder). The coefficient of x k is e(n) Rk {ϕ(n), J2 (n), J4 (n), . . . , J2h (n)}

(58)

where 2h ≤ k < 2h + 2, Rk is a polynomial with rational coefficients, and Jm (n) is Jordan’s totient function. Bounds for the coefficients a(k, n) of x k in n (x) given by (36) were obtained by P. Erdös and R. C. Vaughan [131]: |a(k, n)| < exp{ck 1/2 + c1 k 3/8 } 259

(59)

CHAPTER 3

and

1/2 k 1 , lim sup |a(k, n)| > exp c2 625 log k n→∞

k > k0 ,

(60)

1/2 2 1− 2 , and c1 , c2 are other constants. where c = 2 p +p p prime When n (x) is given by (52), H. Möller [293] proved that

|bi (q1 q2 . . . qs )| ≤

2q1 q1 − 1

2s−4 s−2 s−k−1 −1 · (qk − 1)2 ,

(s ≥ 4)

(61)

k=1

where q1 < · · · < qs are arbitrary odd primes. Schur’s theorem (48) was improved for the first time in 1946 by P. Erdös [120]: An > exp{c1 (log n)4/3 } for infinitely many n

(c1 > 0)

Later [121] he refined this to c log n for infinitely many n An > exp exp log log n P. T. Bateman [32] proved that log n An < exp exp(log 2 + o(1)) log log n

(c > 0)

(62)

(63)

(64)

and R. C. Vaughan [466] showed that the constant log 2 is best possible. Similarly c = log 2 in (63) is best possible. (65) A(n) depends essentially on the squarefree kernel of n. Bateman, Pomerance and Vaughan [33] have showed that if s ≥ 3, and q1 < · · · < qs are odd primes, then s−2 S(q1 . . . qs ) s−k−1 −1 < A(q1 . . . qs ) < qk2 q1 . . . qs k=1

where S(n) =

ϕ(n)

(66)

|a(m, n)|.

m=0

In 1990 H. Maier [274] stated the following result: Let ε(n) be a function defined for all positive integers n such that ε(n) → 0 as n → ∞. Then A(n) ≥ n ε(n) for almost all n 260

(67)


In another paper [275] it is shown that for any N > 0 there exist numbers c(N ) > 0, x0 (N ) ≥ 1 such that car d{n ≤ x : A(n) ≥ n N } ≥ c(N )x

(68)

In [276] it is considered the following counterpart of (67): Let ψ(n) be a function defined for all positive integers n such that ψ(n) → ∞ for n → ∞. Then A(n) ≤ n ψ(n) for almost all n. Some recent work has been concerned with B(m) = max{|a(m, n)| : n ≥ 1} = lim sup |a(m, n)|. n→∞

In 1985 H. L. Montgomery and R. C. Vaughan [296] proved that log B(m) m 1/2 (log 2m)−1/4 (69) log B(m) m 1/2 (log m)−1/4 √ which show that log B(m) has order of magnitude m(log m)−1/4 for large m. G. Bachman [21], improving (69) showed that

√ log log m m 1+O (70) log B(m) = C (log m)1/4 log m where C is an explicitly given constant. The proof includes the Hardy-Littlewood circle method and estimates on exponential sums with multiplicative coefficients. Finally we note that L. Carlitz [63] studied questions related to the sum of squares of n (x).

4

Miscellaneous results This last section includes miscellaneous results on cyclotomic polynomials. Certain inequalities for n (x) are: (x − 1)ϕ(n) < n (x) < (x + 1)ϕ(n) for x > 1, n > 1

(71)

(see [252]) and

x −1 x

2r −2

x2 − 1 x2

2r −2 x

ϕ(n)

< n (x)
1, n > 1, (72)

CHAPTER 3

If n ≡ 1 (mod 2), then

x x +1

2r −1 x

ϕ(n)

< n (−x)
2, then

x −1 x

2r −3

x2 − 1 x2

2r −3 x

ϕ(n)

< n (−x)
n(2n + 1) (75) Consider the function f : [1, ∞) → R, f (t) = n (t), where n is the nth cyclotomic polynomial. K. Motose [304] proved that f is a strictly increasing function for all n. (76) A theorem of T. M. Apostol [11] and F.-E. Diederichsen [105] gives the value of the resultant of cyclotomic polynomials m and n for m > n > 1 as follows:

m p ϕ(n) , if n|m and is a power of a prime p, ρ( m (x), n (x)) = (77) n 1, otherwise For a new proof, see S. Louboutin [260]. More generally, Apostol [12] showed that for all m, n ≥ 1 and arbitrary nonzero complex numbers a, b n ρ( m (ax), n (bx)) = bϕ(m)ϕ(n) [ m/δ (a d /bd )]µ( d )ϕ(m)/ϕ(m/δ) (78) d|n

where δ = (m, d). When m and n are distinct primes p and q, then (78) simplifies to  pq  a − b pq a − b · , for a = b ρ( q (ax), p (bx)) = (79) a p − b p a q − bq  a ( p−q)(q−1) , for a = b M. Kaminski [218] proved that if P(x) = x is a monic irreducible polynomial with integer coefficients such that ρ(P(x), n (x)) = ±1 for infinitely many n, then P(x) is a cyclotomic polynomial. A connection between cyclotomic polynomials and the Riemann hypothesis has been studied by F. Amoroso [9], [10]. Let FN (z) = n (z) and put n≤N

1 h(FN ) = 2π

π

−π

log+ |FN (eiθ )|dθ

262

(80)


(a function introduced by K. Mahler in 1964 and M. Mignotte in 1979 in the Theory of Diophantine approximations). Amoroso shows that the inequality h(FN ) N λ+ε

(ε > 0)

(81)

is equivalent to the assertion that the Riemann zeta function does not vanish for Re z ≥ λ + ε. (82) 1 (Particularly, the Riemann hypothesis states (82) for λ = ). 2 Another result in the same vein is that if λ < 1 and if log |FN (α)| −N λ for every root of unity α of order ≤ N , then for any ε > 0, the Riemann zeta function does not vanish for Re z ≥ λ + ε. (83) V. N. Sorokin [434] proved the linear independence over Q of the set {log d (a, b) : d|n} ∪ {1}, where n is a positive integer; a, b are two nonzero rational 1/( p−1) n+1 n integers satisfying |b| > cn |a| , where cn = 12(2nεn ) , with εn = p (p p|n

prime). (84) R. Creutzburg and M. Tasche [90] proved that a Gaussian integer e is a primitive nth root of unity modulo a Gaussian integer m iff m is a divisor of n (e)/q, where q is either 1, p or π , where p is the largest prime divisor of n, and π is a Gaussian prime divisor of p. (85) Let α be a unit of degree d in an algebraic number field and assume that α is not a root of unity. Let U (α) be the number of values of n for which n (α) is a unit. Then J. H. Silverman [417] proved that U (α) ≤ cd 1+0.7/ log log d ,

(86)

where c is an effectively computable constant.

3.6 1

Matrices and determinants connected with ϕ Smith’s determinant

In 1876 H. J. S. Smith [432] discovered his famous determinant theorem det[(i, j)]n×n = ϕ(1)ϕ(2) . . . ϕ(n)

(1)

where (i, j) is the greatest common divisor (GCD) of i and j. In fact (see [432] and [103], p. 128) Smith proved the more general result det[ f (i, j)]n×n = g(1)g(2) . . . g(n), where g(d), m = 1, 2, . . . f (m) = d|m

263

(2)

CHAPTER 3

(and where we have denoted by f (i, j) the value taken by f at (i, j), i.e. f ((i, j))). When f (m) = m, by Gauss’ identity (1) follows. It should be noted that relation (2), or particular cases of it, has been rediscovered many times in the literature. Let f (n) = n k (k ∈ R). Then m k = g(d) gives by Möbius inversion g(n) = d|m m k µ(d) 1 k 1 − = Jk (m), i.e. the extension of µ(d) = mk = m d dk pk p|n d|n d|n Jordan’s totient for k ∈ R. One obtains (3) det[(i, j)k ]n×n = Jk (1)Jk (2) . . . Jk (n), rediscovered by another method by B. Gyires in 1957 [172]. In 1965 I. Gy. Maurer and M. Veégh [286] gave two new proofs of (3); one is based on an inductive argument; the other proof is in fact the classical one. For a survey of generalizations of Smith’s determinant up to 1961, see Gy. Oláh [325]. Let f (n) = d(n), the number of divisors of n. Then det[d(i, j)]n×n = 1,

(4)

which is included in Pólya-Szegö (1924 the first edition) Part VIII, Problem 1.31. Problem 1.33 is in fact (2), with a proof different from Smith’s. The proof is based on a remark that [ f (i, j)]n×n can be written in the form [ f (i, j)]n×n = B · C T

(5)

where B and C are lower triangular matrices given by bi j = g( j) if j|i; and 0, otherwise; ci j = 1 if j|i; and 0, otherwise. L. Carlitz [64] observed that [ f (i, j)]n×n = (diag(g(1), g(2), . . . , g(n))C T

(6)

where C is the triangular matrix from (5). Relations (3), (4) appear also in [323], where one can find also some other particular cases. Put e.g. f (n) = σ (n), the sum of divisors of n. Then, since g(d) = d, one has det[σ (i, j)]n×n = n! (7) Let f (n) = µ(n), the Möbius function. Then it is immediate that g( p) = −2, g( p 2 ) = 1 and g( pr ) = 0 for r ≥ 3 ( p prime), and g is multiplicative, so one has det[µ(i, j)]n×n = k(n),

(8)

where k(n) = 1 for n = 1; −2 for n = 2; 4 for n = 3; 4 for n = 4; −8 for n = 5; −32 for n = 6; 64 for n = 7; and 0 for n ≥ 8. (9) 264


Let f (n) = γ (n) =

n, the core of n. Then g( p) = p − 1, g( pr ) = 0 for

p|n

r > 1, so:

det[γ (i, j)]n×n = l(n),

(9)

where l(n) = 1, for n = 1; 1 for n = 2; 3 for n = 3; and 0 for n ≥ 4. [i, j] 1 1 = Let f (n) = . Since , where [i, j] denotes the l.c.m. of i, j; by n (i, j) ij 1 , 1− using properties of determinants, and the fact that g(n) = f (n) f ( p) p|n when f is multiplicative, one can deduce: det [i, j] = ϕ(1)ϕ(2) . . . ϕ(n)γ (1) . . . γ (n)(−1)ω(1)+···+ω(n) (10) n×n

where γ (k) is the core of k, and ω(k) is the number of distinct prime factors of k. We note that (10) is due also to Smith [432], who used the notation γ (k)(−1)ω(k) = π(k) (i.e. it is a multiplicative function satisfying π(1) = 1, π( pr ) = − p for r ≥ 1). Example (1), (4), (7), as well as a proof of (2) can be found also in E. D. Schwab [402]. The determinant of (10) has been presented also in Problem 10232 of American Math. Monthly 96(1992), no. 6, as a subject for evaluation. Problem 6089 by R. M. Redheffer [347] however shows that a small change in the determinant from (4) can lead to a serious difference. Namely, det[d(i, j)]2≤i, j≤n = µ2 (n), (11) i≤n

i.e. if one deletes the first line and first row in (4), then one obtains that the value of the obtained determinant is equal to the number of squarefree integers from 1 to n. In 1972 T. M. Apostol [13] by using the idea that [ f (i, j)]n×n can be written as a product of two triangular matrices, generalized (2) as follows: Let f, g and h satisfy g(d)h( j/d) (12) f (i, j) = d|(i, j)

Then det[ f (i, j)]n×n = g(1)g(2) . . . g(n)(h(1))n

(13)

By taking g(n) = n (n = 1, . . . ) and h = µ, one obtains det[C(i, j)]n×n = n!

(14)

where C(i, j) is Ramanujan’s sum (denoted by C(n, d) in (27) of 3.1). A more general Ramanujan sum is Ck (n, d) = e(nx, d k ), (15) (x,d k )k =1

265

CHAPTER 3

where the sum is over all x in an arbitrary reduced (d, k)-residue system, and (a, b)k is the largest kth power divisor of a and b. Then (see McCarthy [69]) det(Ck (i, j)]n×n = 0

(16)

for all n, k ≥ 2. For more general results, where Apostol’s evaluation is extended to the case of even arithmetical functions, see P. J. McCarthy [71]. G. Daniloff [93] found an analogue of Smith’s determinant as follows: Let Dk (n) = m if n = m k for some positive integer m, and =0 otherwise. Let f (i, j) = Dk (i/d)Dk ( j/d)g(d) (17) d|(i, j)

Then det[ f (i, j)]n×n = g(1)g(2) . . . g(n)

(18)

The unitary analogue of Smith’s determinant was introduced by H. Jager [211]. Let (i, j)∗ denote the greatest common unitary m divisor of i and j. Let d m denote = 1; see Chapter 2). If that d is a unitary divisor of m (i.e. d|m, d, d f (i, j) = g(d), (19) d (i, j)∗

then (20) det[ f (i, j)]n×n = g(1)g(2) . . . g(n) Let ϕ ∗ be the unitary totient function. Since ϕ ∗ (d) = m, Jager deduced from d m

(20) the analogue of (1): det[(i, j)∗ ] = ϕ ∗ (1)ϕ ∗ (2) . . . ϕ ∗ (n)

(21)

K. Nageswara Rao [308] gave an A-analogue of Smith’s determinant, where A denotes Narkiewicz’s regular convolution. See also C. R. Wall [471]. The classical and the unitary cases are particular cases of this A-analogue determinant. Multidimensional Smith’s determinants have been considered by L. Gegenbauer [148], D. H. Lehmer [248], N. P. Sokolov [433], P. Haukkanen [181], R. Vaidyanthaswamy [462].

2

Poset-theoretic generalizations

Smith deduced his result (2) in a slightly more general setting, namely if x1 , x2 , . . . , xn are distinct positive integers with the property that d|xi ⇒ d = x j for some j = 1, 2, . . . , n, 266

(22)


then det[ f (xi , x j )]n×n = g(x1 )g(x2 ) . . . g(xn )

(23)

Such a set S = {x1 , x2 , . . . , xn } (i.e. satisfying (22)) is called factor-closed set. For example, (24) det[(xi , x j )]n×n = ϕ(x1 )ϕ(x2 ) . . . ϕ(xn ) for a factor closed set S. The idea has been extended to the lattice-theoretical context by H. S. Wilf [482], B. Lindström [259], P. Haukkanen [182], B. V. Rajarama Bhat [342], P. Haukkanen [183], P. Haukkanen, J. Wang and J. Sillanpäa¨ [192]. For example, a common generalization of (13), (20) and (23) is obtained in the context of meet semilattices. Let (P, ≤) be a poset (see Chapter 2). Then P is called a meet semilattice if for any x, y ∈ P there exists a unique z ∈ P such that: 1) z ≤ x and z ≤ y; 2) if w ≤ x and w ≤ y, for some w ∈ P, then w ≤ z. In such a case z is called the meet of x and y, and denoted by x ∧ y. Let S ⊂ P. The set S is called lower-closed if for every x, y ∈ P with x ∈ S, y ≤ x, we have y ∈ S. We note that in the case of (N, |), the lower closed sets coincide with the factorclosed sets of (22). The following result is true: Let P be a finite meet semilattice, and let {x1 , x2 , . . . , xn } be a lower-closed subset of P. Let F, G : P × P → C be incidence functions of P, and let A be the n × n matrix defined by ai j = F(x, xi )G(x, x j ). (25) x≤xi ∧x j

Then det A =

n

F(xk , xk )G(xk , xk )

(26)

k=1

Let e D (d, m) = 1 is d|m; =0 otherwise in the poset (N , |). Letting F(d, m) = e D (d, m), G(d, m) = e D (d, m)g(d). Then f (xi , x j ) = n F(d, xi )G(d, x j ) = F(xk , xi )G(xk , x j ), and the above theorem yields d|(xi ,x j )

k=1

(23). Let eu (d, i) = 1 if d i; =0 otherwise in the poset (N , ). Then as above, we reobtain from (26) relation Jager’s theorem (20). If F and G are incidence functions of (N , |), let F(d, i) = e D (d, i)g(d); G(d, j) = e D (d, j)h( j/d). Then we reobtain Apostol’s theorem (13). Let C ∗ (i, j) = dµ∗ ( j/d) be the unitary analogue of Ramanujan’s d|i,d j

sum, where µ∗ is the unitary Möbius function (see Chapter 2). Denoting F(d, i) = e D (d, i)d and G(d, j) = eu (d, j)µ∗ ( j/d). By writing C ∗ (i, j) = 267

CHAPTER 3 n

F(k, i)G(k, j), it follows that

k=1

det[C ∗ (i, j)]n×n = n!

(27)

For a last application, let e N (k, i) = 1 if k ≤ i; =0 otherwise on the poset (N, ≤). Then n min{i, j} = eN (k, i)eN (k, j) = eN (k, i)eN (k, j), k≤min{i, j}

k=1

so: det[min{i, j}]n×n = 1

(28)

The subset S ⊂ P of a finite meet semillatice will be called meet-closed (see [192]) if for every x, y ∈ S we have x ∧ y ∈ S. Let f : P → C. Then the matrix, defined by (S) f = (si j ) with si j = f (xi ∧ x j ) (1 ≤ i, j ≤ n) is called the meet-matrix of S with respect to f . The following theorem is due to Rajarama Bhat [342]: Let S = {x1 , . . . , xn } ⊂ P be a meet-closed subset, and let g(xi ) be defined by g(x j ), (29) g(xi ) = f (xi ) − x j ∈S,x j <xi

(x j < xi means x j ≤ xi and x j = xi ), where f is given above. Then det(S) f = g(x1 ) . . . g(xn )

(30)

The following corollary of (30) contains earlier results by Wilf [482] and Lindström [259]: Let S be lower-closed subset of P. Then det(S) f = g(x1 ) . . . g(xn ), where g(xi ) =

(31)

f (x j )µ(x j , xi ),

x j ≤xi

µ being the Möbius function of P. This is a poset-theoretic generalization of Smith’s theorem. The incidence matrix of two subsets S = {x1 , . . . , xn } and T = {y1 , . . . , ym } is defined by E(S, T ) as an n × m matrix whose i, j entry is 1 if y j ≤ xi ; and 0, otherwise. Let S = {x1 , . . . , xn , xn+1 , . . . , xn+r } be the unique (up to isomorphism) minimal meet semilattice containing S. If g : S → C is defined as in (29), then (S) f = E diag(g(x1 ), g(x2 ), . . . , g(xn+r ))E T 268

(32)


where E = E(S, S) and E T is the transpose of E. This result is from [342], and is a generalization of Carlitz’s theorem (6). Theorems (30) and (32) extend results of S. Beslin and S. Ligh [41], [42], where the classical (N, |) poset is considered. In [192] the determinant of (32) is calculated: ∗ det(E (k1 ,...,kn ) )2 g(xk1 ) . . . g(xkn ) (33) det(S) f = ∗ where in one has 1 ≤ k1 < k2 < · · · < kn ≤ n + r , and E (k1 ,...,kn ) is the submatrix of E = E(S, S) consisting of the k1 th, . . . ,kn th columns of E. If f and g are real valued functions and g(x) ≥ 0, then det(S) f ≥ g(x1 ) . . . g(xn )

(34)

with equality iff S is a meet-closed subset. Let P be a finite meet semillatice, S = {x1 , . . . , xn } ⊂ S, and f : P → C. The following generalized totient function has been introduced in [342]. Let ϕ S, f be defined inductively by ϕ S, f (xi ) (35) ϕ S, f (x j ) = f (x j ) − xi <x j

(or f (x j ) =

ϕ S, f (xi )).

xi ≤x j

Remark that when S is a factor-closed set of positive integers ordered by | in N, and f (x) = x for all x, then ϕ f,S = ϕ, Euler’s totient function. When S is meet-closed and i < j whenever xi < x j , then f (w)µ(w, z), (35) ϕ S, f (x j ) = z≤x j ,xxt t< j

w≤z

while when S is lower-closed, then ϕ S, f (x j ) =

f (xi )µ(xi , x j ),

(36)

xi ≤x j

which is a consequence of (35). For a proof of (35), see [183]. By using the evaluation (32), P. Haukkanen [183] proved that if S is meet-closed, then n ϕ S, f (xk ) (37) det(S) f = k=1

269

CHAPTER 3

3

Factor-closed, gcd-closed, lcm-closed sets, and related determinants

We now return to the classical poset (N, |), where further analogous notions and results are obtainable. Let S{x1 , . . . , xn } be a set of distinct positive integers. Let the G ⊂ D matrix whose i, j-entry is (xi , x j ) be denoted simply by (S), and in the general case of f (xi , x j ), by (S) f ( f being an arithmetic function). Similarly, let the LCM matrix whose i, j-entry is [xi , x j ] be denoted by [S], and in the case of f [xi , x j ], by [S] f . As we have seen in section 2, S is said to be factor-closed if d ∈ S whenever xi ∈ S and d|xi . H. J. S. Smith showed that if S is factor-closed, then (2) holds. S. Beslin and S. Ligh [41] have called S gcd-closed if (xi , x j ) ∈ S, whenever xi , x j ∈ S. Note that if S is factor-closed, then it is gcd-closed. too. They extended (2) to the case of gcd-closed sets (in fact, (30) of section 2 for meet-matrices, generalizes this result): If S is gcd-closed set, then det(S) f =

n ( f ∗ µ)(d) i=1

(38)

d

where d runs through the divisors of xi such that d xt for xt < xi . We note that Beslin and Ligh obtained (38) for the case f (n) = n, this general form is due to Bourque and Ligh [48]. By extending (10) of Smith to gcd-closed matrices, they proved also that (see [49]) det[S] =

n i=1

xi2

ϕ(d)γ (d)(−1)ω(d) /d 2

(39)

d

where the sum over d is as in (38). For determinants of matrices on gcd-closed sets, and associated to other arithmetic functions, see S. Hong [202]. See also [203] by Hong on LCM matrices. When S is factor-closed, and f is a multiplicative function, in another paper [50] they showed that det[S] f =

n

f (xi )2 g(xi ),

(40)

i=1

1 ∗ µ, and f (n) = 0 for all n. f For f (n) = n k this gives a result (similar to (10)) due also to H. J. S. Smith. In 1996 P. Haukkanen and J. Sillanpäa¨ [187] extended (40) to gcd-closed sets S, but for quasi-multiplicative functions, defined as follows: f is said to be quasimultiplicative, if f is not identically zero, and if there exists a non-zero constant q such that f (a) f (b) = q f (ab) (41) where g =

270


whenever (a, b) = 1. When q = 1 this gives the usual notion of multiplicative functions. Now let S be a gcd-closed set, and suppose that f is quasi-multiplicative, and f (n) = 0 for all n. Then det[S] f =

n

f (xi )2

g(d),

(42)

d

i=1

where g is given as in (40), and the sum over d is as in (38). Haukkanen and Sillanpäa¨ introduced also the concept of lcm-closed sets S, and obtained results for det(S) f and det[S] f when f is completely multiplicative. S is said to be lcm-closed if [xi , x j ] ∈ S for every xi , x j ∈ S. If S is lcm-closed, then xi | max S for all xi ∈ S. Let us denote max S = xn = m. Now the following theorems are valid: Let S = {x1 , . . . , xn } be an lcm-closed set of distinct positive integers, and let f be completely multiplicative with f (n) = 0 for all n. Then det(S) f = f (m)

−n

n

f (xi )2

( f ∗ µ)(d)

(43)

d

i=1

m m such that d for xi < xt . xi xt 1 Let S and f be as above, and let g = ∗ µ. Then f

where d runs through the divisors of

det[S] f = f (m)n

n i=1

g(d)

(44)

d

where in the sum d is as in (43). Regarding unitary Smith determinants, we have stated results like (19) and (27). In what follows, (a, b)∗ will denote the greatest common unitary divisor (gcud) of a and b, while (a, b)∗ will denote the semi-unitary greatest common divisor (sugcd), which is the greatest unitary divisor of b which is a divisor of a. The least common unitary multiple (lcum) of a and b will be defined by [a, b]∗ = ab/(a, b)∗ . The set S = {x1 , . . . , xn } of distinct positive integers will be called ud-closed if d ∈ S whenever d xi for xi ∈ S. The set S is said to be gcud-closed if (xi , x j )∗ ∈ S for every xi , x j ∈ S; and sugcd-closed if (xi , x j )∗ ∈ S for every xi , x j ∈ S. Haukkanen and Sillanpäa¨ [187] prove the following theorems: If S is gcud-closed, and f is an arbitrary arithmetic function, then det(S) f [ f ((xi , x j )∗ )]n×n =

n ( f ⊕ µ∗ )(d) i=1

271

(45)

CHAPTER 3

where ⊕ is the unitary convolution, µ∗ the unitary Möbius function, and the sum is over all d xi , d ∦ xt for xt < xi . As a corollary, (45) implies that if S is ud-closed, then det[ f ((xi , x j )∗ )]n×n =

n

( f ⊕ µ∗ )(xi )

(46)

i=1

containing the particular case ∗

det[(xi , x j ) ]n×n =

n

ϕ ∗ (xi )

(47)

i=1

For the next theorem we must assume that f is completely multiplicative. Let S be gcud-closed, and let f be completely multiplicative with f (n) = n for all n. Then n 1 (48) f (xi )2 det[ f ([xi , x j ]∗ )]n×n = ⊕ µ∗ (d), f i=1 where the sum is over d as in (45). Result (45) holds true also if S is sugcd-closed set. The corresponding result to (48) for sugcd-closed sets, however, is an open problem. For the singularity or nonsingularity of matrices related to (S) and [S], see [49], [188], [201], [192]. The reciprocal GCD and LCM matrices have been introduced by S. Beslin [40]. These are the matrices 1 1 , resp. (49) (xi , x j ) n×n [xi , x j ] n×n For example, when S is factor closed, then n 1 = x −2 ϕ(xi ) det [xi , x j ] n×n i=1 i

(50)

For more general results, with [xi , x j ]r in (50), see E. Altinis¸ik and D. Tas¸ci [6]. For determinants of type f (i, j) (51) det ij i|n, j|n see P. Codecá and M. Nair [75]. In [231] A. Krieg studies the number N (x) of matrices M in the modular group S L 2 (Z) whose maximum norm ≤ x. It is shown that N (x) is basically the partial sum of Euler’s totient function, therefore N (x) ∼

96 2 x π2 272

(x → ∞)

(52)


4

Inequalities

Relation (34) gives an inequality for det(S) f , when S is a subset of a meet semilattice. In [48] Bourque and Ligh proved that if S = {x1 , . . . , xn } is a set of distinct positive integers, and if ( f ∗ µ)(d) > 0 for all d ∈ {d : d|x, x ∈ S}, ( f : N → R), then n det[ f (xi , x j )] ≥ ( f ∗ µ)(xk ) (53) k=1

with equality only if S is factor-closed. This result was first proved by Z. Li [255] in the case f (x) = x for all x. P. Haukkanen [183] obtained an extension to the case of meet-closed sets (see section 2): Let T = {y1 , . . . , ym } be a meet-closed set containing S = {x1 , . . . , xn } and let f (w)µ(w, z) > 0 for all z ∈ {z : z ≤ y, y ∈ T }. Then w≤z

det(S) f ≥

n

ϕT, f (xk ),

(54)

k=1

with equality iff S is meet-closed, and ∀ x ∈ S: ∀ z ≤ x : z ∈ T \ S (see (35) for the definition of ϕT, f ). Letting T = S in (54) one obtains: If S = {x1 , . . . , xn } and f (w)µ(w, z) > 0 for all z ∈ {z : z ≤ y, y ∈ S}, then w≤z

det(S) f ≥

n

ϕ S, f (xk )

(55)

k=1

This gives in the case of the poset (N, |) an improvement of (53): det[ f (xi , x j )] ≥

n ( f ∗ µ)(d)

(56)

k=1

where the sum is taken over all d|xk , d yt for yt < xk ; and all conditions are as in theorem (53). Z. Li [255] proved also the upper bound n! (57) 2 In [48] it is proved that for GCD matrices associated with arithmetical functions satisfying the condition ( f ∗ µ)(d) > 0 for all d ∈ {d : d|x, x ∈ S}, we have that (S) f is positive definite, and thus det[(xi , x j )] ≤ x1 x2 . . . xn −

det[ f (xi , x j )] ≤ f (x1 ) . . . f (xn ) 273

(58)

CHAPTER 3

In [183] it is shown that this holds also for the more general case of meet matrices of poset-theoretic setting: If S ⊂ P and f (w)µ(w, z) > 0 for all z ∈ {z : z ≤ w≤z

x, x ∈ S}, then (S) f is positive definite, so

det(S) f ≤ f (x1 ) . . . f (xn )

(59)

By [50] similar bounds are also true for det[ f [xi , x j ]]: Let f : N → R be multiplicative and assume that (g ∗ µ)(d) > 0 for all d ∈ {d : d|x, x ∈ S}, with 1 g = . Then [ f [xi , x j ]] is positive definite, and f n n 1 2 f (xk ) f (xk ), (60) ∗ µ (xk ) ≤ det[ f [xi , x j ]] ≤ f k=1 k=1 with equality on the left side iff S is factor closed. In [6] it is proved that n n Jr (xk ) 1 1 ≤ ≤ det 2r [xi , x j ]r xr xk k=1 k=1 k

(61)

where r > 0, and Jr is Jordan’s totient function. The reciprocal GCD and LCM matrices were in [40]. These are de introduced 1 1 , resp. [S −1 ] = . See also [49] and [230]. noted by (S −1 ) = (xi , x j ) [xi , x j ] Let · 2 denote the Euclidean norm of a matrix. D. Bozkurt and S. Solak [51] have shown that ! 5π 2

[S −1 ] 2 ≤ −4 (62) 6 Recently, E. Altinisik, N. Tuglu and P. Haukkanen [7] have generalized and improved (62) to ζ (r p)3/ p

[S −r ] p ≤ , (r p > 1), (63) ζ (2r p)1/ p where ζ is the Riemann zeta function, and · p is the l p norm ( p ≥ 1) of matrices

1/ p n 1 p −r . For r = 1, |ai j | ). Here [S ] = (if A = [ai j ], then A p = [xi , x j ]r i, j=1 √ 15 p = 2, the right side of (63) gives π , improving (62). 6 The spectral norm of a matrix A = [ai j ] is defined by √

A ∗ = max{ λ : λ is an eigenvalue of A∗ A}. 274


Let 2r > 1. Then (see [7])

[S −r ] ∗ ≤

ζ (2r )3/2 ζ (4r )1/2

(64)

For inequalities on GCUD-reciprocal LCUM determinants, see the recent paper by A. Nalli [311].

3.7 1

Generalizations and extensions of Euler’s totient Jordan, Jordan-Nagell, von Sterneck, Cohen-totients

There exist many generalizations, extensions, or analogues functions to Euler’s totient. In Chapters 1 and 2, as well as in the former paragraphs of this Chapter 3, there have been included many notions or results related to totients. Perhaps the most important generalization of Euler’s totient is the Jordan totient function Jk with Jk (n) defined as the number of ordered sets of k elements from a complete residue system (mod n) such that the g.c.d. of each set is prime to n. In fact Jk = µ ∗ E k

(see 2.2.1), so 1 1− k Jk (n) = n k p p|n

(1)

For Jordan’s totient, see 2.2.1, 2.2.7 of Chapter 2, and 3.1.1, 3.1.7, 3.2.11, 3.3.5, 3.5.3, 3.6.1 of Chapter 3. An extension of Jordan’s totient, namely the Jordan-Nagell totient occurred at 2.3.3 of Chapter 2. Two generalized totients strongly related to Jordan’s are the von Sterneck and the Cohen totients. In 1894 R. D. von Sterneck (see [103], p. 151) defined Hk (n) = ϕ(d1 )ϕ(d2 ) . . . ϕ(dk ) (2) n=[d1 ,d2 ,...,dk ]

where the summation is over all sets of k positive integers d1 , . . . , dk with their lcm equal to n. He proved that (3) Hk (n) = Jk (n) In 1952 E. Cohen [78] introduced the notion of a k-reduced residue system (mod n). Let a, b be integers, not both zero. (a, b)k denotes the g.c.d. of a and b which is also a kth power. If (a, b)k = 1, a is said to be relatively k-prime to b 275

CHAPTER 3

and vice-versa. The set of all integers x from a complete residue system (mod n) such that (x, n k )k = 1 is called a k-reduced residue system (mod n). The number of elements of a k-reduced residue system (mod n) is denoted by ϕk (n). Clearly, ϕ1 ≡ ϕ. More generally, Cohen proves: ϕk (n) = Jk (n)

(4)

For many other identities involving Jk , see [103], Chapter 4; and R. Sivaramakrishnan [421]. For new proofs of (3) and (4), see [79], [80]. P. Haukkanen [184] further generalized ϕk (n) and Jk (n) by introducing the function ϕk,u (n) = number of u-tuples x1 , x2 , . . . , xu (mod n k ) such that (gcd(x1 , . . . , xu ), n k )k = 1. One has ϕ1,u (n) = Ju (n); ϕk,1 (n) = ϕk (n). In fact (see [184]) ϕk,u (n) = d ku µ(n/d), (5) d|n

where µ is the classical Möbius function. For a generalization of ϕk,u to the setting of Narkiewicz’s regular convolution, see [185]. Another generalization is the JordanNagell totient of 2.3.3. As we have mentioned in section 3.1 (see relation (42’)), in 1999 T. Shonhiwa has considered the generalized totient Jkm (n) = car d{1 ≤ a1 , . . . , an ≤ n, (a1 , . . . , ak , m) = 1}, which for m = n gives Jk (n). Then Jkm (n) =

µ(d)

d|m

n k d

(1 )

which for m = n yields relation (1).

2

Schemmel, Schemmel-Nagell, Lucas-totients

In 1869 V. Schemmel (see [103], p. 147) introduced the function Sk (n), as the number of sets of k consecutive numbers each less than n, and relatively prime to n. It is known that k (6) Sk (n) = n 1− p p|n A generalization of Schemmel’s totient is the Schemmel-Nagell totient θs (M, N ) of 2.3.3 from Chapter 2. For Schemmel’s totient, see also 3.1.4, 3.2.8, 3.3.3 of Chapter 3. 276


In 1891 E. Lucas (see [103], p. 147) obtained a generalization of Schemmel’s totient. Let e1 , e2 , . . . , ek be any integers, and denote by ψk (n) the number of integers h, chosen from 0, 1, 2, . . . , n − 1 such that h − e1 , h − e2 , . . . , h − ek are relatively prime to n. Then ψk is multiplicative, and λ (7) 1− ψk (n) = n p p|n where λ is the number of distinct residues of e1 , . . . , ek (mod p). For k < n, e1 = 0, e2 = −1, . . . , ek = −(k − 1) we reobtain Schemmel’s totient. Schemmel’s and Lucas’ totient functions have been further generalized by K. Nageswara Rao [309], in the setting of Cohen’s relatively k-primality (see (4)). Let Sk(s) (n) be the number of sets of k consecutive integers each less than n s and which are s-prime to n s . Then k (s) s 1− s (8) Sk (n) = n p p|n Remark that Sk(1) ≡ Sk . A similar generalization to (7) holds true.

3

Ramanujan’s sum

An important generalization of Euler’s totient is the Ramanujan sum C(n, r ) defined by C(n, r ) = e(nx, r ) (9) (x,r )=1,1≤x≤r

where n ∈ Z, r ∈ N and e(a, b) = e2πia/b . In fact, Ramanujan’s sum is a common generalization of Euler’s totient ϕ and Möbius’ function µ, since C(0, r ) = ϕ(r ),

C(1, r ) = µ(r )

(10)

Ramanujan’s sum, with certain generalizations or analogues sums occured in 2.3.6 of Chapter 2, as well as in 3.1.5, 3.5.3, 3.6.1, 3.6.2 of Chapter 3. Many other generalizations of Ramanujan’s sum, due to E. Cohen, K. Nageswara Rao, M. Sugunamma, M. V. Subbarao - V. C. Harris, A. C. Vasu, L. Berardi - M. Cerasoli - F. Eugeni, etc. are included (with References) in [184]. R. Sivaramakrishnan, J. Hanumanthachari, or J. Hanumanthachari - V. V. Subrahmanya Sastri obtained Ramanujan sums for square reduced or k-free integers. V. Sita Ramaiah, P. J. McCarthy, P. Haukkanen have generalized Ramanujan’s sum in the setting of regular A-convolutions. We note that the unitary analogue of C(n, r ) originates to E. Cohen. See also [69]. For unitary analogues of generalized Ramanujan sums, see also K. R. Johnson [213]. For Ramanujan sums on semigroups, see A. Grytczuk [159]. 277

CHAPTER 3

For generalizations of Ramanujan’s sum to matrices, see V. C. Nanda [312]. He studied also general arithmetic functions of integer matrices [313]. See also G. Bhowmik [43] and G. Bhowmik and O. Ramaré [44] on average orders of certain arithmetic functions of integer matrices (among others, the Euler totient of matrices). There is a vast literature on the Ramanujan expansions of arithmetic functions, i.e. representations in the form ar C(n, r ). For a survey of results, see e.g. W. r

Schwarz [405]. See also [159].

4

Klee’s totient

In 1948 V. L. Klee defined the function Tk (n) as the number of integers 1 ≤ h ≤ n such that (h, n) is kth powerfree. Then n Tk (n) = µk (d) (11) d d|n where µk is Klee’s Möbius function, given by µk (n) = µ(n 1/k ) if n is a kth power; 0, otherwise. See 2.3.5 of Chapter 2, where Suryanarayana’s generalization is included, too. It can be proved that (see e.g. [310], along with other identities) 1 Tk (n) = n 1− k (12) p k p |n U. V. Satyanarayana and K. Pattabhiramasastry [390] proved that the average order of Tk (n) is n2 + O(n log n) (13) Tk (m) = 2ζ (2k) m≤n A. C. Vasu [467] defined an extension Tk,l of Klee’s totient as the number of ordered sets of l integers less than n which have with n the greatest common divisor kth power free. See also Subbarao-Harris’ ϕk,q of 2.3.6 of Chapter 2. n t A generalization Tk,s,t given by Tk,s,t = (µk (d))s , with application in d d|n the evaluation of certain infinite sums, can be found in B. C. Berndt [39]. For generalizations of Klee’s totient in the setting of A-convolutions, with many particular cases, see [184].

5

Nagell’s, Adler’s, Stevens’, Kesava Menon’s totients

Nagell’s totient function θ (n, r ) was introduced in 1923 by T. Nagell [307] (see also [81]) as the number of integers x (mod r ) such that (x, r ) = (n − x, r ) = 1. In 278


fact, θ (n, r ) can be considered as the number of solutions of the congruence x+y≡n

(mod r )

(14)

under the restrictions (x, r ) = (y, r ) = 1. E. Cohen [81] proved that θ (n, r ) = ϕ(r )

µ(d) ϕ(d) d|r,(d,n)=1

θ (n, r ) is multiplicative in both n and r , and another identity is: (−1)ω(d) ϕ(r/d); θ (n, r ) =

(15)

(16)

d|r,(d,n)=1

see [421]. As a generalization of (14), let Ns (n, r ) be the number of solutions of the congruence x1 + x2 + · · · + xs ≡ n (mod r ) (17) under the restriction (x, r ) = 1, where x = (x1 , . . . , xs ). Then (see E. Cohen [82]), s r Js (g), with g = (n, r ) (18) Ns (n, r ) = g In 1948 H. L. Alder [4] defined a totient ϕ(n, r ) as the number of ordered pairs x, y such that x + y = n + r,

(x, r ) = (y, r ) = 1

Clearly ϕ(0, r ) = ϕ(r ). Now, ϕ(n, r ) = r

εn ( p) =

1 ≤ x ≤ r (n ≥ 0)

εn ( p) , 1− p

p|n

where

and

(19)

1, if p|n 2, otherwise

Remark that ϕ(1, r ) = S2 (r ), the Schemmel totient of order 2. Also, by (14), ϕ(n, r ) = θ (n, r ) for all n, r

(20)

For a generalization of Nagell’s totient function and Ramanujan’s sum, see [177]. For a recent generalization, with combinatorial applications, see [446]. An extension of Nagell’s (and Alder’s) totient has been introduced by H. Stevens [440]. Let F = { f 1 (x), . . . , f k (x)} (k ≥ 1) be a set of polynomials with integral 279

CHAPTER 3

coefficients, and let A be the set of all ordered k-tuples of integers a1 , . . . , ak such that 0 ≤ a1 , . . . , ak ≤ n. Let ϕ F,k (n) be the number of elements in A such that r a gcd( f 1 (a1 ), . . . , f k (ak ), n) = 1. If n = p j j is the prime factorization of n, then j=1

ϕ F,k (n) = n

k

r j=1

N1 j . . . Nk j 1− p kj

(21)

where Ni j is the number of incongruent solutions of f i (x) ≡ 0 (mod p j ). The Stevens totient is multiplicative, and contains, as special cases the Jordan totient Jk (n) ( f 1 (x) = · · · = f k (x) = x); the Schemmel totient St (n) (k = 1, f 1 (x) = x(x + 1) . . . (x + t − 1)); the Nagell totient θ (n, r ) = ϕ F,1 (r ) (k = 1, f 1 (x) = x(n − x)). Let now ϕl,k (n) with 0 ≤ l < k be the numbers of k-tuples a1 , . . . , ak with l ≤ ak ≤ n such that (al+1 , . . . , ak , n) = 1. This is the Cashwell-Everett totient (see B. Rizzi [353]. By letting f 1 (x) = · · · = fl (x) = nx, fl+1 (x) = · · · = f k (x) = x, in (21), one gets ϕl,k (n) = n

k

p|n

pl 1− k p

(22)

Clearly, ϕ0,k (n) = Jk (n), Jordan’s totient. For generalized Ramanujan sums connected with Stevens’ totient, see also L. Berardi and B. Rizzi [37]. For an asymptotic formula for ϕ F,k , see L. Tóth and J. Sándor [460]. In the case of a single polynomial f , with integral coefficients, in 1967 P. Kesava Menon [222] considered the number of integers ϕ f (n) of x (mod n), such that ( f (x), n) = 1. Let D(s, d, n) = {s, s + d, . . . , s + (n − 1)d} be an arithmetic progression with (s, d) = 1, and let ϕ(s, d, n) denote the number of elements x ∈ D(s, d, n) such that (x, n) = 1. This function has been introduced by P. G. Garcia and S. Ligh [145]. This is a special case of ϕ f (n) for f (x) = s + (x − 1)d. L. Tóth [457] obtained the asymptotic formula

ϕ(s, d, n) =

n≤x

An asymptotic formula for

3d 2 x 2 + O(x log x) π 2 J (d)

ϕ(s, d, n) was given by T. Maxsein [287].

d≤x

280

(23)


A combination of generalizations from [184] and Kesava Menon’s totient ϕ f is given in [458], where asymptotic results more general than (23) are also deduced. D. Goldsmith [149] considered a generalization of ϕ f (n) as follows. For each divisor d of n, let ϕ f,d (n) be the number of 0 ≤ x < n such that ( f (x), n) = d. Clearly, ϕ f,1 (n) = ϕ f (n). Let (n, r ) = 1 and d|n, e|r . Then ϕ f,ed (nr ) = ϕ f,d (n)ϕ f,e (r ) For d = e = 1, this contains the multiplicative property of ϕ f .

6

Unitary, semi-unitary, bi-unitary totients

The unitary analogue of ϕ(n) was introduced by E. Cohen [83] as follows. Let (a, b)∗ denote the greatest divisor of a which is a unitary divisor of b (a divisor r of b = 1). If (a, b)∗ = 1, then a is said to be semi-prime to b is called unitary, if r, r b. Let ϕ ∗ (n) be the number of positive integers r ≤ n, semi-prime to n. In fact, dµ∗ (n/d) = ( p α − 1), (24) ϕ ∗ (n) = p α n

d|n

where µ∗ (m) = (−1)ω(n) is the unitary Möbius function. For unitary divisors see also 1.9 of Chapter 1, 2.2.2 of Chapter 2, and 3.6.1 of Chapter 3. For the corresponding notions of bi-unitary divisors and convolution, see 1.9 of Chapter 1, and 2.2.3 of Chapter 2. A divisor d of n is called semi-unitary divisor (see J. Chidambaraswamy [73]) if d is semi-prime to n/d. For various sum evaluations on semi-unitary divisors, see [73]. The unitary analogue of Nagell’s totient has been introduced by J. Morgado [299]: θ ∗ (n, r ) is the number of integers x such that (x, r )∗ = (n − x, r )∗ = 1, 1 ≤ x ≤ r . θ ∗ is multiplicative in r , and is given by α αj ( pi i − 1) ( p j − 2) (25) θ ∗ (n, r ) = α

αj

pi i |n

p j n

where r = p1α1 . . . pmαm is the prime factorization of r . m 1 ∗ ∗ 1 − αi . If r |n, then θ (n, r ) = ϕ (r ) = r pi i=1 For identities involving θ ∗ , see [300]. The unitary analogue of Schemmel’s totient is the number Sk∗ (n) of k consecutive numbers x, x + 1, . . . , x + k − 1 with 1 ≤ x ≤ n and all semi-prime to n. This has been introduced by J. Morgado in [301]. 281

CHAPTER 3

Let n = p1α1 . . . pmαm , and p α = min{ p1α1 , . . . , pmαm }. If k ≥ p α , then Sk∗ (n) = 0. The function Sk∗ is multiplicative, and Sk∗ ( piαi ) = piαi − k, so  if n = 1  1, ∗ 0, if n > 1 and k ≥ p α Sk (n) =  α1 αm ( p1 − k) . . . ( pm − k), if n > 1 and 1 ≤ k < p α

(26)

For the unitary analogues of certain remarkable identities (e.g. of BrauerRademacher’s, Landau’s, or Anderson-Apostol’s), see P. J. McCarthy [72].

7

Alladi’s totient

The k-ary divisors have been considered e.g. in 2.3.5 of Chapter 2 and in relation with (11). Another notion of higher order divisors is due to K. Alladi [5]. A divisor d of n is called of first order, in notation d|1 n. Let (a, b)1 denote the largest divisor of a dividing b. When (a, b)1 = 1, we say that a is prime to b order 1. A divisor d of n n is said to be of second order, denote d|2 n, if , d = 1. Let (a, b)2 denote the d 1 prime to b order 2. A largest divisor c of a satisfying c|2 b. If (a, b)2 = 1 we say na is divisor d of n is a divisor of third order, denoted d|3 n, if , d = 1. Let (a, b)3 be d 2 b)3 = 1, we say a is prime to b order the largest divisor c of a that satisfies c|3 b. If (a, n 3. By generalizing, we say that d|r n if = 1 and (a, b)r = max{c|1 a, c|r b}. ,d d r −1 If (a, b)r = 1, then a is prime to b order r . Let ϕr (n, x) = number of 1 ≤ a ≤ x such that (a, n)r = 1 be Alladi’s totient, and put ϕr (n) = ϕr (n, n). Similarly, let ϕr (n, x) = number of 1 ≤ a ≤ x with Fr −1 x, when r (n, a)r = 1. Let ϕr (n) = ϕr (n, n). Let fr (x) be the least integer > Fr Fr −1 is odd, and ≥ x, when r is even, where (Fr ) is the Fibonacci sequence given Fr by F0 = 0, F1 = 1, Fn = Fn−1 + Fn−2 (n ≥ 2). Let n = p1α1 . . . pmαm be the prime factorization of n. Then ϕr (n) = n

m

1−

i=1

1

f (αi )

pi r

(27)

An interesting consequence is that ϕ1 (n) ≤ ϕ3 (n) ≤ ϕ5 (n) ≤ · · · ≤ ϕ6 (n) ≤ ϕ4 (n) ≤ ϕ2 (n) 282

(28)


Let σr,k (n) =

d k , σr,k (n) =

d|r n

n k d|r n

n

d

. Then

σr,k (m) = cr,k n k+1 + O(n k+1/2 )

m=1 n

(29) σr,k (n) = cr,k n k+1 + O(n k+1/2 )

m=1

where cr,k and

8

cr,k

are certain constants depending only on r and k.

Legendre’s totient

A famous generalization of Euler’s totient is the Legendre totient function ϕ(x, n) = number of positive integers ≤ x, which are relatively prime to n, introduced by Legendre in 1794 (see [103], p. 115). Clearly, ϕ(n, n) = n. Legendre proved essentially that x (30) ϕ(x, n) = µ(d) d d|n Relation (30) immediately implies ϕ(x, n) = x

ϕ(n) + O(d(n)), n

(31)

where d(n) is the number of divisors of n. This gives rise to the function (x, n) = ϕ(x, n) −

xϕ(n) . n

In 1946 P. Erdös [120] proved that |(x, n)| > c · 2ω(n)/2 /(log ω(n))1/2 ,

(32)

while D. H. Lehmer [249] showed that |(x, n)| < 2ω(n)−1 ,

(33)

where ω(n) denotes the number of distinct prime factors of n. It can be conjectured that (see [120]) (34) |(x, n)| = O(2ω(n) ), if ω(n) → ∞ A related result is the following (see [251]): ω(n) µ(d) ≤ d|n,a≤d≤b [ω(n)/2] 283

(35)

CHAPTER 3

In 1974 D. Suryanarayana [246] obtained the following two inequalities: (x, n) + {x} − 1 ϕ(n) ≤ 1 (d(n) − ψ(n)/n); x ≥ 1, n ≥ 2, 2 n 2

(36)

ϕ(n) d(n) ψ(n) ψ(n) d(n) − ≤ (x, n) + {x} ≤ − + 1, for x ≥ 1, n ≥ 2, (37) n 2 n 2 n such that ([x], n) = 1. Here ψ(n) is the Dedekind arithmetical function (see [103], p. 123) given by 1 ( p prime). ψ(n) = n 1+ p p|n For Dedekind’s function, see e.g. E. Cohen [84], D. Suryanarayana [449], J. Sándor [369] and J. Sándor and R. Sivaramakrishnan [383]. A. Sivaramasarma [425] stated that if x ≥ 1, n ≥ 2, and m = (n, [x]), then (x, n) + {x} ϕ(n) − 1 1 ≤ d(n) + d(m) − md(m)ψ(n) , (38) n 2 m 2 2 nψ(m) where {x} = x − [x] is the fractional part of x. The unitary analogue of Legendre’s totient has been introduced by Cohen in [83] as the number ϕ ∗ (x, n) of positive integers a ≤ x such that (a, n)∗ = 1. In particular, ϕ ∗ (n, n) = ϕ ∗ (n). A more general function, considered by J. Chidambaraswamy [73] is ϕr∗ (x, n) = a r (r ≥ 0) a≤x,(a,n)∗ =1

He proved that ϕr∗ (x, n) =

x r +1 ϕ ∗ (n) · + O(x r d ∗ (n)), r +1 n

(39)

for any r ≥ 0, x ≥ 1, n ≥ 1; where d ∗ (n) denotes the number of unitary divisors of n. P. Haukkanen [186] obtained the unitary analogue of (38): ∗ ∗ ∗ (x, n) + {x} ϕ (n) − 1 1 ≤ d(n) + d(m) − md(m)ψ (n) (40) n 2 m 2 2 nψ ∗ (m) 1 ∗ ∗ ∗ where m = ([x], n) , ψ (n) = σ (n) = n 1 + a is the unitary analogue p pa n of Dedekind’s function (in fact, the sum of unitary divisors of n), and ∗ (x, n) = ϕ ∗ (x, n) − xϕ ∗ (n)/n. 284


In fact, Haukkanen works in the context of A-convolutions, and (38), (40) are particular cases. Let S ⊂ N be a non-void set of positive integers. The Legendre totient of u arguments associated to S was introduced by E. Cohen [191] as ϕ S (x1 , . . . , xu ; n) = number of u-tuples a1 , . . . , au with a j (mod x j ) ( j = 1, u) such that ((a1 , . . . , au ), n) ∈ S. When S = {1}, and u = 1, this reduces to the classical Legendre function. Then x x 1 u ... , (41) ϕ S (x1 , . . . , xu ; n) = µ S (d) d d d|n where µ S is the Möbius function of the set S (see 2.2.4 of Chapter 2, where the more general µ S,A is introduced, too). For certain arithmetical products, with asymptotic expansions, which involve also ϕ S , see J. Sándor and L. Tóth [386]. In [184] this function is generalized to Ak -convolutions, so (41) becomes µ S,Ak (d)[x1 /d k ] . . . [xu /d k ] (42) ϕ S,A,k (x1 , . . . , xu ; n) = d∈Ak (n)

For an application of Legendre’s totient function ϕ(x, n) in the study of primes in a real quadratic field, see A. Granville, R. A. Mollin and H. C. Williams [157], where it is proved e.g that if x ≥ 4.7 · 1015 , then 1 π(x) ≤ ϕ(x, n), 3 where n is the product of all primes ≤ 14 log x, and π(x) is the number of primes ≤ x.

9

Euler totients of meet semilattices and finite fields

Relation (35) of 3.6 gives a generalization of Euler’s totient to a finite meet semilattice, and a function f : P → C. In [191] P. Haukkanen and J. Wang considered set-valued maps f : P → A, where P is a meet-semilattice, S ⊂ P is a fixed set, and A is a collection of finite subsets of S. The mapping f is called a regular S-representation of P if f (x ∧ y) = f (x) ∩ f (y) for all x, y ∈ P. The Euler totient ϕ f (x) of P with respect to a regular S-representation f is defined as the number of elements z ∈ f (x) such that z ∈ f (y) for y < x (we assume that P is a meet-semilattice and that every principal order ideal of P is finite). Then ϕ f (x) = µ(y, x)| f (y)| (43) y≤x

285

CHAPTER 3

Examples. 1) When P is N, ordered by divisibility, and f (n) = Un , the set of all nth roots of unity, then with U = Un , f will be a regular U -representation of N. n≥1

Then ϕ f (n) = ϕ(n), the classical Euler totient. 2) Let f k (n) = Un k , U = Un . Then ϕ fk ≡ ϕk = Cohen’s totient function. n≥1

3) For gk (n) = (Un )k one obtains ϕgk = Jk = Jordan’s totient function. Let Fq denote a finite field of q elements, and let V be a vector space over Fq . Let A be the set of all finite-dimensional subspaces of V . Let f q : P → A be a regular V -representation of P, i.e. let f q (x ∧ y) = f q (x) ∩ f q (y), ∀ x, y ∈ P

(44)

The q-Euler function ϕ fq (x) is the number of 1-dimensional subspaces of f q (x) that are not contained in f q (y) for y < x. Then ϕ fq (x) =

µ(y, x)

y≤x

q dim fq (y) − 1 q −1

(45)

E.g., for example 1) above, when f q (n) = Fq (Un ), we get the q-analogue of the classical Euler totient: ϕq (n) = ϕ fq (n) =

µ(n/d)

d|n

qd − 1 q −1

(46)

The q-analogue of Jordan’s totient Jk (see example 3) above) will be ϕ J,q (n) = ϕgq,k (n) =

d|n

k

qd − 1 µ(n/d) q −1

(47)

Let f be a regular representation of P, and α : P → G, where (G, +) is an Abelian group. The Ramanujan sum of P with respect to f and α is defined by α(z), (48) C f,α (x) = z∈S f (x)

where S f (x) = {z ∈ f (x) : z ∈ f (y) for y < x}. One has C f,α (x) = µ(y, x) α(z),

(49)

z∈ f (y)

y≤x

and the q-analogue of the classical Ramanujan sum can be introduced (see [191]). 286


10

Nonunitary, infinitary, exponential-totients

We now consider totient functions suggested by certain notions of Chapters 1, 2. In 1.9 of Chaper 1, as well as 2.2.6, 2.2.10 of Chapter 2 there are considered the nonunitary, infinitary, exponential divisors, and convolution products. See also 1.13 and 1.14. The nonunitary totient function ϕ # (n) is defined as the number of positive integers ≤ n which are not divisible by any of the nonunitary divisors of n. If n = n ·n # , where n is the squarefree, while n # the powerful part, of n, then ϕ # (n) = n · ϕ(n # ) One has also

(50)

ϕ # (d) = σ ∗ (n),

(51)

d|n

where σ ∗ (n) is the sum of unitary divisors of n (see [257]). Similarly,     ϕ # (d) = σ (n) σ ∗ (n # ) − ( p e − p e−1 + 1)   # e #

(52)

p n

d| n

It is conjectured that if

ϕ # (d) = n, then n # is even.

d|n

In part 2.2.10 of Chapter 2 there are introduced the infinitary divisors and Möbius’ infinitary function. If n = p1 p2 . . . pt , where p1 < p2 < · · · < pt are the I components of n, then one defines the infinitary totient function by ϕ∞ (1) = 1,

ϕ∞ (n) = n

t j=1

1 1− pj

(n > 1)

(53)

The function ϕ∞ is I -multiplicative, i.e. (m, n)∞ = 1 (i.e. greatest common infinitary divisor is =1), then ϕ∞ (mn) = ϕ∞ (m)ϕ∞ (n). Similarly, ϕ∞ (d) = n (54) d|∞ n

For these results and what follow, see [87]. Let also ϕ∞ (x, n) be the infinitary Legendre totient defined by ϕ∞ (x, n) = number of a ≤ x such that (a, n)∞ = 1. One has the following asymptotic results: ϕ∞ (x, n) = k∞ (n)x + O(n ε x ε ) 287

(55)

CHAPTER 3

for any x > 0, n ≥ 1, (ε > 0), where the multiplicative constant implied by the big of notation depends only on ε, and k∞ is an arithmetic function defined by k∞ (1) = 1, t pj . Similarly, k∞ (n) = p +1 j=1 j

ϕ∞ (n) =

n≤x

x2 · A + O(x 1+ε log x) 2

for any x > 1, and any ε > 0. Here A = one has:

(56)

∞ 2 µ∞ (n)k∞ (n) . For the function k∞ (n) 2 n n=1

k∞ (n) = C x + O(x ε log x)

(57)

n≤x

1 1− . for all x > 1, where C = (P + 1)2 P∈I For the exponential divisors and convolutions, see 1.10 of Chapter 1, and 2.2.6 of Chapter 2. The exponential totient function is introduced in [270] of Chapter 2 (classical case), and in [486] of Chapter 2 (regular convolutions). Let ϕe (n) denote the number of all a ≤ n with (a, n)e = 1, and put ϕe (1) = 1. If n = p1a1 . . . prar is the prime factorization of n > 1, then ϕe (n) = ϕ(a1 ) . . . ϕ(ar ) ϕe is a multiplicative function, and (see [380]) ϕe (d) = a1 . . . ar

(58)

(59)

d|e n

Other properties of ϕe are: If n|e m, then ϕe (n)|ϕe (m); ϕe (n)de (n) ≥ a1 . . . ar ; if all ai (i = 1, r ) are odd, then ϕe (n)de (n) ≥ σ (a1 ) . . . σ (ar ), where de (n) is the sum of exponential divisors of n; lim sup(log ϕe (n)) n→∞

log log n log 4 = log n 5

(60)

Finally, note that the Golomb-Guerin totient function ϕ∇ is introduced in 2.2.8 of Chapter 2 (see [165]). For generalized Euler functions involving rational arithmetic functions, and the extensions of the Fleck-Popoviciu-Buschman-Hsu-Wang Möbius function, see 2.2.1 and 2.2.4 of Chapter 2. For a Lucas-sequence based generalization of Euler’s totient, see 3.2.2 of Chapter 3. 288


11

Thacker’s, Leudesdorf’s, Lehmer’s, Golubev’s totients. Square totient, core-reduced totient, M-void totient, additive totient

In 3.4.1 we have introduced Thacker’s totient function, as well as the generalized totient due to Leudesdorf. Lehmer’s totient function is considered in 3.4.2. In 3.2.5 there is a class F1 of generalized totient functions due to Siva Rama Prasad and Fonseca. Other functions are the Golubev totient functions. In 1953 V. A. Golubev [151], by studying twin primes and other special types of primes, defined ϕ2 (n) = number of pairs (a1 , a2 ) of positive integer such that a2 − a1 = 2, (a1 , n) = 1, a1 ≤ n. Then ϕ2 is multiplicative, and  2   n , if n is odd 1−   p   p|n (61) ϕ2 (n) =   n 2   , if n is even 1−   2 p p|n If ϕ2k (n) = number of pairs (a1 , a2 ) with a2 − a1 = 2k, (a1 , n) = 1, a1 ≤ n, then ϕ2k is multiplicative, and 1 2 (62) 1− 1− ϕ2k (n) = n q q|n,q 2k q q|n,q|2k More generally, let ϕ (m) (n; r1 , . . . , rm−1 ) = number of sets of positive integers a1 , . . . , am each relatively prime to n, with given differences ak − ak−1 = rk−1 (1 ≤ k ≤ m − 1), all of the r ’s being even, and a1 ≤ n. Then 1 1 ϕ (m) (n; r1 , . . . , rm−1 ) = n 1− ... 1 − (63) p1 pm p1 ,..., pm in which pk denotes the prime divisors of n such that the set {0, r1 , r1 + r2 , . . . , r1 + r2 +· · ·+rm−1 } contains at most j ( pk ; r1 , . . . rm−1 ) incongruent elements (mod pk ). (64) See also R. G. Buschman [58]. The square-totient of R. Sivaramakrishnan [422] is introduced as follows. Let n ≥ 1, and consider the set of integers a (mod n) such that (a, n) = a square ≥ 1, and contained in a complete residue system (mod n) is called a ”square-reduced residue system (mod n)”. The number of elements in a square-reduced residue system (mod n) is denoted by b(n). 289

CHAPTER 3

Let

ε(n) =

1, if n is a perfect square 0, otherwise

Then b(n) =

ε(d)ϕ

d|n

n

(65)

d

The function b is multiplicative, and satisfies certain identities, see e.g. [421]. Let γ (n) denote the product of distinct prime divisors of n > 1 (i.e. ”core of n”), and put γ (1) = 1. Let S denote a complete residue system (mod n), and let M be the set of integers c (mod n) such that (c, n) = γ (n), and contained in S. This subset M will be called as the ”core-reduced residue system (mod n)”. The core-reduced totient of J. Sándor and R. Sivaramakrishnan [383] is the cardinality m(n) of M. The function m(n) is multiplicative, and m(n) = ϕ(s),

where s =

n γ (n)

(66)

Let c ≡ 0 (mod n). If c (mod n) is such that (c, n) = γ (n), then ck ≡ 0 (mod n) for some integer k ≥ 1. Therefore, the elements of a core-reduced residue system (mod n) are nonzero nilpotent elements in the ring Zr . In fact, m(n) does not count all the nilpotent elements in Zr , but the number of nilpotents elements in n Zn is s − 1, where s = (see [383]). γ (n) Let M be a set of positive integers with min M = s ≥ 2. A positive integer r piai is said to be M-void, if ai ∈ M, i = 1, r . Let Q M denote the set of all n= i=1

M-void integers, and denote by q M its characteristic function. Let λ M be defined by q M (n) = λ M (d). It is clear that q M and λ M are multiplicative functions, and for d|n

all prime powers pa ,   −1, if a ∈ M a − 1 ∈ M a 1, if a ∈ M a − 1 ∈ M λM ( p ) =  0, otherwise

(67)

M. V. Subbarao and R. Sitaramachandrarao [444] define the M-void analogue of the Euler totient function by the number ϕ M (n) of integers x ≤ n such that (x, n) ∈ Q M . (This is a particular case of the Cohen totient ϕ S with S = Q M ). We have n ϕ M (n) = λ M (d) (68) d d|n 290


and

ϕM ( p ) = a

if 1 ≤ a ≤ s − 1 pa a s a−s a p + λM ( p ) p + · · · + λ M ( p ) if a ≥ s

Let A(x, ϕ M ) be the number of positive integers n such that 1 ≤ ϕ M (n) ≤ x. Then, for each c > 0, as x → ∞, A(x, ϕ M ) = A(ϕ M )x + O(x(δ(x))c ) where A(ϕ M ) =

1− p

∞ + (1 − p ) (ϕ M ( pa ))−1

−s

−1

a=s

p prime

and

(69)

3

δ(x) = exp{−(log x) 8 −ε }.

For particular sets M one can reobtain the sets of r -free integers, (k, r )-integers, unitary r -free integers, semi-r -free integers, etc. By counting rational points on a projective space or on quadratic twists of an elliptic curve, A. Sato [389] introduced the following generalizations of Euler’s totient. Let q > 0 be a given integer, and put ϕq (x) = number of 0 < y ≤ x such that (x, qy) = 1; ψq (y) = number of 0 < x ≤ y such that (x, qy) = 1. Clearly, ϕ1 (x) = ϕ(x), ϕ1 (y) = ϕ(y). The following asymptotic formulae are due to Shigeki Akiyama (see [389]): ϕq (x) = Cq B 2 + O(B log B) x≤B

ψq (y) = Cq B 2 + O(B log B), as B → ∞

(70)

y≤B r 3 pi , with ( pi ) the distinct prime divisors of q. 2 π i=1 pi+1 Finally, we note that the additive analogue of Euler’s totient has been defined by r piai (prime factorization) and n > 1, let K. Atanassov [18] as follows: For n =

where Cq =

i=1

ρ(n) =

r

piai −1 ( pi − 1)

(71)

i=1

Put ρ(1) = 0. Then clearly ρ is an additive function, i.e. ρ(nm) = ρ(n) + ρ(m) for all (m, n) = 1. The function ρ is connected also to other functions, e.g. to the 291

CHAPTER 3

additive analogue of the σ (sum-of-divisors) function, defined by θ (n) =

r piai +1 − 1 , pi − 1 i=1

θ(1) = 0.

(72)

One has ρ(n) ≤ ϕ(n);

θ (n) ≤ n − 1 for all n ≥ 1

(73)

and ρ(n) ≥ r (ϕ(n))1/r ;

12

θ (n) ≥ r (σ (n))1/r for n > 1.

(74)

Euler totients of arithmetical semigroups, finite groups, algebraic number fields, semigroups, finite commutative rings, finite Dedekind domains

Generalized integers and arithmetical semigroups have been considered in 2.2.11 and 2.5.1 of Chapter 2. If G is an arithmetical semigroup and H an arithmetical subsemigroup of G, for xi ∈ G (1 ≤ i ≤ k) one can define the H -greatest common divisor of the xi ’s by (x1 , . . . , xk ) H = h if h is an element from H with the largest possible norm that divides each xi (1 ≤ i ≤ k). Let ϕk (H, x) denote the number of k-tuples x1 , . . . , xk of elements of G such that |xi | ≤ x (i = 1, k) and (x1 , . . . , xk ) H = 1. H. Wegman [479] called an arithmetical semigroup δ-regular, if its counting function G(x) satisfies G(x) = x δ L(x), where L(x) is defined for all x > 0, and L(ax) → 1 as x → ∞ for every a > 0. If G is δ-regular, then Wegman proved L(x) |n|−s converges for s > δ and diverges for s < δ. that its zeta functions ζG (s) = n∈G

t δ G(x/t) − 1, for x, t > 0. The following result is due to S. Porubský Let r (x, t) = G(x) [339]. Let G be δ-regular such that r (x, t) is uniformly bounded for all x, t > 0. Let H be an arithmetical subsemigroup such that the series |h|−kδ = ζ H (kδ) h∈H

converges. Then

ϕk (H, x) =

1 + o(1) (G(x))k ζ H (kδ)

(75)

If G satisfies the axiom: there exist positive constants A and δ and a constant η with ≤ η < δ such that G(x) = Ax δ + O(x η ) as x → ∞ 292

(76)


then for k ≥ 2, 1 x kδ + ϕk (H, x) = A ζ H (kδ)

k

O(x (k−1)δ+η ) if k > 2, or k = 2 and η > 0 O(x δ log x) if k = 2, η = 0

(77)

In 2.5.3 there were introduced Möbius functions and Euler functions of finite groups, soluble groups, algebraic number fields, or algebraic function fields (in fact, having introduced a Möbius function, the Euler functions follow at once). We note here that L. Weisner [477] computed the Möbius and Euler functions of a finite pgroup as follows. Recall that the Frattini subgroup of a finite group G (denoted by Frat G) is the intersection of all maximal, proper subgroups of G. If G is a p-group, then Frat G = [G, G] · G p , by the Burnside basis theorem. Now, Weisner proved that the Möbius function of a finite p-group G is given by (−1)d p d(d−1)/2 , where p d = [G : H ] if Frat G ≤ H, (78) µ(H ) = 0, if Frat G H Now set pr = |G| and p s = |G : Frat G|. The Euler function of G is then given by ϕn (G) = p (r −s)n

s−1 ( pn − pi )

(79)

i=0

For a recent account on the Euler functions of finite groups, see K. S. Brown [55]. √ Let K = Q( D) be an arbitrary (real or complex) quadratic field; let a denote an integral ideal in the ring R of algebraic integers in K (a = (0)) with norm N (a) (i.e. the number of residue classes of R modulo a). Let ϕ(a) be the number of those residue classes which are prime to a (see e.g. E. Hecke [196]). Then it is well known that ϕ(a) = N (a) (1 − N ( p)−1 ) ( p a prime ideal), and p|a

ϕ(a) = kx 2 + R0 (x),

(80)

ϕ(a) = 2kx + R1 (x), N (a) N (a)≤x

(81)

N (a)≤x

N (a)≤x

1 = αρ log x + λ + E 0 (x), ϕ(a)

N (a) = αρx + ρζk (0) log x + E 1 (x) ϕ(a) N (a)≤x

(82) (83)

where ρ is the residue of the Dedekind zeta-function ζk (s) at s = 1; k = ρ(2ζ K (2))−1 ; α = ζ K (2)ζ K (3)/ζ K (6); and λ is another constant. By generalizing 293

CHAPTER 3

results obtained in the classical case by Pillai and Chowla, W. G. Nowak [324] has obtained the following estimates:

R0 (n) =

n≤x

k 2 x + O(x 2 δ(x)), 2

R1 (x) = kx + O(xδ(x)),

(80 ) (81 )

n≤x

where δ(x) = exp{−c(log x)3/5 (log log x)−1/5 } and c > 0 is a constant depending on K . Similarly, by extending results on E 0 and E 1 from the classical case, Nowak has proved: 1 αρ − ζ K (0)ρ log x + O(1) E 0 (n) = (82 ) 2 n≤x E 1 (n) = ωx + O(x 13/14 ) (83 ) n≤x

where ω is a constant. We note that R0 (x) = O(x 4/3 ), R1 (x) = O(x 1/3 ), E 0 (x) = O(x −2/3 ), E 1 (x) = O(x 1/3 ) (84) but in the classical case the results are stronger (see [291], Chapter 1). For the Euler functions of semigroups, finite commutative rings, and finite Dedekind domains, see 3.2.2 of this Chapter.

294

References [1] L. M. Adleman, C. Pomerance and R. S. Rumely, On distinguishing prime numbers from composite numbers, Ann. of Math. 117(1983), 173-206. [2] A. Aigner, Das quadratfreie Kern der Eulerschen ϕ-Funktion, Monatsh. Math. 83(1977), 89-91. [3] L. Alaoglu and P. Erdös, A conjecture in elementary number theory, Bull. Amer. Math. Soc. 50(1944), no. 12, 881-882. [4] H. L. Alder, A generalization of Euler’s ϕ-function, Amer. Math. Monthly 65(1958), 690-692. [5] K. Alladi, On arithmetic functions and divisors of higher order, pp. 1-20, in: K. Alladi, New Concepts in Arithmetic Functions, Math.-Science Report 83, The Institute of Math. Sciences, Madras. [6] E. Altinisik and D. Tasci, On a generalization of the reciprocal lcm matrix, Comm. Fac. Sci. Univ. Ank. Series A1, 51(2002), no. 2, 37-46. [7] E. Altinisik, N. Tuglu and P. Haukkanen, A note on bounds for norms of the reciprocal LCM matrix, Math. Ineq. Appl. (to appear). [8] H. Alzer, The Euler-Fermat theorem, Intern. J. Math. Educ. Sci. Tech. 18(1987), 635-636. [9] F. Amoroso, Algebraic numbers close to 1 and variants of Mahler’s measure, J. Number Theory 60(1996), no. 1, 80-96. [10] F. Amoroso, On the height of a product of cyclotomic polynomials, Rend. Semin. Mat. Torino 53(1995), no. 3, 183-191. [11] T. M. Apostol, Resultants of cyclotomic polynomials, Proc. Amer. Math. Soc. 24(1970), 457-462. 295

CHAPTER 3

[12] T. M. Apostol, The resultants of the cyclotomic polynomials Fm (ax) and Fn (bx), Math. Comp. 29(1975), 1-6. [13] T. M. Apostol, Arithmetical properties of generalized Ramanujan sums, Pacific J. Math. 41(1972), 281-293. [14] F. Arndt, Einfacher Beweis für die Irreduzibilität einer Gleichung in der Kreisteilung, J. Reine Angew. Math. 56(1858), 178-181. [15] L. K. Arnold, S. J. Benkoski and B. J. McCabe, The discriminator (A simple application of Bertrand’s postulate), Amer. Math. Monthly 92(1985), 275277. [16] K. Atanassov, A new formula for the n-th prime number, Comptes Rendus de l’Acad. Bulg. Sci. 54(1992), no. 7, 5-6. [17] K. T. Atanassov, Remarks on ϕ, σ and other functions, C. R. Acad. Bulg. Sci. 41(1988), no. 8, 41-44. [18] K. T. Atanassov, New integer functions, related to ϕ and σ functions, Bull. Numb. Theory Rel. Topics 11(1987), 3-26. [19] A. Axer, Monath. Math. Phys. 22(1911), 187-194. [20] E. Bach and J. Shallit, Factoring with cyclotomic polynomials, Math. Comp. 52(1989), no. 185, 201-219. [21] G. Bachman, On the coefficients of cyclotomic polynomials, Mem. Amer. Math. Soc. 106(1993), no. 510, 80 p. [22] A. Bager, Problem E2833∗ , Amer. Math. Monthly 87(1980), 404, Solution in the same journal 88(1981), 622. [23] R. Baillie, Table of φ(n) = φ(n + 1), Math. Comp. 29(1975), 329-330. [24] U. Balakrishnan, Some remarks on σ (ϕ(n)), Fib. Quart. 32(1994), 293-296. [25] R. Ballieu, Factorisation des polynomes cyclotomiques modulo un nombre premier, Ann. Soc. Sci. Bruxelles Sér. I 68(1954), 140-144. [26] A. S. Bang, On Ligningen φn (x) = 0, Nyt Tidsskrift for Mathematik, 6(1895), 6-12. [27] C. W. Barnes, The infinitude of primes. A proof using continued fractions, L’Enseignement Math. 23(1976), 313-316. 296


[28] A. Batholomé, Eine Eigenschaft primitiver Primteiler von d (a), Arch. Math., Basel 63(1994), no. 6, 500-508. [29] N. L. Bassily, I. Kátai and M. Wijsmuller, Number of prime divisors of ϕk (n), where ϕk is the k-fold iterate of ϕ, J. Number Theory 65(1997), 226-239. [30] P. T. Bateman, The distribution of values of the Euler function, Acta Arith. 21(1972), 329-345. [31] P. T. Bateman, Solution of a problem by Ore, Amer. Math. Monthly 70(1963), 101-102. [32] P. T. Bateman, Note on the coefficients of the cyclotomic polynomial, Bull. Amer. Math. Soc. 55(1949), 1180-1181. [33] P. T. Bateman, C. Pomerance and R. C. Vaughan, On the size of the coefficients of the cyclotomic polynomial, Coll. Math. Soc. J. Bolyai, 1981, 171-202. [34] M. Beiter, The midterm coefficient of the cyclotomic polynomial F pq (x), Amer. Math. Monthly 71(1964), 769-770. [35] E. Belaga and M. Mignotte, Cyclic structure of dynamical systems associated with 3x + d extensions of Collatz problem, Prépublication de l’Inst. Rech. Math. Avancée, Univ. Louis Pasteur, 2000/18, pp. 1-62. [36] R. Bellman and H. N. Shapiro, The algebraic independence of arithmetic functions (I) Multiplicative functions, Duke Math. J. 15(1948), no. 1, 229-235. [37] L. Berardi and B. Rizzi, Generalized Ramanujan sums by Stevens’ totient (Italian), La Ricerca, Mat. Pure Appl., Roma, 31(1980), no. 3, 1-7. ˇ at, On values of the function ϕ + d, Acta Math. Univ. [38] H. Bereková and T. Sal´ Comenian 54/55(1988), 267-278 (1989). [39] B. C. Berndt, A new method in arithmetical functions and contour integration, Canad. Math. Bull. 16(1973), no. 3, 381-387. [40] S. Beslin, Reciprocal GCD matrices and LCM matrices, Fib. Quart. 29(1991), 271-274. [41] S. Beslin and S. Ligh, Another generalization of Smith’s determinant, Bull. Austral. Math. Soc. 40(1989), 413-415. [42] S. Beslin and S. Ligh, GCD-closed sets and the determinants of GCD matrices, Fib. Quart. 30(1992), 157-160. 297

CHAPTER 3

[43] G. Bhowmik, Average orders of certain functions connected with arithmetic functions of matrices, J. Indian Math. Soc. 59(1993), 97-106. [44] G. Bhowmik and O. Ramaré, Average orders of multiplicative arithmetic functions of integer matrices, Acta Math. 66(1994), no. 1, 45-62. [45] D. M. Bloom, On the coefficients of the cyclotomic polynomials, Amer. Math. Monthly 75(1968), 372-377. ¨ [46] H. Bonse, Uber eine bekannte Eigenschaft der Zahl 30 und ihre Verallgemeinerung, Archiv. der Math. und Physik 3(1907), no. 12, 292-295. [47] W. Bosma, Computation of cyclotomic polynomials with Magma, In: Bosma, Wieb (ed.) et al., computational algebra and number theory, based on a meeting on comp. algebra and number th., held at Sydney Univ., Australia, Nov. 1992, Dordrecht, Kluwer A.P., Math. Appl. Dordrecht 325(1995), 213-225. [48] K. Bourque and S. Ligh, Matrices associated with arithmetical functions, Linear and Multilinear Algebra 34(1993), 261-267. [49] K. Bourque and S. Ligh, On GCD and LCM matrices, Linear Algebra Appl. 174(1992), 65-74. [50] K. Bourque and S. Ligh, Matrices associated with multiplicative functions, Linear Algebra Appl. 216(1995), 267-275. [51] D. Bozkurt and S. Solak, On the norms of GCD matrices, Math. Comp. Appl. 7(2002), no. 3, 205-210. [52] R. P. Brent, On computing factors of cyclotomic polynomials, Math. Comp. 61(1993), no. 203, 131-149. [53] J. Browkin and A. Schinzel, On integers not of the form n − ϕ(n), Colloq. Math. 68(1995), no. 1, 55-58. [54] E. Brown, Directed graphs defined by arithmetic (mod n), Fib. Quart. 35(1997), 346-351. [55] K. S. Brown, The coset poset and probabilistic zeta function of a finite group, J. Algebra 225(2000), 989-1012. [56] R. A. Brualdi and M. Newman, An enumeration problem for a congruence equation, J. Res. Nat. Bur. Stand. (U. S.) 74B(Math. Sci.), No. 1, 37-40 (JanMarch 1970). 298


[57] P. S. Bruckman, American Math. Monthly 92(1985), 434. [58] R. G. Buschman, Identities involving Golubev’s generalizations of the µfunction, Portug. Math. 29(1970), no. 3, 145-149. [59] L. P. Cacho, Sobre la suma de indicadores de ordenes sucesivos, Rev. Matem. Hispano-Americana 5.3(1939), 45-50. [60] L. Carlitz, Note on an arithmetic function, Amer. Math. Monthly 59(1952), 385-387. [61] L. Carlitz, A theorem of Schemmel, Math. Mag. 39(1966), no. 2, 86-87. [62] L. Carlitz, The number of terms in the cyclotomic polynomial F pq (x), Amer. Math. Monthly 73(1966), 979-981. [63] L. Carlitz, The sum of the squares of the coefficients of the cyclotomic polynomial, Acta Math. Hungar. 18(1967), 295-302. [64] L. Carlitz, Some matrices related to the greatest integer function, J. Elisha Mitchell Sci. Soc. 76(1960), 5-7. [65] R. D. Carmichael, Note on a new number theory function, Bull. Amer. Math. Soc. 16(1910), 232-238. [66] R. D. Carmichael, On composite numbers p which satisfy the Fermat congruence a p−1 ≡ 1 (mod p), Amer. Math. Monthly 19(1912), 22-27. [67] R. D. Carmichael, Note on Euler’s ϕ-function, Bull. Amer. Math. Soc. 28(1922), 109-110. [68] R. D. Carmichael, Amer. Math. Monthly 18(1911), 232. [69] P. J. McCarthy, Introduction to arithmetical functions, Springer Verlag, New York, 1986. [70] P. J. McCarthy, Note on the distribution of totatives, Amer. Math. Monthly 64(1957), 585-586. [71] P. J. McCarthy, A generalization of Smith’s determinant, Canad. Math. Bull. 29(1986), 109-113. [72] P. J. McCarthy, Some more remarks on arithmetical identities, Portug. Math. 21(1962), 45-57. 299

CHAPTER 3

[73] J. Chidambaraswamy, Sum functions of unitary and semi-unitary divisors, J. Indian Math. Soc. 21(1968), 117-126. [74] Chung-Yan Chao, Generalizations of theorems of Wilson, Fermat and Euler, J. Number Theory 15(1982), 95-114. [75] P. Codecá and M. Nair, Calculating a determinant associated with multiplicative functions, Boll. Unione Mat. Ital. Ser. B Artic. Ric. Mat. (8) 5(2002), no. 2, 545-555. [76] E. Cohen, Rings of arithmetic functions, Duke Math. J. 19(1952), 115-129. [77] E. Cohen, A class of arithmetical functions, Proc. Nat. Acad. Sci. U.S.A. 41(1955), 939-944. [78] E. Cohen, An extension of Ramanujan’s sum, Duke Math. J. 19(1952), 115129. [79] E. Cohen, Generalizations of the Euler ϕ-function, Scripta Math. 23(1957), 157-161. [80] E. Cohen, Some totient functions, Duke Math. J. 23(1956), 515-522. [81] E. Cohen, Nagell’s totient function, Math. Scand. 8(1960), 55-58. [82] E. Cohen, Trigonometric sums in elementary number theory, Amer. Math. Monthly 66(1959), 105-117. [83] E. Cohen, Arithmetical functions associated with the unitary divisors of an integer, Math. Z. 74(1960), 66-80. [84] E. Cohen, A property of Dedekind’s function, Proc. Amer. Math. Soc. 12(1961), 996. [85] G. L. Cohen, On a conjecture of Makowski and Schinzel, Colloq. Math. 74(1997), no. 1, 1-8. [86] G. L. Cohen and P. Hagis, Jr., On the number of prime factors of n if φ(n)|(n − 1), Nieuw Arch. Wiskunde (3)28(1980), 177-185. [87] G. L. Cohen and P. Hagis, Jr., Arithmetic functions associated with the infinitary divisors of an integer, Intern. J. Math. Math. Sci. 16(1993), no. 2, 373-384. [88] G. L. Cohen and S. L. Segal, A note concerning those n for which ϕ(n) + 1 divides n, Fib. Quart. 27(1989), 285-286. 300


[89] E. B. Cossi, Problem 6623, Amer. Math. Monthly 99(1990), 162; solution by J. Herzog and P. R. Smith, same journal 101(1992), 573-575. [90] R. Creutzburg and M. Tasche, Parameter determination for complex numbertheoretic transforms using cyclotomic polynomials, Math. Comp. 52(1989), no. 185, 189-200. [91] L. Cseh, Generalized integers and Bonse’s theorem, Studia Univ. Babes¸Bolyai Math. 34(1989), no. 1, 3-6. [92] L. Cseh and I. Merényi, Problem E3215, Amer. Math. Monthly 94(1987), 548. Solution by K. D. Wallace and R. G. Powers, same journal 95(1989), 64. [93] G. Daniloff, Contribution a` la théorie des fonctions arithmetiques (Bulgarian), Sb. Bulgar. Akad. Nauk 35(1941), 479-590. [94] H. Davenport, On a generalization of Euler’s function ϕ(n), J. London Math. Soc., 7(1932), 290-296. [95] M. Deaconescu, Adding units (mod n), Elem. Math. 55(2000), 123-127. [96] M. Deaconescu and H. K. Du, Counting similar automorphisms of finite cyclic groups, Math. Japonica 46(1997), 345-348. [97] M. Deaconescu and J. Sándor, A divisibility property (Romanian), Gazeta Mat., Bucures¸ti, XCI, 1986, no. 2, 48-49. [98] M. Deaconescu and J. Sándor, Variations on a theme by Hurwitz, Gazeta Mat. A 8(1987), no. 4, 186-191. [99] M. Deaconescu and J. Sándor, On a conjecture of Lehmer, 1988, unpublished manuscript. [100] R. Dedekind, Beweis für die Irreductibilität der Kreistheilungsgleichungen, J. Reine Angew. Math. 54(1857), 27-30 (see also Werke I, 1930, 68-71). [101] H. Delange, Sur les fonctions multiplicatives a` valeurs entiers, C. R. Acad. Sci. Paris, Série A 283(1976), 1065-1067. [102] T. Dence and C. Pomerance, Euler’s function in residue classes, Ramanujan J. 2(1998), 7-20. [103] L. E. Dickson, History of the theory of numbers, vol. 1, Divisibility and primality, Chelsea Publ. Co. 1999 (original:1919). 301

CHAPTER 3

[104] L. E. Dickson, A new extension of Dirichlet’s theorem on prime numbers, Messenger of Math. 33(1904), 155-161. ¨ [105] F.-E. Diederichsen, Uber die Ausreduktion ganzzahliger Gruppendarstel¨ lungen bei arithmetischer Aquivalenz, Abh. Math. Sem. Hansischen Univ. 13(1940), 357-412. [106] R. B. Eggleton, Problem Q645, Math. Mag. 50(1977), 166; Solution by R. B. Eggleton, 50(1977), 169, same journal. [107] A. Ehrlich, Cycles in doubling diagrams (mod m), Fib. Quart. 32 (1994), 74-78. [108] M. Endo, On the coefficients of the cyclotomic polynomials, Comment. Math. Univ. St. Paul 23(1974/75), 121-126. [109] P. Erdös, On pseudoprimes and Carmichael’s numbers, Publ. Math. Debrecen 4(1955-6), 201-206. [110] P. Erdös, Proposed problem P294, Canad. Math. Bull. 23(1980), 505. [111] P. Erdös, Some remarks on Euler’s φ-function and some related problems, Bull. Amer. Math. Soc. 51(1945), 540-545. [112] P. Erdös, On a conjecture of Klee, Amer. Math. Monthly 58(1951), 98-101. [113] P. Erdös, Some remarks on Euler’s ϕ function, Acta Arith. 4(1958), 10-19. [114] P. Erdös, On the normal number of prime factors of p − 1 and some other related problems concerning Euler’s ϕ-function, Quart. J. Math. (Oxford Ser.) 6(1935), 205-213. [115] P. Erdös, Solutions of two problems of Jankowska, Bull. Acad. Polon. Sci., Sér. Sci. Math., Astr. et Phys. 6(1958), 545-547. [116] P. Erdös, Some remarks on the functions ϕ and σ , Bull. Acad. Polon Sci., Sér. Sci. Math., Astr. et Phys. 10(1962), 617-619. [117] P. Erdös, Some remarks on the iterates of the ϕ and σ functions, Colloq. Math. 17(1967), 195-202. [118] P. Erdös, Some remarks on a paper of McCarthy, Canad. Math. Bull. 1(1958), 71-75. 302


[119] P. Erdös, The difference of consecutive primes, Duke Math. J. 6(1940), 438441. [120] P. Erdös, On the coefficients of the cyclotomic polynomial, Bull. Amer. Math. Soc. 54(1946), 179-184. [121] P. Erdös, On the coefficients of the cyclotomic polynomials, Portugal Math. 8(1949), 63-71. [122] P. Erdös, On a problem in elementary number theory, Math. Student 17(1949), 32-33 (1950). [123] P. Erdös and C. W. Anderson, Problem 6070, Amer. Math. Monthly 83(1976), 62; Solution by R. E. Shafer, 84(1977), 662, same journal. [124] P. Erdös, A. Granville, C. Pomerance and C. Spiro, On the normal behaviour of the iterates of some arithmetic functions, Analytic Number Theory, Proc. Conf. in Honor of P. T. Bateman, Ed. by B. C. Berndt, H. G. Diamond, H. Halberstam and A. Hildebrand, 1990, pp. 165-204 (Birkhäuser Boston, Basel, Berlin). [125] P. Erdös, K. Györy and Z. Papp, On some new properties of functions σ (n), ϕ(n), d(n), and ν(n) (Hungarian), Mat. Lapok 28(1980), 125-131. [126] P. Erdös and R. R. Hall, Distinct values of Euler’s ϕ-function, Mathematica 23(1976), 1-3. [127] P. Erdös and C. Pomerance, On the normal number of prime factors of ϕ(n), Rocky Mountain J. Math. 15(1985), 343-352. [128] P. Erdös, C. Pomerance and A. Sárkazy, On locally repeated values of certain arithmetic functions, II, Acta Math. Hung. 49(1987), 251-259. [129] P. Erdös, C. Pomerance and E. Schmutz, Carmichael’s lambda function, Acta Arith. LVIII(1991), no. 4, 363-385. [130] P. Erdös and M. V. Subbarao, On the iterates of some arithmetic functions, A. A. Gioia and D. L. Goldsmith (Editors): The theory of arithmetic functions, Springer Verlag, Lecture Notes 251, 1972, pp. 119-125. [131] P. Erdös and R. C. Vaughan, Bound for the r-th coefficients of cyclotomic polynomials, J. London Math. Soc. (2) 8(1974), 393-400. [132] P. Erdös and S. S. Wagstaff, Jr., The fractional parts of the Bernoulli numbers, Illinois J. Math. 24(1980), 112-120. 303

CHAPTER 3

[133] L. Euler, Theoremata Arithmetica Nova Methodo Demonstrata, Opera Omnia, 1915, I.2, pp. 531-555 (original:1760). [134] M. Filaseta, S. W. Graham and C. Nicol, On the composition of σ (n) and ϕ(n), Abstracts AMS 13(1992), no. 4, p. 137. [135] S. Finch, http://pauillac.inria.fr/algo/bsolve/constant/totient/totient.html; or Mathematical constants, Cambridge Univ. Press, 2003, XX + 620 pp., Cambridge. [136] P. J. Forrester and M. L. Glasser, Problem E 2985, Amer. Math. Monthly 90(1983), 55; solution by H. L. Abbott, same journal 93(1986), p. 570. [137] K. Ford, http://www.mathpages.com/home/kmath073/kmath073.htm [138] K. Ford, The distribution of totients, Ramanujan J. 2(1998), 67-151. [139] K. Ford, The distribution of totients, Electron. Res. Announc. Amer. Math. Soc. 4(1998), 27-34. [140] K. Ford, The number of solutions of ϕ(x) = m, Annals of Math. 150(1999), 283-311. [141] K. Ford, An explicit sieve bound and small values of σ (ϕ(m)), Periodica Mat. Hung. 43(2001), no. 1-2, 15-29. [142] K. Ford, S. Konyagin, On two conjectures of Sierpinski concerning the arithmetic functions σ and ϕ, in: Number Theory in Progress Proc. Intern. Conf. Number Theory in Honor of 60th birthday of A. Schinzel (Poland, 1997), Walter de Gruyter, New York, 1999, pp. 795-803. [143] K. Ford, S. Konyagin and C. Pomerance, Residue classes free of values of Euler’s function, Number Theory in Progress, Proc. Int. Conf. on Number Th., in Honor of the 60th Birthday of A. Schinzel, Poland 1997; Ed. K. Györy, H. Iwaniec and J. Urbanowicz, Walter de Gruyter, Berlin 1999, pp. 805-812. [144] J. B. Friedlander, Shifter primes without large prime factors, in: Number theory and applications (R. A. Mollin, ed.), Kluwer Acad. Publ., pp. 393-401. [145] P. G. Garcia and S. Ligh, A generalization of Euler’s ϕ-function, Fib. Quart. 21(1983), 26-28. [146] C. F. Gauss, Disquisitiones arithmeticae, Göttingen, 1801. 304


¨ [147] L. Gegenbauer, Uber ein theorem des Herrn Mac Mahon, Monatshefte für Math. und Phys. 11(1900), 287-288. [148] L. Gegenbauer, Einige asymptotische Gesetze der Zahlentheorie, Sitzungsber. Akad. Wiss. Wien, Math., 92(1885), 1290-1306. [149] D. Goldsmith, A remark about Euler’s function, Amer. Math. Monthly 76(1969), 182-184. [150] S. W. Golomb, Equality among number-theoretic functions, Abstract 882-1116, Abstracts Amer. Math. Soc. 14(1993), 415-416. [151] V. A. Golubev, Sur certaines fonctions multiplicatives et le problème des jumeaux, Mathesis 67(1958), 11-20. [152] V. A. Golubev, On the functions ϕ2 (n), µ2 (n) and ζ2 (s) (Russian), Ann. Polon. Math. 11(1961), 13-17. [153] H. W. Gould and T. Shonhiwa, Functions of gcd’s and lcm’s, Indian J. Math. 39(1997), no. 1, 11-35. [154] H. W. Gould and T. Shonhiwa, A generalization of Cesàro’s function and other results, Indian J. Math. 39(1997), no. 2, 183-194. ¨ [155] K. Grandjot, Uber die Irreduzibilität der Kreisteilungsgleichung, Math. Z. 19(1924), 128-129. [156] S. W. Graham, J. J. Holt and C. Pomerance, On the solutions to φ(n) = φ(n + k), Number Theory in Progress, Proc. Intern. Conf. in Honor of 60th Birthday of A. Schinzel, Poland, 1997, Walter de Gruyter, 1999, pp. 867-882. [157] A. Granville, R. A. Mollin and H. C. Williams, An upper bound on the least inert prime in a real quadratic field, Canad. J. Math. 52(2000), no. 2, 369-380. [158] N. Gruber, On the theory of Fermat-type congruences (Hungarian), Math. ´ Termész. Ertesit¨ o 12(1896), 22-25. [159] A. Grytczuk, On Ramanujan sums on arithmetical semigroups, Tsukuba J. Math. 16(1992), no. 2, 315-319. [160] A. Grytczuk, F. Luca and M. Wójtowicz, A conjecture of Erdös concerning inequalities for the Euler totient function, Publ. Math. Debrecen 59(2001), no. 1-2, 9-16. 305

CHAPTER 3

[161] A. Grytczuk, F. Luca and M. Wójtowicz, On a conjecture of Makowski and Schinzel concerning the composition of the arithmetic functions σ and ϕ, Colloq. Math. 86(2000), no. 1, 31-36. [162] A. Grytczuk, F. Luca and M. Wójtowicz, Some results on σ (ϕ(n)), Indian J. Math. 43(2001), no. 3, 263-275. [163] A. Grytczuk and M. Wójtowicz, On a Lehmer problem concerning Euler’s totient function, Proc. Japan Acad. Ser. A Math. Sci. 79(2003), no. 8, 136-138. [164] N. G. Guderson, Some theorems on Euler’s ϕ function, Bull. Amer. Math. Soc. 49(1943), 278-280. [165] E. E. Guerin, A convolution related to Golomb’s root function, Pacific J. Math., 79(1978), 463-467. [166] W. J. Guerrier, The factorization of the cyclotomic polynomial (mod p), Amer. Math. Monthly 75(1968), 46. [167] R. Guitart, Fonctions d’Euler-Jordan et de Gauss et exponentielle dans les semi-anneaux de Burnside, Cahier de Topologie et Géometrie Diff. Catég. 33(1992), 256-260. [168] R. Guitart, Miroirs et Ambiguités, 70 p., multigraphié, Université Paris, 7 déc. 1987. [169] H. Gupta, A congruence property of Euler’s ϕ function, J. London Math. Soc. 39(1964), 303-306. [170] H. Gupta, On a problem of Erdös, Amer. Math. Monthly 57(1950), 326-329. [171] R. K. Guy, Unsolved problems in Number theory, Second ed., Springer-Verlag, 1994. ¨ [172] B. Gyires, Uber eine Verallgemeinerung des Smith’schen Determinantensatzes, Publ. Math. Debrecen 5(1957), 162-171. [173] P. Hagis, Jr., On the equation Mϕ(n) = n − 1, Nieuw Arch. Wiskunde (4)6(1988), no. 3, 255-261. [174] R. R. Hall and P. Shiu, The distribution of totatives, Canad. Math. Bull. 45(2002), no. 1, 109-114. [175] F. Halter-Koch and W. Steindl, Teilbarkeitseigenschaften der iterierten Euler’schen Phi-Funktion, Arch. Math. (Basel) 42(1984), 362-365. 306


[176] R. T. Hansen, Extension of the Euler-Fermat theorem, Bull. Number Theory Related Topics 2(1977), no. 2, 1-4, 20. [177] J. Hanumanthachari, Certain generalizations of Nagell’s totient function and Ramanujan’s sum, Math. Student 38(1970), no. 1,2,3,4; 183-187. [178] G. H. Hardy and J. E. Littlewood, Some problems in ”Partitio Numerorum”, III: On the expression of a number as a sum of primes, Acta Math. 44(1923), 1-70. [179] G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, 5th ed. Oxford, Clarendon Press, 1979. [180] K. Härtig and J. Surányi, Combinatorial and geometrical investigations in elementary number theory, Periodica Math. Hung. 6(1975), no. 3, 235-240. [181] P. Haukkanen, Higher-dimensional GCD matrices, Linear Algebra Appl. 170(1992), 53-63. [182] P. Haukkanen, Classical arithmetical identities involving a generalization of Ramanujan’s sum, Ann. Acad. Sci. Fenn. Ser. AI Math. Dissertationes 68(1988), 1-69. [183] P. Haukkanen, On meet matrices on posets, Linear Algebra Appl. 249(1996), 111-123. [184] P. Haukkanen, Some generalized totient functions, Math. Student 56 (1988), 65-74. [185] P. Haukkanen, Some limits involving Jordan’s function and the divisor function, Octogon Math. Mag. 3(1995), no. 2, 8-11. [186] P. Haukkanen, On an inequality related to the Legendre totient function, J. Ineq. Pure Appl. Math. 3(2002), no. 3, article 37, pp. 1-6 (electronic). [187] P. Haukkanen and J. Sillanpäa¨ , Some analogues of Smith’s determinant, Linear and Multilinear Algebra 41(1996), 233-244. [188] P. Haukkanen and J. Sillanpäa¨ , On some analogues of the Bourque-Ligh conjecture on lcm-matrices, Notes Number Theory Discr. Math. 3(1997), no. 1, 52-57. [189] P. Haukkanen and R. Sivaramakrishnan, Cauchy multiplication and periodic functions (mod r ), Collect. Math. 42(1991), no. 1, 33-44. 307

CHAPTER 3

[190] P. Haukkanen and R. Sivaramakrishnan, On certain trigonometric sums in several variables, Collect. Math. 45(1994), no. 3, 245-261. [191] P. Haukkanen and J. Wang, Euler’s totient function and Ramanujan’s sum in a poset-theoretic setting, Disc. Math. Algebra and Stoch. Meth. 17(1997), 7987. [192] P. Haukkanen, J. Wang and J. Sillanpäa¨ , On Smith’s determinant, Linear Algebra Appl. 258(1997), 251-269. [193] M. Hausman, The solution of a special arithmetic equation, Canad. Math. Bull. 25(1982), 114-117. [194] M. Hausman and H. N. Shapiro, Adding totitives, Math. Mag. 51(1978), no. 5, 284-288. [195] M. Hausman and H. N. Shapiro, On the mean square distribution of primitive roots of unity, Comm. Pure Appl. Math. 26(1973), 539-547. [196] E. Hecke, Vorslesungen u¨ ber die Theorie der algebraischen Zahlen, 2nd ed., Chelsea, New York, 1948. [197] K. Heinrich and P. Horak, Euler’s theorem, Amer. Math. Monthly 101(1994), no. 3, 260-261. [198] V. E. Hogatt and H. Edgar, Another proof that ϕ(Fn ) ≡ o (mod 4) for all n > 4, Fib. Quart. 18(1980), 80-82. [199] J. J. Holt, The minimal number of solutions to φ(n) = φ(n + k), Math. Comp. 72(2003), no. 244, 2059-2061 (electronic). [200] L. Holzer, Zahlentheorie, III, 1965 B. G. Teubner, Leipzig. [201] S. Hong, LCM matrix on an r-fold GCD-closed set, Sichuan Daxue Xuebao 33(1996), no. 6, 650-657. [202] S. Hong, gcd-closed sets and determinants of matrices associated with arithmetical functions, Acta Arith. 101(2002), no. 4, 321-332. [203] S. Hong, On the Bourque-Ligh conjecture of least common multiple matrices, J. Algebra 218(1999), 216-228. [204] C. Hooley, On the difference of consecutive numbers prime to n, Acta Arith. 8(1962/63), 343-347. 308


[205] D. E. Iannucci, D. Moujie and G. L. Cohen, On perfect totient numbers, J. Integer Seq. 6(2003), Article 03.4.5, 7 pp. (electronic). [206] M. Ismail and M. V. Subbarao, Unitary analogue of Carmichael’s problem, Indian J. Math. 18(1976), 49-55. [207] H. Iwata, On Bonse’s theorem, Math. Rep. Toyama Univ. 7(1984), 115-117. [208] H. Iwata, A certain property of the arithmetic functions σ ϕ and ϕσ (Japanese), Sûgaku 29(1977), 65-67. [209] E. Jacobson, Problem 6383, Amer. Math. Monthly 89(1982), 278, Solution in 90(1983), 650 same journal. ¨ [210] E. Jacobsthal, Uber Sequenzen ganzer Zahlen von denen keine zu n teilerfremd ist I-III, Norske Vid. Selsk. Forh. Trondheim 33(1960), 117-139. [211] H. Jager, The unitary analogues of some identities for certain arithmetical functions, Nederl. Akad. Wetensch. Proc. Ser. A 64(1961), 508-515. [212] W. Janous, Problem 6588, Amer. Math. Monthly 95(1988), 963; solution in the same journal by J. Herzog, K.-W. Lau, and the editors, 98(1991), 446-448. [213] K. R. Johnson, Unitary analogs of generalized Ramanujan sums, Pacific J. Math. 103(1982), no. 2, 429-432. [214] P. Jones, On the equation φ(x) + φ(k) = φ(x + k), Fib. Quart. 28(1990), no. 2, 162-165. [215] P. Jones, ϕ-partitions, Fib. Quart. 29(1991), no. 4, 347-350. [216] C. Jordan, Traité des substitutions et des e´ quations algébriques, Gauthier Villars et Cie Ed., Paris, 1957. [217] A. Junod, Congruences par l’analyse p-adique et le calcul symbolique, Thèse, Univ. de Neuchâtel, 2003. [218] M. Kaminski, Cyclotomic polynomials and units in cyclotomic number fields, J. Number Theory 28(1988), no. 3, 283-287. [219] I. Kátai, On the number of prime factors of ϕ(ϕ(n)), Acta Math. Hungar. 58(1991), 211-225. [220] I. Kátai, Distribution of ω(σ ( p + 1)), Ann. Univ. Sci. Budapest Sect. Comput. 34(1991), 217-225. 309

CHAPTER 3

[221] P. Kesava Menon, Some congruence properties of the φ-function, Proc. Indian Acad. Sci. A 24(1946), 443-447. [222] P. Kesava Menon, An extension of Euler’s function, Math. Student, 35(1967), 55-59. [223] R. B. Killgrove, Problem 964∗ , Crux Math. 10(1984), 217. [224] C. Kimberling, Problem E2581, Amer. Math. Monthly 83(1976), 197, Solution by P. L. Montgomery, 84(1977), 488. [225] M. Kishore, On the number of distinct prime factors of n for which φ(n)|n − 1, Nieuw Arch. Wiskunde (3)25(1977), 48-53. [226] D. Klarner, Problem P68, Canad. Math. Bull. 7(1964), 144. [227] V. Klee, Some remarks on Euler’s totient, Amer. Math. Monthly 54(1947), 332. [228] V. L. Klee, On a conjecture of Carmichael, Bull. Amer. Math. Soc. 53(1947), 1183-1186. [229] J. Knopfmacher, Abstract analytic number theory, North Holland, Amsterdam, 1975. [230] I. Korkee and P. Haukkanen, On meet and joint matrices associated with incidence functions, Linear Algebra Appl. 372(2003), 127-153. [231] A. Krieg, Counting modular matrices with specified maximum norm, Linear Algebra Appl. 196(1994), 273-278. [232] L. Kronecker, Mémoire sur les facteurs irreductibles de l’expression x n − 1, J. Math. Pures Appl. 19(1854), 177-192 (see also Werke, I(1895), 75-92). [233] L. Kronecker, Vorslesungen u¨ ber Zahlentheorie, I, 1901. [234] J. C. Lagarias, The set of rational cycles for the 3x + 1 problem, Acta Arith. 56(1990), 33-53. [235] M. Lal, Iterates of the unitary totient function, Math. Comp. 28(1974), no. 125, 301-302. [236] M. Lal and P. Gillard, On the equation φ(n) = φ(n + k), Math. Comp. 26(1972), 579-583. 310


[237] T. Y. Lam and K. H. Leung, On the cyclotomic polynomial pq (X ), Amer. Math. Monthly 103(1996), 562-564. ¨ [238] E. Landau, Uber die Irreduzibilität der Kreisteilungsgleichung, Math. Z. 29(1929), 462. [239] E. S. Langford, Solution of Problem E1749. Amer. Math. Monthly 73(1966), 84. [240] M. Laˇssˇa´ k and S. Porubský, Fermat-Euler theorem in algebraic number fields, J. Number Theory 60(1996), no. 2, 254-290. [241] K.-W. Lau, Editorial comment on Problem 6588, Amer. Math. Monthly 98(1991), 446-448. [242] W. G. Leavitt and A. A. Mullin, Primes differing by a fixed integer, Math. Comp. 37(1981), no. 2, 129-140. [243] V. A. Lebesgue, Démonstration de l’irréductibilité de l’équation aux racines primitives de l’unité, J. Math. Pures Appl. (2) 4(1859), 105-110. [244] D. N. Lehmer, On the congruences connected with certain magic squares, Trans. Amer. Math. Soc. 31(1929), no. 3, 529-551. [245] D. H. Lehmer, The distribution of totatives, Canad. J. Math. 7(1955), 347-357. [246] D. H. Lehmer, Some properties of the cyclotomic polynomial, J. Math. Anal. Appl. 15(1966), no. 1, 105-117. [247] D. H. Lehmer, On the converse of Fermat’s theorem II, American Math. Monthly 56(1949), no. 5, 300-309. [248] D. H. Lehmer, The p-dimensional analogue of Smith’s determinant, Amer. Math. Monthly 37(1930), 294-296. [249] D. H. Lehmer, On a conjecture of Krishnaswami, Bull. Amer. Math. Soc. 54(1948), 1185-1190. [250] D. H. Lehmer, On Euler’s totient function, Bull. Amer. Math. Soc. 38(1932), 745-751. [251] E. Lehmer, On the magnitude of the coefficients of the cyclotomic polynomial, Bull. Amer. Math. Soc. 44(1936), 389-392. 311

CHAPTER 3

[252] H. W. Leopoldt, Lösung einer Aufgabe von Kostrikhin, J. Reine Angew. Math. 221(1966), 160-161. [253] C. Leudesdorf, Some results in the elementary theory of numbers, Proc. London Math. Soc. 20(1889), 199-212. ¨ [254] F. Levi, Uber die Irreduzibilität der Kreisteilungsgleichung, Compos. Math. 1(1931), 303-304. [255] Z. Li, The determinants of GCD matrices, Linear Algebra Appl. 134(1990), 137-143. [256] E. Lieuwens, Do there exist composite numbers M for which kφ(M) = M − 1 holds? Nieuw Arch. Wiskunde (3)18(1970), 165-169. [257] S. Ligh and Ch. R. Wall, Functions of nonunitary divisors, Fib. Quart. 25(1987), no. 4, 333-338. [258] D. Lind, Solution of Problem 601, Math. Mag. 39(1966), no. 3, 190. [259] B. Lindström, Determinants on semilattices, Proc. Amer. Math. Soc. 20 (1969), 207-208. [260] S. Louboutin, Resultants of cyclotomic polynomials, Publ. Math. Debrecen 50(1997), no. 1-2, 75-77. [261] F. Luca, The solution to OQ130, Octogon Math. Mag. 7(1999), no. 2, 114-115. [262] F. Luca, On the equation ϕ(|x m − y m |) = 2n , Math. Bohem. 125(2000), 465479. [263] F. Luca, On the equation ϕ(x m − y m ) = x n + y n , Bull. Irish Math. Soc. 40(1998), 46-56. [264] F. Luca, On the equation ϕ(|x m + y m |) = |x n + y n |, Indian J. Pure Appl. Math. 30(1999), no. 2, 183-197. [265] F. Luca, Problem 10626, Amer. Math. Monthly 104(1997), no. 9, p. 871. [266] F. Luca, Pascal’s triangle and constructible polygons, Util. Math. 58(2000), 209-214. [267] F. Luca, Arithmetical functions of Fibonacci numbers, manuscript sent to J. Sándor, december 1999. 312


[268] F. Luca, Euler indicators of binary recurrence sequences, Collect. Math. 53(2002), no. 2, 133-156. [269] F. Luca, Euler indicators of Lucas sequences, Bull. Math. Soc. Sci. Math. Roumanie 40(88), 1997, no. 3-4, 151-163. [270] F. Luca and M. Kriˇzek, On the solutions of the congruence n 2 ≡ 1 (mod φ 2 (n)), Proc. Amer. Math. Soc. 129(2001), no. 8, 2191-2196. [271] F. Luca and C. Pomerance, On some conjectures of Makowski-Schinzel and Erdös concerning the arithmetical functions phi and sigma, Colloq. Math. 92(2002), no. 1, 111-130. [272] E. Lucas, Théorie des nombres, Tome I, Gauthier-Villars, Paris 1891; reprinting, Blanchard, Paris, 1961. [273] P. A. Mac Mahon, Applications of the theory of permutations in circular procession to the theory of numbers, Proc. London Math. Soc. 23(1891-2), 305313. [274] H. Maier, The coefficients of cyclotomic polynomials, Analytic Number Theory, Proc. Conf. in Honor of P. T. Bateman, Progr. Math. 85(1990), 349-366. [275] H. Maier, Cyclotomic polynomials with large coefficients, Acta Arith. 64(1993), 227-235. [276] H. Maier, The size of the coefficients of cyclotomic polynomials, Analytic Number Theory, Proc. Conf. in Honor of H. Halberstam, vol. 2, Birkhäuser, 1996, pp. 633-639. [277] H. Maier and C. Pomerance, On the number of distinct values of Euler’s ϕfunction, Acta Arith. XLIX(1988), 263-275. [278] E. Maillet, L’intermédiaire des Mathématiciens, 7(1900), 254. [279] A. Makowski, On the equation ϕ(n + k) = 2ϕ(n), Elem. Math. 29(1974), no. 1, 13. [280] A. Makowski, Remark on the Euler totient function, Math. Student 31(1963), 5-6. [281] A. Makowski, On the equation ϕ(x + m) = ϕ(x) + m, Mat. Vesnik 16(1964), no. 1, 247. 313

CHAPTER 3

[282] A. Makowski, On some equations involving functions ϕ(n) and σ (n), Amer. Math. Monthly 67(1960), 668-670. [283] A. Makowski and A. Schinzel, On the function ϕ(n) and σ (n), Colloq. Math. 13(1964), no. 1, 95-99. [284] D. Marcu, An arithmetic equation, J. Number Theory 31(1989), 363-366. [285] P. Masai and A. Valette, A lower bound for a counterexample to Carmichael’s conjecture, Boll. Un. Mat. Ital. A(6), 1(1982), 313-316. [286] I. Gy. Maurer and M. Veégh, Two demonstrations of a theorem by B. Gyires (Romanian), Studia Univ. Babes¸-Bolyai Ser. Math.-Phys. 10(1965), 7-11. [287] T. Maxsein, A note on a generalization of Euler’s phi-function, Indian J. Pure Appl. Math. 21(1990), no. 8, 691-694. [288] N. S. Mendelson, The equation ϕ(x) = k, Math. Mag. 49(1976), no. 1, 37-39. [289] A. Mercier, Solution of Problem E2985, Amer. Math. Monthly 93(1986), p. 570. [290] A. Migotti, Zur Theorie der Kreisteilungsgleichung, S.-B. der Math.-Naturmiss. Classe der Kaiserlichen Akad. Wiss., Wien (2) 87(1883), 7-14. [291] D. S. Mitrinović, J. Sándor (in coop. with B. Crstici), Handbook of number theory, Kluwer Acad. Publ., vol. 351, 1996, XXV + 622 pp. [292] A. L. Mohan and D. Suryanarayana, Perfect totient numbers, in: Number Theory (Proc. Third Matscience Conf., Mysore, 1981), Lect. Notes in Math. 938, Springer, New York, 1982, pp. 101-105. ¨ [293] H. Möller, Uber die Koeffizienten des n-ten Kreisteilungspolynoms, Math. Z. 119(1971), 33-40. [294] H. L. Montgomery and R. C. Vaughan, On the large sieve, Mathematica 20(1973), 119-134. [295] H. L. Montgomery and R. C. Vaughan, On the distribution of reduced residues, Ann. of Math. (2) 123(1986), 311-333. [296] H. L. Montgomery and R. C. Vaughan, The order of magnitude of the mth coefficients of cyclotomic polynomials, Glasgow Math. J. 27(1985), 143-159. 314


[297] P. Moree and H. Roskam, On an arithmetical function related to Euler’s totient and the discriminator, Fib. Quart. 33(1995), 332-340. [298] J. Morgado, Some remarks on two generalizations of Euler’s theorem, Portugaliae Math. 36(1977), 153-158. [299] J. Morgado, Unitary analogue of the Nagell totient function, Portug. Math. 21(1962), 221-232; Errata: 22(1963), 119. [300] J. Morgado, Some remarks on the unitary analogue of the Nagell totient function, Portug. Math. 22(1963), Fasc. 3, 127-135. [301] J. Morgado, Unitary analogue of a Schemmel’s function, Portug. Math. 22(1963), Fasc. 4, 215-233. [302] L. Moser, Some equations involving Euler’s totient function, Amer. Math. Monthly 56(1949), 22-23. [303] L. Moser, Solution to Problem P42 by L. Moser, Canad. Math. Bull. 5(1962), 312-313. [304] K. Motose, On values of cyclotomic polynomials, Math. J. Okayama Univ. 35(1993), 35-40. [305] A. Murányi, On a number theoretic function obtained by the iteration of Euler’s ϕ-function (Hungarian), Mat. Lapok, Budapest, 11(1960), 46-67. [306] T. Nagell, Introduction to number theory, Chelsea Publ. Comp. 1964. [307] T. Nagell, Verallgemeinerung eines Satzes von Schemmel, Skr. Norske Vod.Akad. Oslo, Math. Class, I, No. 13(1923), 23-25. [308] K. Nageswara Rao, A generalization of Smith’s determinant, Math. Stud. 43(1975), 354-356. [309] K. Nageswara Rao, On extensions of Euler’s ϕ function, Math. Student 29(1961), no. 3, 4, 121-126. [310] K. Nageswara Rao, A note on an extension of Euler’s function, Math. Student 29(1961), no. 1,2 33-35. [311] A. Nalli, An inequality for the determinant of the GCD-reciprocal LCM matrix and the GCUD-reciprocal LCUM matrix, Int. Math. J. 4(2003), no. 1, 1-6. 315

CHAPTER 3

[312] V. C. Nanda, Generalizations of Ramanujan’s sum to matrices, J. Indian Math. Soc. (N.S.) 48(1984), no. 1-4, 177-187 (1986). [313] V. C. Nanda, On arithmetical functions of integer matrices, J. Indian Math. Soc. 55(1990), 175-188. [314] W. Narkiewicz, Elementary and analytic theory of algebraic numbers, PWN, Warsawa, 1974. [315] W. Narkiewicz, On distribution of values of multiplicative functions in residue classes, Acta Arith. 12(1966/67), 269-279. [316] W. Narkiewicz, Uniform distribution of sequences of integers in residue classes, Lecture Notes Math. 1087, Springer, Berlin, 1984. [317] D. J. Newman, Euler’s ϕ function on arithmetic progressions, Amer. Math. Monthly 104(1997), no. 3, 256-257. [318] C. A. Nicol, Problem E2611, Amer. Math. Monthly 83(1976), 656, Solution by P. Vojta, 85(1978), 199, same journal. [319] C. A. Nicol, Some diophantine equations involving arithmetic functions, J. Math. Anal. Appl. 15(1966), 154-161. [320] C. A. Nicol, Problem E2590, Amer. Math. Monthly 83(1976), 284, solution by L. L. Foster, same journal 84(1977), 654. [321] N. Nielsen, Note sur les polynomes parfaits, Nieuw Arch. Wiskunde 10(1913), 100-106. [322] I. Niven, The iteration of certain arithmetic functions, Canad J. Math. 2(1950), no. 4, 406-408. [323] I. Niven and H. S. Zuckerman, An introduction to the theory of numbers (third ed.), John Wiley and Sons Inc., New York (Hungarian translation Budapest, 1978). [324] W. G. Nowak, On Euler’s ϕ-function in quadratic number fields, Théorie des nombres, J.-M. de Koninck and C. Levesque (ed.), Walter de Gruyter 1989, pp. 755-771. [325] Gy. Oláh, Generalizations of the determinant of Smith (Hungarian), Mat. Lapok (Budapest) 12(1961), 174-189. [326] A. Oppenheim, Problem 5591, Amer. Math. Monthly 75(1968), 552. 316


[327] L. Panaitopol, On some properties concerning the function a(n) = n − ϕ(n), Bull. Greek Math. Soc. 45(2001), 71-77. [328] L. Panaitopol, Asymptotical formula for a(n) = n − ϕ(n), Bull. Math. Soc. Sci. Math. Roumanie 42(90)(1999), no. 3, 271-277. ¨ [329] H. Petersson, Uber eine Zerlegung des Kresteilungspolynom, Math. Nachr. 14(1955), 361-375. [330] S. S. Pillai, On an arithmetic function, J. Annamalai Univ. 2(1933), 243-248. [331] S. S. Pillai, On some functions connected with ϕ(n), Bull. Amer. Math. Soc. 35(1929), 832-836. [332] G. Pólya and G. Szegö, Problems and theorems in analysis, II, Springer Verlag, Berlin, 1976. [333] C. Pomerance, On composite n for which ϕ(n)|n − 1, Acta Arithm. 28(1976), 387-389. [334] C. Pomerance, On composite n for which ϕ(n)|n − 1, II, Pacific J. Math. 69(1977), no. 1, 177-186. [335] C. Pomerance, On the congruences σ (n) ≡ a (mod n) and n ≡ a (mod ϕ(n)), Acta Arith. 26(1975), 265-272. [336] C. Pomerance, Popular values of Euler’s function, Mathematica 27 (1980), 84-89. [337] C. Pomerance, On the composition of the arithmetic functions σ and ϕ, Colloq. Math. 58(1989), 11-15. [338] S. Porubský, On Smarandache’s form of the individual Fermat Euler theorem, Smarandache Notions J. 8(1997), no. 1-2-3, pp. 5-20. [339] S. Porubský, On the probability that k generalized integers are relatively Hprime, Colloq. Math. 45(1981), no. 1, 91-99. [340] C. Powell, On the uniqueness of reduced phi-partitions, Fib. Quart. 34(1996), no. 3, 194-199. ¨ [341] D. Pumplün, Uber Zerlegungen des Kresitelungspolynoms, J. Reine Angew. Math. 213(1963), 200-220. 317

CHAPTER 3

[342] B. V. Rajarama Bhat, On greatest common divisor matrices and their applications, Linear Algebra Appl. 158(1991), 77-97. [343] W. A. Ramadan-Jradi, Carmichael’s conjecture and a minimal unique solution, Notes Number Th. Discrete Math. 5(1999), no. 2, 55-70. [344] K. G. Ramanathan, Some applications of Ramanujan’s trigonometric sum c M (N ), Proc. Ind. Acad. Sci. 20(1944), Section A, pp. 62-69. [345] M. Rama Rao, An extension of Leudesdorf theorem, J. London Math. Soc. 12(1937), 247-250. [346] M. Ram Murthy and V. Kumar Murthy, Analogue of the Erdös-Kac theorem for Fourier coefficients of modular forms, Indian J. Pure Appl. Math. 15(1984), 1090-1101. [347] R. M. Redheffer, Problem 6086, Amer. Math. Monthly 83(1976), 292; solution by G. Kennedy, same journal 85(1978), p. 54. [348] D. Redmond, Infinite products and Fibonacci numbers, Fib. Quart. 32(1994), no. 3, 234-239. [349] P. Ribenboim, The new book of prime number records, Springer Verlag, New York, 1995. [350] P. Ribenboim, Existe-t-il des fonctions qui engendrent les nombres premiers?, S. T. N. T. 39/47, pp. 9-20, Queen’s University, Kingston, Ontario, Canada. [351] B. Richter, Eine Abschätzung der Werte der Kreisteilungspolynome für reelles Argument I, J. Reine Angew. Math. 267(1974), 74-76. [352] R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key crystosystems, Comm. ACM 21(1978), 120-126. [353] B. Rizzi, On some functional properties of the Stevens totient (Italian), Rend. Mat. Ser. VII, 12(1992), 273-284. [354] G. Robin, Sur l’ordre maximal de la fonction somme des diviseurs, Seminar on Number Theory, Paris, 1981-1982, 233-244 (1983). [355] G. de Rocquigny, L’intermédiaire des Mathématiciens, 6(1899), 243, Question No. 1656. [356] A. Rotkiewicz, On the numbers ϕ(a n ± bn ), Proc. Amer. Math. Soc. 12(1961), 419-421. 318


[357] D. Rusin, http://www.math.niu.edu/∼rusin/known-math/196/numtheor.series [358] M. Ruthinger, Die Irreduzibilitätsbeweise der Kreisteilungsgleichung, Diss. Strassburg, 1907. [359] I. Z. Ruzsa, Arithmetical functions I (Hungarian), Mat. Lapok, Budapest, 27(1976-1979), no. 1-2, 95-145. [360] I. Z. Ruzsa and A. Schinzel, An application of Kloosterman sums, Compos. Math. 96(1995), no. 3, 323-330. ˇ at and O. Strauch, Problem 6090, Amer. Math. Monthly 83(1976), 385, [361] T. Sal´ Solution by P. Erdös, in 85(1978), 122-123. ¨ [362] J. Sándor, Uber die Folge der Primzahlen, Mathematica, Cluj, 30 (53) (1988), no. 1, 67-74. [363] J. Sándor, Geometric theorems, diophantine equations, and arithmetic functions, American Research Press, Rehoboth 2002, IV + 298 pp. [364] J. Sándor, On a divisibility problem (Hungarian), Mat. Lapok, Cluj, 1/1981, pp. 4-5. [365] J. Sándor, On certain generalizations of the Smarandache function, Smarandache Notions J. 11(2000), no. 1-3, 202-212. [366] J. Sándor, On the Euler minimum and maximum functions (to appear). [367] J. Sándor, On a diophantine equation involving Euler’s totient function, Octogon Math. Mag. 6(1998), no. 2, 154-157. [368] J. Sándor, On the equation ϕ(x + k) = 3ϕ(x), unpublished notes, 1986. [369] J. Sándor, On Dedekind’s arithmetical function, Seminarul de teoria structurilor, no. 51, 1988, pp. 1-15, Univ. of Timis¸oara. [370] J. Sándor, An application of the Jensen-Hadamard inequality, Nieuw Arch. Wiskunde, Serie 4, 8(1990), no. 1, 63-66. [371] J. Sándor, On the equation σ (n) = ϕ(n)d(n) (to appear). [372] J. Sándor, On certain inequalities for arithmetic functions, Notes Number Th. Discr. Math. 1(1995), 27-32. 319

CHAPTER 3

[373] J. Sándor, An inequality of Klamkin with arithmetical applications, Intern. J. Math. Ed. Sci. Techn., 25(1994), 157-158. [374] J. Sándor, On Euler’s arithmetical function, Proc. Alg. Conf. Bras¸ov 1988, 121-125. [375] J. Sándor, Remarks on the functions ϕ(n) and σ (n), Babes¸-Bolyai Univ., Seminar on Math. Anal., Preprint 7, 1989, 7-12. [376] J. Sándor, A note on the functions σk (n) and ϕk (n), Studia Univ. Babes¸-Bolyai, Math. 35(1990), no. 2, 3-6. [377] J. Sándor, On the composition of some arithmetic functions, Studia Univ. Babes¸-Bolyai 34(1989), 7-14. [378] J. Sándor, On the difference of alternate compositions of arithmetic functions, Octogon Math. Mag. 8(2000), no. 2, 519-522. [379] J. Sándor, Some arithmetic inequalities, Bull. Number Th. Rel. Topics 11(1987), 149-161. [380] J. Sándor, On an exponential totient function, Studia Univ. Babes¸-Bolyai Math. 41(1996), 91-94. [381] J. Sándor and L. Kovács, On certain arithmetical problems and conjectures (to appear). ¨ [382] J. Sándor and A.-V. Krámer, Uber eine Zahlentheoretische Funktion, Math. Moravica 3(1999), 53-62. [383] J. Sándor and R. Sivaramakrishnan, The many facets of Euler’s totient, III: An assortment of miscellaneous topics, Nieuw Arch. Wiskunde 11(1993), 97-130. [384] J. Sándor and L. Tóth, On some arithmetical products, Publ. Centre Rech. Math. Pures, Neuchâtel, Série I, 20, 1990, pp. 5-8 (see also by the same authors: A remark on the gamma function, Elem. Math. 44(1989), 73-76). [385] J. Sándor and L. Tóth, On certain number-theoretic inequalities, Fib. Quart. 28(1990), 255-258. [386] J. Sándor and L. Tóth, On some arithmetical products, Publ. Centre Rech. Math. Pures (Neuchâtel), Sér. I, 20, 1990, pp. 5-8. [387] Y. Sankaran, On the average order of an arithmetical function L(n), Math. Student 35(1967), 61-63 (1969). 320


[388] B. R. Santos, Twelve and its totitives, Math. Mag. 49(1976), 239-240. [389] A. Sato, Rational points on quadratic twists of an elliptic curve, www.math.tohoku.ac.jp/∼atsushi/Article/cong.pdf [390] U. V. Satyanarayana and K. Pattabhiramasastry, A note on the generalized ϕfunctions, Math. Student 33(1965), no. 2,3 81-83. ¨ [391] V. Schemmel, Uber relative Primzahlen, J. Reine Angew. Math. 70 (1869), 191-192. [392] A. Schinzel, Sur l’équation ϕ(x) = m, Elem. Math. 11(1956), 75-78. [393] A. Schinzel, Sur une problème concernant la fonction ϕ, Czechoslovak Math. J. 6(1956), 164-165. [394] A. Schinzel, Sur l’équation ϕ(x + k) = ϕ(x), Acta Arith. 4(1958), 181-184. [395] A. Schinzel and W. Sierpinski, Sur certaines hypothèses concernant les nombres premiers, Acta Arith. 4(1958), 185-208; erratum 5(1959), 259. [396] A. Schinzel and A. Wakulicz, Sur l’équation φ(x + k) = φ(x), II, Acta Arith. 5(1959), 425-426. [397] A. Schlafly and S. Wagon, Carmichael’s conjecture on the Euler function is valid below 1010000000 , Math. Comp. 63(1994), no. 207, 415-419. [398] I. J. Schoenberg, The integrability of certain functions and related summability methods, Amer. Math. Monthly 66(1959), 361-375. [399] F. Schuh, Do there exist composite numbers m for which φ(m)|m −1? (Dutch), Mathematica Zutpen B13(1944), 102-107. ¨ [400] J. Schulte, Uber die Jordansche Verallgemeinerung der Eulerschen Funktion, www.math.uni-siegen.de/mathe1/rdm.pdf ¨ [401] I. Schur, Uber die Irreduzibilität der Kreisteilungsgleichung, Math. Z. 29(1929), 463. [402] E. D. Schwab, On the summation function of an arithmetic function (Romanian), Gazeta Mat., Bucures¸ti, 94(1989), 321-325. [403] S. Schwarz, The role of semigroups in the elementary theory of numbers, Math. Slovaca 31(1981), 369-395. 321

CHAPTER 3

[404] S. Schwarz, An elementary semigroup theorem and a congruence relation of Rédei, Acta Sci. Math. Szeged 19(1958), 1-4. [405] W. Schwarz, Ramanujan expansions of arithmetic functions, Ramanujan revisited (Urbana-Champaign, Ill. 1987), 187-214, Academic Press, 1988. [406] J. L. Selfridge, Solution to a problem by Ore, Amer. Math. Monthly 70(1963), 101. [407] I. Seres, On the irreducibility of certain polynomials in cyclotomic fields (Hungarian), Magyar Tud. Akad. Mat. Fiz. Ont. Közl. 10(1960), 341-351. [408] S. A. Sergusov, On the problem of prime-twins (Russian), Jaroslav. Gos. Ped. Inst. Uˇcen. Zap. Vyp, 82, Anal. i Algebra, 1971, pp. 85-86. [409] R. E. Shafer, Problem 6160, Amer. Math. Monthly 84(1977), 491; Solution by A. Makowski, 86(1979), 598, same journal. [410] Shan Zun, On composite n for which ϕ(n)|(n − 1), J. China Univ. Sci. Tech. 15(1985), 109-112. [411] H. N. Shapiro, On the iterates of certain class of arithmetic functions, Comm. Pure Applied Math. 3(1950), 259-272. [412] T. Shonhiwa, A generalization of the Euler and Jordan totient functions, Fib. Quart. 37(1999), 67-76. [413] T. N. Shorey and C. L. Stewart, On divisors of Fermat, Fibonacci, Lucas and Lehmer numbers, II, J. London Math. Soc. (2) 23(1981), no. 1, 17-23. [414] W. Sierpinski, Elementary theory of numbers, Warszawa, 1964. [415] W. Sierpinski, Sur une propriété de la fonction φ(n), Publ. Math. Debrecen 4(1956), 184-185. [416] D. L. Silverman, Problem 1040, J. Recr. Math. 14(1982), Solution 15(1983) by R. I. Hess. [417] J. H. Silverman, Exceptional units and numbers of small Mahler measure, Expo. Math. 4(1995), no. 1, 69-83. [418] S. Singh, On a Hogatt-Bergum paper with totient function approach for divisibility and congruence relations, Fib. Quart. 28(1990), no. 3, 273-276. 322


[419] D. Singmaster, A maximal generalization of Fermat’s theorem, Math. Mag. 39(1966), no. 2, 103-107. [420] R. Sivaramakrishnan, On three extensions of Pillai’s arithmetic function β(n), Math. Student 39(1971), 187-190. [421] R. Sivaramakrishnan, The many facets of Euler’s totient II: Generalizations and analogues, Nieuw Arch. Wiskunde 8(1990), 169-187. [422] R. Sivaramakrishnan, Square-reduced residue systems (mod n) and related arithmetical functions, Canad. Math. Bull. 22(1979), 207-220. [423] V. Siva Rama Prasad and Ph. Fonseca, The solutions of a class of arithmetic equations, Math. Student 56(1988), no. 1-4, pp. 149-157. [424] V. Siva Rama Prasad and M. Rangamma, On the forms of n for which ϕ(n)|n − 1, Indian J. Pure Appl. Math. 20(1989), no. 9, 871-873. [425] A. Sivaramasarma, On (x, n) = ϕ(x, n) − xϕ(n)/n, Math. Stud. 46(1978), 160-164. [426] T. Skolem, A proof of the irreducibility of the cyclotomic equation, Norsk. Mat. Tidsskr. 31(1949), 116-120. [427] I. Sh. Slavutskii, Leudesdorf’s theorem and Bernoulli numbers, Arch. Math. (Brno) 35(1999), 299-303. [428] I. Sh. Slavutskii, Partial sums of the harmonic series, p-adic L-functions and Bernoulli numbers, Tatra Mt. Math. Publ. 20(2000), 11-17. [429] N. J. A. Sloane, On-line encyclopedia of integer sequences, http://www.research/att.com/∼njas/sequences/seis.html [430] F. Smarandache, Une généralisation du théorème d’Euler, Bul. Univ. Bras¸ov, Ser. C23(1981), 7-12 (see also: Collected papers, vol. I, Ed. Soc. Tempus, Bucures¸ti, 1996, pp. 184-191). [431] F. Smarandache, Problem 324, College Math. J., 17(1986), Solution by B. Spearman, 19(1988), 187. [432] H. J. S. Smith, On the value of a certain arithmetical determinant, Proc. London Math. Soc. 7(1875/76), 208-212. [433] N. P. Sokolov, On some multidimensional determinants with integral elements (Russian), Ukrain Mat. Zh. 16(1964), 126-132. 323

CHAPTER 3

[434] V. N. Sorokin, Linear independence of logarithms of some rational numbers (Russian), Mat. Zametki 46(1989), no. 3, 74-79, 127; translation in Math. Notes 46(1989), no. 3-4, 727-730. ¨ [435] H. Späth, Uber die Irreduzibilität der Kreisteilungsgleichung, Math. Z. 26 (1927), 442-444. [436] K. Spyropoulos, Euler’s equation ϕ(x) = k with no solution, J. Number Theory 32(1989), 254-256. [437] B. R. Srinivasan, An arithmetical function and an associated formula for the nth prime, II, Norske Vid. Selsk. Forh., Trondheim, 35(1962), 72-75. [438] A. H. Stein, Problem E3398, Amer. Math. Monthly 99(1990), p. 611; solution by T. Honold and H. Kiechle, same journal 101(1992), pp. 71-72. [439] W. Steindl, Bemerkungen zur iterierten Euler’schen Phi-Funktion, Dissertation, Graz, 1978. [440] H. Stevens, Generalizations of the Euler ϕ-function, Duke Math. J. 38(1971), 181-186. [441] K. B. Stolarsky and S. Greenbaum, A ratio associated with ϕ(x) = n, Fib. Quart. 23(1985), 265-269. [442] S. P. Strunkov, A generalization of Fermat’s little theorem (Russian), Izv. Akad. Nauk SSSR Ser. Mat. 55(1991), no. 1, 203-205; translation in Math. USSR - Izv. 38(1992), no. 1, 199-201. [443] M. V. Subbarao, On two congruences for primality, Pacific J. Math. 52(1974), no. 1, 261-268. [444] M. V. Subbarao and R. Sitaramachandrarao, The distribution of values of a class of arithmetic functions, Studia Sci. Math. Hungar. 20(1985), 77-87. [445] M. V. Subbarao and V. Siva Rama Prasad, Some analogues of a Lehmer problem on the totient function, Rocky Mountain J. Math. 15(1985), no. 2, 609-620. [446] M. V. Subbarao and V. V. Subrahmanya Sastri, On an extension of Nagell’s totient function and some applications, Ars. Combin. 62(2002), 79-96. [447] M. V. Subbarao and L.-W. Yip, On Sierpinski’s conjecture concerning the Euler totient, Canad. Math. Bull. 34(1991), no. 3, 401-404. 324


[448] D. Suryanarayana, On (x, n) = ϕ(x, n) − xϕ(n)/n, Proc. Amer. Math. Soc. 44(1974), no. 1, 17-21. [449] D. Suryanarayana, A generalization of Dedekind’s ψ-function, Math. Student 37(1969), no. 1,2,3,4; 81-86. [450] J. Suzuki, On coefficients of cyclotomic polynomials, Proc. Japan Acad. Ser. A Math. Sci. 63(1987), no. 7, 279-280. [451] T. Szele, Une généralization de la congruence de Fermat, Mat. Tidsskrift B., 1948, 57-59. [452] A. Takashi, K. Dilcher and L. Skula, Fermat’s quotients for composite moduli, J. Number Theory 66(1997), no. 1, 29-50. [453] R. Tijdeman, On integers with many small prime factors, Compositio Math. 26(1973), 319-330. [454] L. Tóth, On a property of Euler’s arithmetical function (Hungarian), Mat. Lapok, Cluj, 4/1988, pp. 147-150. [455] L. Tóth, A generalization of Pillai’s arithmetical function involving regular convolutions, Acta Math. Inf. Univ. Ostraviensis 6(1998), 203-217. [456] L. Tóth, The unitary analogue of Pillai’s arithmetical function, Collect. Math. 40(1989), 19-30; part II in Notes Number Th. Discr. Math. 2(1996), 40-46. [457] L. Tóth, A note on a generalization of Euler’s totient, Fib. Quart. 25(1987), 241-244. [458] L. Tóth and P. Haukkanen, A generalization of Euler’s ϕ-function with respect to a set of polynomials, Ann. Univ. Sci. Budapest 39(1996), 69-83. [459] L. Tóth and P. Haukkanen, On an operator involving regular convolutions, Mathematica (Cluj), 42(65)(2000), no. 2, 199-209. [460] L. Tóth and J. Sándor, An asymptotic formula concerning a generalized Euler function, Fib. Quart. 27(1989), 176-180. [461] D. B. Tyler, Editorial comment to Problem E3215, Amer. Math. Monthly 95(1989), 64. [462] R. Vaidyanathaswamy, The theory of multiplicative arithmetical functions, Trans. Amer. Math. Soc. 33(1931), 579-662. 325

CHAPTER 3

[463] E. Vantieghem, On a congruence only holding for primes, Indag. Math. N.S. 2(1991), no. 2, 253-255. [464] M. Vassilev, Three formulae for n-th prime and six for n-th term of twin primes, Notes Numb. Theory Discr. Math. 7(2001), no. 1, 15-20. [465] R. C. Vaughan, Some applications of Montgomery’s sieve, J. Number Theory 5(1973), 64-79. [466] R. C. Vaughan, Bounds for the coefficients of cyclotomic polynomials, Michigan Math. J. 21(1975), 289-295. [467] A. C. Vasu, A note on an extension of Klee’s ψ-functions, Math. Student 40(1972), 36-39. [468] C. S. Venkataraman, Math. Student 19(1951), 127-128. [469] T. Venkataraman, Perfect totient number, Math. Student 63(1975), 178. [470] A. Verjovsky, Discrete measures and the Riemann hypothesis, Kodai Math. J. 17(1994), no. 3, 596-608. [471] C. R. Wall, Analogs of Smith’s determinant, Fib. Quart. 25(1987), 343-345. [472] D. W. Wall, Conditions for φ(N ) to properly divide N − 1, in: A collection of manuscripts related to the Fibonacci sequence (Ed. V. E. Hogatt and M. V. E. Bicknell-Johnson), San Jose, CA, Fib. Association, pp. 205-208, 1980. [473] R. Wang, Congruence properties of Euler’s function ϕ(n) (Chinese), J. Math. Res. Exposition 22(2002), no. 3, 476-480. [474] H. Wang, Z. Hu and L. Gao, On the distribution of D. H. Lehmer number in the primitive roots modulo q (Chinese), Pure Appl. Math. 12(1996), no. 2, 84-88. [475] L. Weisner, Quadratic fields over which cyclotomic polynomials are reducible, Ann. Math. 29(1928), 377-381. [476] L. Weisner, Polynomials f (ϕ(x)) reducible in fields in which f (x) is reducible, Bull. Amer. Math. Soc. 34(1928). [477] L. Weisner, Some properties of prime-power groups, Trans. Amer. Math. Soc. 38(1935), 485-492. [478] E. Weisstein, http://mathworld.wolfram.com/CyclotomicPolinomial.html 326


[479] H. Wegman, Beiträge zur Zahlentheorie auf freien Halbgruppen, I, J. Reine Angew. Math. 221(1966), 20-43. ´ Eyrolles, 1998, [480] D. Wells, Dictionnaire Penguin des Nombres Curieux, Ed. Paris (The French ed. of ”The Penguin Dictionary of Curios and Interesting Numbers”, Penguin Books, 1997). [481] J. Westlund, Proc. Indiana Acad. Sci. 1902, 78-79, see also [103]. [482] H. S. Wilf, Hadamard determinants, Möbius functions, and the chromatic number of a graph, Bull. Amer. Math. Soc. 74(1968), 960-964. [483] J. Wolstenholme, On certain properties of prime numbers, Quart. J. Math. 5(1862), 35-39. [484] K. R. Wooldridge, Values taken many times by Euler’s phi-function, Proc. Amer. Math. Soc. 76(1979), 229-234. [485] M. Yorinaga, Numerical investigation of some equations involving Euler’s φfunction, Math. J. Okayama Univ. 20(1978), no. 1, 51-58. [486] M. Zhang, On a divisibility problem (Chinese) (English summary), J. Sichuan Univ., Nat. Sci. Ed. 32(1995), no. 3, 240-242. [487] M. Zhang, On the equation ϕ(x) = ϕ(y) (Chinese), J. Sichuan Univ., Nat. Sci. Ed. 32(1995), no. 6, 628-631. [488] M. Zhang, On a nontotients, J. Number Theory 43(1993), 168-172. [489] W. Zhang, On a problem of D. H. Lehmer and its generalization, Compos. Math. 86(1993), no. 3, 307-316. [490] W. Zhang, On a problem of D. H. Lehmer and its generalization (Chinese), J. Northwest Univ., Nat. Sci. 23(1993), no. 2, 103-108. [491] W. Zhang, On the distribution of inverses modulo n, J. Number Theory 61(1996), no. 2, 301-310. [492] W. Zhang, On the difference between an integer and its inverse modulo n, J. Number Theory 52(1995), no. 1, 1-6. [493] Z. Zheng, On generalized D. H. Lehmer’s problem, Adv. Math., Beijing 22(1993), no. 2, 164-165. [494] Z. Zheng, On generalized D. H. Lehmer’s problem, Chin. Sci. Bull. 38(1993), no. 16, 1340-1345.

327

Chapter 4

SPECIAL ARITHMETIC FUNCTIONS CONNECTED WITH THE DIVISORS, OR WITH THE DIGITS OF A NUMBER

4.1

Introduction

There are many particular arithmetic functions, numbers or sequences connected with some important notions or results which appear in Number theory, and in fact all Mathematics. Some of them are non standard functions (such as d, σ, ϕ, µ, ω, , p, P etc.), and were studied in [260] or in former chapters of this book. The aim of this chapter is the study of some other functions which at one part are not so well-known, and are scattered in various fields of study, or at another part have not been previously included. The former one includes arithmetic functions connected to the prime factorization of a number, or the consecutive divisors (prime or not). The functions related to the digits of a number written e.g. in a decimal (or binary) scale constitute also an important field of study, with many applications. The divisors and the digits of a number have a strong connection, it is sufficient to only mention the congruence property n ≡ s(n) (mod 9), where s(n) denotes the sumof-digits of n in decimal representation of n. 329

CHAPTER 4

4.2 1

Special arithmetic functions connected with the divisors of a number Maximum and minimum exponents

Let n = p1a1 . . . prar > 1 be the prime factorization of n, and put H (n) = max{a1 , . . . , ar },

h(n) = min{a1 , . . . , ar }

(1)

and H (1) = h(1) = 1. These functions (called as the maximum and minimum exponents in factoring) occured also in Chapter III, when extending the Euler divisibility theorem. In 1969 I. Niven [265] proved that H (n) = c0 x + R H (x) (2) n≤x ∞ where c0 = 1 + (1 − ζ (k)−1 ), and R H (x) = o(x) and that k=2

h(n) = x + Rh (x)

(3)

n≤x

√ √ where Rh (x) = c x + o( x), with c = ζ (3/2)/ζ (3) (where ζ is the Riemann zeta function) conjectured previously by P. Erdös (see [265]). We note here that the generating functions of max{n 1 , . . . , n k } and min{n 1 , . . . , n k } (where a1 , . . . , ak are arbitrarily nonnegative integers) are deduced by L. Carlitz [52]. For example ∞ n 1 ,...,n k =0

min{n 1 , . . . , n k }x1n 1 . . . xkn k =

x1 x2 . . . xk (1 − x1 ) . . . (1 − xk )(1 − x1 . . . xk )

(4)

D. Suryanarayana and R. Sitaramachandra Rao [322] improved Niven’s results to

and

R H (x) = O(x 1/2 exp(−c(log x)3/5 (log log x)−1/5 ))

(5)

√ √ √ √ Rh (x) = c x + c1 3 x + c2 4 x + c3 5 x +O(x 1/6 )

(6)

A(x)

where c > 0 and c1 , c2 , c3 are constants. H. Cao [49] rediscovered (5), and a weaker form of (6). In another paper [50] he improved the exponent 3/5 to 3/5 − ε. In [163] T. Gu and H. Cao assert without proof that Rh (x) = A(x) + C4 x 1/6 + O(x 1/6 exp(−D(log x)4/7 (log log x)−3/7 ) 330

(7)

SPECIAL ARITHMETIC FUNCTIONS

but, according to A. Ivić [191] this was formerly established. These results can be further improved by using the strongest known form for the asymptotic formula on the number of squarefull integers not exceeding x. ˇ Porubský [278] has extended (2) and a By applying the ideas used by Niven, S. weaker form of (3), to arithmetical semigroups (see e.g. Section 2.5 of Chapter II). For example, if G is an arithmetical semigroup with δ-regular G(x) (where G(x) = 1), then n∈G,|n|≤x

1 h G (m) = 1 x→∞ G(x) |m|≤x,m∈G lim

(8)

where h G (m) = min{a1 , . . . , ar }, when m = p1a1 . . . prar ∈ G is the unique factorization of m into a product of generators. Let f : N → N and put M f = {n = 1, 2, · · · : f (n)|n}, i.e. the set of positive integers n such that f (n) divides n. The asymptotic density of the set M f is well known for some special functions, including d(n), ω(n), (n). In 1994 A. Schinzel ˇ at [301] have proved that and T. Sal´ d(Mh ) = 1,

(9)

and

∞ p α−or d p α+1 − 1 1 1 1 p α−or d p α − 1 d(M H ) = + − ζ (2) α=2 ζ (α + 1) p|α p α+1 − 1 ζ (α) p|α pα − 1 (10) where or d p α denotes the exponent of the prime p in the canonical representation of A(x) denotes the asymptotic density of the set A. α. Here d(A) = lim x→∞ x They proved also that the sequences (xn ) and (yn ), given by

H (n) h(n) , yn = (n = 2, 3, . . . ) (11) log n log n

1 are dense in the interval 0, . log 2 In 1951 H. Fast [121] defined the concept of statistical convergence. A sequence of real numbers (an )n≥1 is said to converge statistically to a ∈ R, denoted by limstat an = a, provided that for each ε > 0 we have xn =

d(Aε ) = 0, where Aε = {n : |an − a| ≥ ε}. 331

(12)

CHAPTER 4

There exists today a vast literature on statistical convergence of sequences, see e.g. J. Fridy [132], J. Fridy and C. Orhan [134], J. Connor [57], J. A. Fridy, M. I. ˇ at [301] prove that Miller and C. Orhan [133]. Schinzel and Sal´ limstat

H (n) h(n) = limstat =0 log n log n

(13)

It is interesting to note that there is a strong connection between the concepts of normal order of an arithmetic function and statistical convergence. Let f, F : N → R be two arithmetic functions. Then F is a normal order of f if and only if limstat

f (n) =1 F(n)

(14)

Indeed, suppose F is a normal order of f . If 0 < ε < 1, then there is a set Bε ⊂ N such that d(Bε ) = 1, F(n) > 0 for n ∈ Bε and (1 − ε)F(n) < f (n) < (1 + ε)F(n). From this we obtain f (n) F(n) − 1 < ε, n ∈ Bε . f (n) − 1 ≥ ε holds at most for all n ∈ N \ Bε = Therefore the inequality F(n) Aε , where d(Aε ) = 0. Thus (14) holds. Conversely, if (14) holds, then it follows immediately that (1 − ε)Fn < f (n) < (1 + ε)F(n) for almost all n ∈ N (see e.g. G. H. Hardy and E. M. Wright [177]). Clearly, the constant function F(n) = 1 (n ∈ N) is a normal order of h. (15) ˇ at [301] prove that H cannot have any non-decreasing normal Schinzel and Sal´ order, i.e. if F is any non-decreasing function on N, then F os not a normal order of H . (16)

2

The product of exponents Now, similarly to (1) define β(n) = a1 a2 . . . ar ,

β(1) = 1

In 1947 D. G. Kendall and R. A. Rankin [213] showed that 1 ζ (2)ζ (3) = 1.943 . . . β(n) = lim x→∞ x ζ (6) n≤x

(17)

(18)

In 1973 J. Knopfmacher [223] proved that for all ε > 0, 1

β(n) < e 3 (1+ε) log log n for almost all n (i.e. excepting a set of density zero). 332

(19)


In fact, the Dirichlet series of β(n) is ∞ β(n) n=1

Let dk =

∞ gk (n)

ns

=

ζ (s)ζ (2s)ζ (3s) ζ (6s)

, where gk (n) =

µ

n . t

n t|n,β(t)=k Then E. Krätzel [236] proved that 1 = (dk + o(1))h n=1

(20)

(21)

x 0, but βi > 0 is not sure always. i≥0

The analogues questions for n +d(n), n +ϕ(n), n +σ (n), etc. are open problems. We note that G. E. Hardy and M. V. Subbarao [176] have introduced the so-called highly powerful numbers n as numbers satisfying β(n) > β(m) for all 1 ≤ m < n.

3

Arithmetic functions connected with the prime power factors

We now consider other arithmetical functions related to the prime power factors of n. Let p be a prime. Let a p (n) = or d p n be the arithmetical function defined by a p (1) = 0, for n > 1, pa p (n) n,

(26)

i.e. pa p (n) |n but pa p (n)+1 n. It is immediate that a p is completely additive, i.e. a p (nm) = a p (n) + a p (m) for all n, m ≥ 1. On the other hand, since log n log p

a p (n) ≤

(27)

it easily follows that the series a p (n) is convergent for s > 1 and divergent for s ≤ 1. ns n≥1

(28)

Since a p is completely additive, one has n

where bn =

a p (k) = a p (n!) =

[n/ p k ],

n≤bn

k=1

log n (Legendre’s theorem, see e.g. [177]); it follows easily that log p a p (1) + a p (2) + · · · + a p (n) 1 = n→∞ n p−1 lim

(29)

Let Tk = {n : a p (n) = k} and Tk (x) denote the number of elements of Tk which   x  pk  x   − are ≤ x. Since Tk (x) =  p , from simple estimates we get pk d(Tk ) =

p−1 pk + 1

334

(30)


where d is the asymptotic density. Related to the asymptotic density of the set Ma p (defined in section 1 (see relation (9), (10)) one has the following result due to T. ˇ at [296]: Sal´ 1 1 d(Ma p ) = ( p − 1) + ( p − 1) , (31) k+1 k−s kp kp k +1 (k, p)=1 (k, p)>1 where p sk k. As a corollary (see [296]) one gets lim d(Ma p ) = 0

(32)

p→∞

a p (n) is dense in (0,1); The sequence log p log n n≥2 for a proof of O. Strauch, see [296]. For the statistical limit one can write:

limstat log p If n =

r

a p (n) =0 log n

(33)

(34)

piai is the prime factorization of n, define

i=1

γ j (n) =

j−1 1 log piαi , log p j i=1

2≤ j ≤r

(35)

Put P(n) = max γ j (n). Then P. Erdös [97] proved that 2≤ j≤r

P(n) = (1 + o(1))(log3 n)/(log4 n)

(36)

where logk denotes an iterated logarithm. A generalization of γ j and P above has been considered by J. M. De Koninck, I. Kátai and A. Mercier [229]. Let now f 1 (n) = p j , where j−1

piαi ≤ n 1/2
0 there is a K ε so that for every k > K ε the density of integers n for which

k k 12 −ε k 12 +ε < f1 (n + i) < n (39) n i=1

is greater than 1 − ε? 335

CHAPTER 4

Another function introduced by P. Erdös in [98] is α f 2 (n) = pi i , piαi ≤ n < piαi +1

(40)

f 2 (n) → ∞ on a sequence of upper density 1. (41) n Erdös conjectures that the logarithmic density L(α) of integers n satisfying

Then

f 2 (n) ≥α n

(42)

exists, and is a continuous strictly decreasing function of α, L(0) = 1, L(∞) = 1. The ordinary density will not exist, and even the mean value of f 2 will not exist on base of (41). Another conjecture is that max f 2 (n) = (1 + o(1)) n<x

4

x log x log log x

(43)

Other functions; the derived sequence of a number If n = p1a1 . . . prar , and Bk (n) =

r

ai pik , then many properties of Bk can be

i=1

found in [260] (pp. 143-149). A similar function is g(n) = 1 +

r

ai ( pi − 1),

g(1) = 1,

(44)

i=1

introduced by Euler, and studied by H. W. Gould [149]. J. Sándor [299] introduced the function

a r k pi + 1 i , f k (1) = 1 f k (n) = 2 i=1 Put f (n) = f 1 (n) in (45). Some simple inequalities satisfied by f k (n) are n f (ϕ(n)) ≤ 2 with equality only for n = 1, 2, 3 (where ϕ (where ϕ is Euler’s totient), and f k+m (n) ≥ f k (n) f m (n) (k, m ≥ 1)

(45)

(46)

(47)

Let σk∗ (n) be the sum of kth powers of unitary divisors of n. Then the normal order of magnitude of σ ∗ (n) (48) log k f k (n) is log 2 log log n. 336


One has also lim sup n→∞

= lim inf n→∞

1 log σk∗ (n)/ f k (n) = (n)

1 log σk∗ (n)/ f k (n) = log 2 ω(n)

(49)

Let D ∗ (n) = 2(n) . Then there exists a sequence (n k ) such that log f (n k )D ∗ (n k )/n k log n k

(50)

G. L. Cohen and D. E. Iannucci [56] define a multiplicative arithmetic function D such that (51) D( pa ) = apa−1 ( p prime) β(n) n, γ (n) where the function β appears in section 2 (see (17)), and γ (n) = p1 . . . pr is the ”core” of n (see [260]), i.e. the greatest squarefree divisor of n. Let D (0) (n) = n and D (k) (n) = D(D (k−1) (n)) be the iteration of order k of D. The sequence and D(1) = 1. Since D(n) = a1 . . . ar p1a1 −1 . . . prar −1 , we have D(n) =

D(n) = {n, D(n), D (2) (n), . . . }

(52)

is called the derived sequence of n. If D j+k (n) = D j (n), where j ≥ 0 and k ≥ 1 is the smallest integer with this property, then D j (n), . . . , D j+k−1 (n) is a derived k-cycle of n. The following result shows the existence of 5-cycles: Let s be such that (s, 2 · 3 · 5 · 47) = 1, and suppose (s1 , 5 · 23 · 47) = 1, where s1 = (3s − 1)/2. Put n = 23s · 345 · 55 · 23 · s1 . Then n, D(n), . . . , D (4) (n) is a 5-cycle. (53) For similar results on 6 or 8-cycles, see [56]. Cohen and Iannucci prove also that for all n < 1.5 · 1010 , the derived sequence D(n) is bounded; (54) but the density of integers n for which D(n) is unbounded, is less than 0.004 (55) It is not known the existence of unbounded derived sequences, but the authors conjecture this existence.

5

The consecutive prime divisors of a number

Let p1 (n) < p2 (n) < · · · < pr (n), where r = ω(n), be the consecutive prime factors of n ≥ 2. In 1946 P. Erdös [99] proved that for almost all n one has log log p j (n) = (1 + o(1)) j For a simple proof of (56), see [100]. A more precise estimate is log log p j (n) = j + O( j log log j) 337

(56)

(57)

CHAPTER 4

for almost all n, and all ξ(n) ≤ j ≤ ω(n), where ξ(n) → ∞ (see R. R. Hall and G. Tenenbaum [172]). Let λ j ( p) = d{n : p j (n) = p} (58) be the density of integers n whose j-th prime factor is p. By the sieve of Eratosthenes it follows that

1 1 λ j ( p) = 1− 1/m (59) p q 0 1, t =0

P. Erdös and G. Tenenbaum [114] have proved that

1 F(ρ, p)ρ 1−k 1+O λ j ( p) = p F(1, p)w(k − 1) R

(60)

uniformly, for all 1 ≤ j ≤ p 1−ε (where ε > 0 is given), where ρ is the solution of the equation ρ = j −1 (61) q< p q − 1 + ρ As corollaries of (60) and (61) one obtains the following:

M j−1 1 j −1 λ j ( p) = exp O p F(1, p) ( j − 1)! R where

and

(62)

M = log log p − log(1 + log+ ( j/L)),

log p L = log log( j + 1) log+ x = max{0, log x}

λ j+1 ( p) 1 M = 1+O , λ j ( p) j R

where in (62) and (63) one has 1 ≤ j ≤ p 1−ε . 338

(63)


Other corollaries are: max λ j ( p) = j≥1

1 + O(1/ log log p) as p → ∞ p 2π log log p

(64)

and all values of j realizing this maximum satisfy j = log log p + O(1), 2 log2 j + 1 max λ j ( p) = exp − j log j − log2 j − 1 + + p log j

2(log2 j)2 − log2 j + O(1) + (log j)2

(65)

(66)

where log2 j = log log j. Moreover, all values of p realizing this maximum satisfy 2 log2 j j 2(log2 j)2 − 3 log2 j + O(1) 1+ (67) log p = + log j log j (log j)2 Erdös and Nicolas [110] have studied the functions r −1 pi (n) f (n) = p (n) i=1 i+1

and

F(n) =

r −1 i=1

pi (n) 1− pi+1 (n)

They proved, for example, that there exists a constant c = 1.70 . . . such that F(n) ≤ log n − c + o(1), for all n, and F(n) ≥ log n − c + o(1) for infinitely many n. The proofs use besides results on the distribution of primes, also classical theorems of Optimization theory. The following results are due to P. Erdös (see [101] and [100]). For almost all integers

∗ 1 1 = + o(1) log log log n (68) j 2 where ∗ indicates that log log p j (n) > j. Similarly, for almost all n,

∗∗ 1 1 = + o(1) log log log n j 2

(69)

where ∗∗ indicates that p j (n) > p j (n + 1) in the summation. For almost all n one has ∗∗∗ 1 (70) √ = (1 + o(1))c log log log n j 339

CHAPTER 4

where ∗ ∗ ∗ shows that the summation is extended over the j for which j < log log p j (n) < j + 1, and c is a constant. log log p j (n) − j has normal distribution, and if j1 /j2 → ∞, then The function √ j log log p j2 (n) − j2 log log p j1 (n) − j1 and are asymptotical independent. √ √ j1 j2

(71)

J. Galambos [137] defined a number n to be weakly-composite if r j=1

1 ≤2 p j (n)

(r = ω(n))

(72)

He proved that (by solving a conjecture of I. Kátai) for all sufficiently large integers n, there is a weakly composite number between n and n + log log log n On the other hand, the behaviour of 1 n≤x

p j (n)

= R j (x)

(73)

(74)

has been investigated by several authors for some specific values of j. In particular, for j = 1, or whenever j is preassigned, it is not difficult to prove that R j (x) ∼ c j x, with computable constants c j . When j = ω(n), the problem of finding good approximations to R j is more difficult. The case j = ω(n) − 1, or j = ω(n) − k with k fixed, shows no similarity to the above case. For asymptotic results (due to many authors, with refinements), see [260]. In order to obtain an average type of information on the magnitude of p j (n), when j is not fixed, or j = ω(n)−k, with k fixed, J. M. De Koninck and J. Galambos [230] have set up the following probabilistic approach. For every integer n ≤ x, pick one 1 p(n) ∈ { p1 (n), . . . , pr (n)} with equal probabilities , and consider the sums ω(n) 1 = R(x) (75) n≤x p(n) Assume that x is an integer. Then there are ω(2) . . . ω(x) sums of the type (75) and Rr (x) ≤ R(x) ≤ R1 (x). We shall say that a property holds for almost all sums in (75), if the number N (x) of the sums with the property in question satisfies N (x)/ω(2) . . . ω(x) → 1 as x → ∞. 340


De Koninck and J. Galambos [230] prove that for almost all sums in (75) one has cx +O R(x) = log log x where c =

x , (log log x)2

(76)

1/ p 2 . The proof is based on a form of the Chebyshev inequality of

p prime

Probability theory. In another paper, De Koninck and Galambos [231] have studied the intermediate prime divisors of an integer. With density one, we can distinguish three types of prime divisors: we call p j ”small” if j is bounded as n → +∞; p j ”large” if ω(n)− j remains bounded as n → ∞; all others are ”intermediate”. For the investigation of small prime divisors, tools from elementary number theory are sufficient. Large prime divisors require special tools (due e.g. to Dickman, see e.g. [260] for asymptotic log p j formulas involving large prime divisors), and old results show that falls into log n the interval (a, b), where 0 ≤ a < b ≤ 1, with positive density, when j = ω(n). Extensions are known also for all large prime divisors, with similar results in nature. This perhaps explains why it was so important in probabilistic number thelog r ory to truncate additive functions at r = r (N ) with → 0; it simply cancels log N the effect of the large prime divisors (see P. D. T. A. Elliott [95]). The truncation methods already show that the intermediate prime divisors behave asymptotically as independent random variables. In 1976 J. Galambos [138] showed that for intermediate terms, log log p j+1 (n) − log log p j (n) are asymptotically unit exponential variables, (77) i.e. the density for which the above stated difference is smaller than 0 < z, equals 1 − e−z . The remarkable part of this result is that the density does not depend on j. H. Maier [246] extended this result by showing that a finite set of the above differences are asymptotically independent in the sense of probability theory. De Koninck and Galambos [231] further generalize these results, by proving the following statement: Let j = j (N ) be a positive integer valued function, j (N ) → +∞ as N → +∞. Assume that j is such that, with perhaps the exception of a set of density zero, p j (n) → +∞ with N , and (log p j (n))/ log N → 0 as N → +∞, where 1 ≤ n ≤ N . Then the points log log p j+k (k ≥ 1) form a Poisson process in limit as N → +∞. (78) In the proof, a result of A. Rényi [284] on the Poisson process is applied. For another notion of asymptotic prime divisor, see S. McAdam [1]. 341

CHAPTER 4

6

The consecutive divisors of an integer

Let 1 = d1 (n) < d2 (n) < · · · < dk (n), k = d(n), be the consecutive divisors of n. For each n ≥ 2, pick at random one r (n) of the divisors d j (with equal probabilities) and consider the sum 1 = Q(x) n≤x r (n)

(79)

As in (75), De Koninck and Galambos [230] say that a property holds for almost all sums in (79) if it holds for M sums such that M/d(2) . . . d(x) → 1 as x → ∞ (where x is an integer, and d(k) denotes the number of distinct divisors of k). Then one has the following results (see [230]): For almost sums in (79),

c1 x x Q(x) = (80) +O (log x)3/2 log x Define similarly

r (n) = S(x)

(81)

n≤x

Then, for almost all sums in (81) one has c2 x 2 S(x) = +O log x

x2 (log x)3/2

(82)

Here c1 , c2 are positive constants. We note that similar results can be deduced for the more general sums h(r (n)), where h is a general arithmetic function, n≤x

satisfying certain conditions. In relation (58) we have defined a density function on the consecutive prime divisors of an integer. Define similarly j (k) = d{n : d j (n) = k},

k ≥ 1.

(83)

P. Erdös and G. Tenenbaum [114] have shown that the following two assertions are equivalent: (i) j (k) > 0; (ii) d(k) ≤ j ≤ k (84) Further, the following estimates are true: e−γ + O(1/ log k) 3 log3 k + O(1) ≤ max j (k) ≤ j k log k k log2 k 342

(k → ∞),

(85)


where logm denotes an iterated logarithm, and γ is Euler’s constant. Moreover, for all j realizing this maximum, (86)

d(k) ≤ j ≤ d(k)(log k)e log 2+o(1) log j log2 j . Then Similarly, for j ≥ 3, let K := exp log 2 K −1 j −(log3 j+O(1))/ log 2 ≤ max j (k) ≤ K −1 j (log3 j+O(1))/ log 2 k

(87)

as j → ∞. For all k realizing the maximum, one has K α+o(1) ≤ k ≤ K 1+o(1)

(88)

where α = 0.293815 . . . is the unique solution of the equation (α + 1) log(α + 1) − α log α = log 2.

7

Functional limit theorems for the consecutive divisors

Let γx (. . . ) denote the uniform probability measure on the set {1, . . . , [x]}; put Lu = log max{u, e}, and L k = L(L k−1 ). Then one has (see [172])

max |L 2 dk (m) − log2 k| ≥ (1 + ε) 2(log2 k)L 3 k = 0 (89) lim lim sup γx n→∞

x→∞

n≤k≤d(m)

which is the counterpart of the following result on prime divisors:

max |L 2 pk (m) − k| ≥ (1 + ε) 2k L 2 k = 0 lim lim sup γx n→∞

x→∞

n≤k≤ω(m)

(90)

These results were extended into the Strassen functional form by E. Manstaviˇcius [249]. Let d(m, n) = car d{d ∈ N : d|m, d ≤ u}. G. Tenenbaum [323] (see also [172]) showed that γx (d(m, x t ) − d(m, x s )) < ud(m) ⇒ Fst (u),

0 ≤ s < t ≤ 1,

(91)

where ⇒ denotes weak convergence of distribution functions, Fst (u) is some purely discrete distribution function, and x → ∞. This relation can be interpreted as referring to the increments of the arithmetic process d(m, x t ) (92) Yx = Yx (m, t) = d(m) 343

CHAPTER 4

having trajectories in the space D = D[0, 1] of real-valued functions on [0, 1] which are right-continuous and have left-hand limits. The behaviour of the expectation of this process is due to J. M. Deshouillers, F. Dress and G. Tenenbaum [75]: √ 2 1 Yx (m, t) = arcsin t + o(1), x m≤x π

0≤t ≤1

(93)

Let ω(m, v) = car d{ p : p|m, p ≤ v} ( p = prime) and define the process ψx = ψx (m, t) := √

1 (ω(m, exp{(L x)t }) − t L 2 (x), L2x

0≤t ≤1

(94)

which ”simulates” the Brownian motion w = w(t) given on some probability space {, F, P}. Let ρ(·, ·) be the supremum metrics on the space D, and D be the Borel σ -algebra in D with respect to ρ, and γx ◦ ψx−1 stand for the measure on D defined by γx (X x ∈ A), where A ∈ D, and X x = X x (m, t) = √

1 (log2 d(m, exp{(L x)t }) − t L 2 x), L2x

0≤t ≤1

(95)

Put µ for the Wiener measure P ◦ W −1 . In 1970 P. Billingsley [27] proved that the sequence of measures γx ◦ ψx−1 (96) weakly converges to the Wiener measure µ as x → ∞ (see also [28]). Denote µx = γx ◦ X x−1 . In 1996 E. Manstaviˇcius [250] proved the similar result that the sequence of measures µx weakly converges to the Wiener measure µ as x → ∞. (97) As a corollary, we note that (97) implies u 1 y2 dy (98) exp − γx (X x (m, t) − X x (m, s) < u) ⇒ √ 2(t − s) 2π(t − s) −∞ Hence if s = 0 and t = 1, we have the central limit theorem for the additive function log2 d(m) belonging to the Kubilius class H (see [238]). But if 0 < t < 1, then log2 d(m, t) is only subadditive. This shows new direction of possible investigations, e.g. to extend the probability number theory to the class of subadditive functions. For a generalization of the Kubilius class, see I. Z. Ruzsa [288]. √ 2 Let As(u) = arcsin t for 0 ≤ t ≤ 1, and As(u) = 0 when u < 0; = 1, when π u > 1. Then another corollary of (97) is: γx (meas{0 ≤ t ≤ 1 : log2 d(m, exp{(L x)t }) > t L 2 x} < u) ⇒ As(u), where meas is the Lebesgue measure. 344

(99)


In 1969 P. Erdös [101] proved that γx (car d{k ≤ ω(m) : L 2 pk (m) < k} 0}. Then we have 1 + γx (101) I (log2 k − L 2 dk (m)) < (L2)u L 2 x ⇒ As(u) k k≤d(m) For a survey of functional limit theorems in Probabilistic number theory, see the recent paper by E. Manstaviˇcius [251].

8

Miscellaneous arithmetic functions connected with divisors

In what follows we shall study various arithmetic functions connected with the divisors of a number. In 1973 P. Erdös and S. K. Zaremba [118], in connection with work on good lattice points modulo composite numbers, have studied the arithmetical function a(n) =

log d d|n

d

(102)

Obviously, lim inf a(n) = 0. On the other hand, one has n→∞

lim sup n→∞

a(n) = eγ , (log log n)2

(103)

where γ is Euler’s constant. The arithmetical function a(n) has a continuous purely singular distribution function. Let d + (n) denote the number of integers k, such that the interval [2k , 2k+1 ) contains at least a divisor d of n. (104) This function appears in Erdös [100]. In [115] Erdös and Tenenbaum proved that for all ε > 0 there is c(ε) > 0 such that for all 0 ≤ α ≤ 1, the upper density of all integers n satisfying d + (n) ≤ αd(n) (105) is less than c(ε)α 1−ε . This implies a conjecture of Erdös, namely that apart from a sequence of integers of density zero, d + (n) → 0 as n → ∞ (106) d(n) 345

CHAPTER 4

Various arithmetic functions have been studied by P. Edös and J. L. Nicolas in [107], [108] and [109]. Let dn be the smallest divisor of n such that d≥n d|n,d≤dn

and put

n dn

f 1 (n) =

(107)

In [107] one can find that for ε > 0 and n > n 0 (ε), one has f 1 (n) ≤ exp(1 + ε)

log2 n log3 n , log4 n

(108)

log2 m log3 m log4 m

(109)

and for infinitely many m one has f 1 (m) ≥ exp(1 − ε) Another function introduced in [107] is f 2 (n) = max

1≤k≤n

1 d k d|n,d≤k

(110)

It is proved that cd(n)

≤ f 2 (n) ≤ c d(n) log n log log n

log log n , log n

(111)

with c, c > 0 constants. The function f 2 (n) is supermultiplicative, i.e. (m, n) = 1 ⇒ f 2 (mn) ≥ f 2 (m) f 2 (n)

(112)

Let k0 = k0 (n) the value of k in (110) for which the maximum is realized, i.e. f 2 (n) =

1 d. k0 (n) d|n,d≤k (n) 0

In [109], by probabilistic arguments it is shown that for all constants c1 ≤ 0.23 and sufficiently large n, we have k0 (n) ≥ exp(c1 log n/ log log n); 346

(113)


and that there exists a constant c2 > 0 such that for infinitely many n, k0 (n) ≤ exp(c2 log n/ log log n)

(114)

Another result says that for almost all n one has k0 (n) < n

(115)

The function f 2 is connected with another function F defined by 1 F(n) = max t

via the relations

(116)

d|n, 2t 0 such that d(n) d(n) ≤ F(n) ≤ c2 c1 log n log log n log n log log n

(118)

In 1976 G. Tenenbaum [324] introduced the functions ρ1 (n) = greatest divisor of √ n less than or equal to n; and ρ2 (n) = smallest divisor of n greatest than or equal √ to n. (119) He showed that for all ε > 0 there is an absolute constant c and an x0 (ε) such that x 3/2 (log x)−α−ε < ρ1 (n) < x 3/2 (log x)−α (log log x)−1/2 , (120) n≤x

where α = 1 − Further,

1 log(e log 2), and x ≥ x0 (ε). log 2 n≤x

ρ2 (n) =

π2 x2 +O 12 log x

x2 log2 x

;

(121)

and the density of integers n such that (ρ1 (n), ρ2 (n)) = 1

(122)

is equal to 1. Certain arithmetic functions related to distinct divisors have been studied by P. Erdös and C. Pomerance [111] and [112]. 347

CHAPTER 4

Let f (n) denote the least integer so that in the interval (n, f (n)] there are distinct integers a1 , . . . , an with i|ai for i = 1, 2, . . . , n. For example, f (10) = 24, since a1 = 11, a2 = 22, a3 = 21, a4 = 16, a5 = 15, a6 = 12, a7 = 14, a8 = 24, a9 = 18, a10 = 20. More generally, if m is any positive integer, let f (m, n) denote the least integer so that in (m, m + f (n, m)] there are distinct integers a1 , . . . , an with i|ai , for i = 1, 2, . . . , n. (123) In [111] it is proved that for n ≥ 3,

2 (124) √ + o(1) n log n/ log log n ≤ f (n) ≤ (2 + o(1))n log n e The right side of (124) holds true also for n = 2. For f (n, m) the following upper bound is valid: √ f (n, m) ≤ 4n([ n] + 1), m, n ≥ 1

(125)

The upper bounds in (124) and (125) rely on a theorem of D. König [225] and P. Hall [167] (called also as the ”Marriage theorem”) on bipartite graphs. Let L(n) = [1, 2, . . . , n] be the least common multiple of 1, 2, . . . , n. Then for all sufficiently large n, L(n) 1 f (n, m) > n(log n)α L(n) m=1

(126)

where α = .08607 . . . is the constant of (120); and for all n L(n) 1 f (n, m) ≤ n exp((β + o(1)) log n/ log log n), L(n) m=1

(127)

where β = log(55/2 /2 · 33/2 ) = 1.6825 . . . The authors conjecture that f (n, m) ≤ n 1+o(1) , and that L(n) 1 f (n, m) n(log n)γ for some γ > 0 L(n) m=1

(128)

Related to Grimm’s conjecture, in [112] the following concepts are introduced. We say that a set of positive integers S has the distinct divisor property if for each s ∈ S we can find a divisor ds |s, 1 ≤ ds < s such that the ds are all distinct. If c > 0, let f (n, c) denote the cardinality of the largest subset of [n, cn] which has the distinct divisor property. 348


By applying again the Marriage theorem, in [112] it is proved that for each c > 1 there is a constant δ(c) such that f (n; c) ∼ δ(c)n as n → ∞.

(129)

Further, δ is a continuous and strictly increasing function, and δ(c) δ(c) 1 1 δ(c) = 1, lim = , < < 1 for all c > 1 c→∞ c→1+ c − 1 c−1 2 2 c−1 lim

The following Open Problem is stated: is

9

(130)

δ(c) a monotonic function? c−1

Arithmetic functions of consecutive divisors

Let 1 = d1 < d2 < · · · < dk (n) (k = d(n)) be the consecutive divisors of n. In what follows we shall study certain arithmetic functions connected to these consecutive divisors. In 1948 P. Erdös [102] proved that the density of all integers n having two divisors d and d such that d < d ≤ 2d is positive. (131) He conjectured that this density is 1, or written equivalently di+1 : 1 ≤ i ≤ k → 1 a.e. (132) E(n) = min di (where a.e. - almost everywhere - means that the relation holds true on a sequence of density one). Conjecture (132) has been established in 1984 by H. Maier and G. Tenenbaum [247]. The arithmetical function f (n) = car d{1 ≤ i ≤ k : (di , di+1 ) = 1}

(133)

has been introduced by P. Erdös and R. R. Hall in [106], while its ”dual” is the ErdösMontgomery function from 1979 (see [116]), defined by g(n) = car d{1 ≤ i ≤ k : di |di+1 } A more general function than f is fr , introduced in [106], too, is max (d j , dk ) = 1 fr (n) = car d 1 ≤ i ≤ k − r + 1 : 1≤ j (log x) n≤x

(x → ∞),

(148) (149)

and which was strengthened to max k(n) > (log x)log3 x/(9 log4 x) n≤x

(x → ∞)

(150)

by A. Balog, O. Erdös and G. Tenenbaum [15]. A generalization of k is the function ks introduced by R. de la Bretèche [39], [40]. Put (151) ks (n) = car d{d : (d, s) = 1, d(d + s)|n} Clearly k1 ≡ k. Let D(n) = 2log n/ log log n . Then (see [40]): ks (n) ≤ D(n)c1 +o(1) , as n → ∞ uniformly for all s ≥ 1, with c1 = 0.565 . . . 351

(152)

CHAPTER 4

In 1986 J. M. De Koninck and A. Ivić [232] have studied two functions, namely H1 (n) =

k−1 i=1

and H1 (n) =

r −1 i=1

1 , di+1 − di

k = d(n),

(153)

1 , pi+1 − pi

r = ω(n),

(154)

where p1 < p2 < · · · < pr are the consecutive prime divisors of n. They proved that

x log log x (155) H1 (n) = Ax + O log x where A = 0.299 . . . is a constant; and H1 (n) = B · x + O(x(log x)−1/3 )

(156)

n≤x

with another constant B = 1.77 . . . In [117] Erdös and Tenenbaum improved the error term in (156) to O(x(log x)−1 (log log x)3 )

(157)

They proved also that 1

H1 (n) d(n)(log d(n))− 3 +ε

(n ≥ 2)

(158)

(x → ∞)

(159)

for any fixed ε > 0, and that 1

max H1 (n) > exp{(log x) 2 +o(1) } n≤x

Further,

H1 (n) d(n)1−c2 log(1 + ω(n)) 5 log 3 = 0.08170 . . . whenever n is squarefree, where c2 = − 3 log 2 In [15] it is proved that

1−c2 +o(1) max H1 (n) ≤ max d(n) (x → ∞), n≤x

n≤x

(160)

(161)

where c2 is the same as in (160). It is conjectured that a bound of type H1 (n) d(n)1−δ with an absolute δ > 0 holds unconditionally. 352

(162)


The function H1 has a distribution function (see [117]), and this is everywhere continuous on the real line (see [15]). In [116] the authors study also a general function of type

k−1 di , θ F(n, θ) = di+1 i=1

(163)

where θ : [0, 1] → R is an arbitrary function. They show that when θ is bounded, then the function F(n, θ) (164) d(n) has a distribution function. When θ is of class C 2 , then an asymptotic formula of type log log log x F(n, θ) = x log x θ (1) + O (165) (log x)δ log log x n≤x is valid, where δ = 0.086 . . . is an optimal constant, if one assumes that tθ (t) is a monotonic function. For the particular case θ (t) = t r a more precise estimation is true: F(n, t → t r ) = x(log x − K r (x) + O(1)) (166) n≤x

uniformly for r log x 1, where K r (x) satisfy the double inequality e−εr L 1 (log x) ε with

K r (x) (1 + r δ )L 2 ((r/(r + 1)) log x), (r log x)1−δ

(167)

L 1 (v) = exp{−c(ε) log v log log v},

L 2 (v) = (log v)−1/2 log log v

1+ε 1 −1 (ε > 0), M. D. Vose [345] constructed a In the case of θ (t) = t sequence (Nn )n≥1 such that F(Nn , θ) = Oε (1), solving a conjecture by Erdös. In fact, the above relation holds true also by replacing Nn with the sequence of factorials (n!) or with lcm[1, 2, . . . , n], see G. Tenenbaum [334], who studied the 1 more general case of θ (t) = h − 1 , where h : [0, ∞) → [0, ∞) belongs to a t certain class generalizing the one considered by Vose. 353

CHAPTER 4

For similar or related problems on the sequence of factorials, as well as the distribution of divisors of factorials, see M. D. Vose [346] and D. Berend and J. E. Harmse [21]. Another function of type (153) is Tenenbaum’s function ([326]) H2 (n) =

1≤i< j≤k

1 d j − di

(168)

Tenenbaum proves that H2 (n) d(n)1−c with an explicit positive constant c. He further shows that the inequality k ξi ξ j ξi2 (ξi ∈ R), ≤M 1≤i< j≤k d j − di i=1

(169)

(170)

which is a special case of Hilbert’s inequality, holds with a constant M = M(n) satisfying M(n) log log d(n) as n → ∞ and M(n i ) log log d(n i ) for a suitable sequence (n i ) with d(n i ) → ∞ as i → ∞. R. de la Bretèche [39] shows that H2 (n) d(n)c3 log d(n) log log(2d(n)),

(171)

where c3 = 0.918 . . . is a constant; and in [40] that H2 (n) D(n)c1 +o(1) ,

(172)

where D(n) and c1 are as in (152). In [326] Tenenbaum has introduced a general class of arithmetical functions F. We say that an application gn , defined on the set of divisors of n with integer values, is regular if gn is injective, and for all divisors d, t of n one has ((d, gn (d)) = 1, (t, gn (t)) = 1, dgn (d) = tgn (t)|n) ⇒ d = t

(173)

Let F be the class of arithmetic functions F ∈ F defined by F(n) = car d{ f |n : gn (d)|n, (d, gn (d)) = 1}

(174)

f F (n) = max{F(n) : F ∈ F}

(175)

Let This function is a common generalization of the functions f and k defined in (133) and (151), respectively. 354


The properties of f F have been recently investigated in [39], where the following are proved: f F is super-multiplicative, i.e. f F (mn) ≥ f F (m) f F (n) for all (m, n) = 1;

(176)

f F (n) ≤ d(n)c3 for all n,

(177)

where c3 is the constant of (171); lim sup d(n)→∞

log f F (n) = c3 ; log d(n)

f F (n) ≥ max(min{d(k), d(n/k)}) ≥ √ k n

(178) d(n)1/2 ; H (n) + 1

(179)

where k n means that k is a unitary divisor of n (i.e. k|n, (k, n/k) =1), and H (n) is the maximum of the exponents γ in the prime factorization n = p γ (i.e. the p γ n

function defined by (1) and studied in section 1). One has also 2√γ

f F (n) ≤ d(n) γ +1 p γ n

(180)

As a corollary, one obtains f F (n) = O

d(n) (n)

(181)

Let p(n) denote the least prime divisor of n. By studying certain sievetheoretical problems, in 1959 A. Schinzel and G. Szekeres [290] considered the function S(n) = max{d p(d) : d > 1, d|n} (n ≥ 2); S(1) = 1 (182) This function is connected with the set of consecutive divisors by the surprizing formula S(n) di+1 : 1 ≤ i ≤ k − 1 = E ∗ (n), (183) = max n di due to G. Tenenbaum [327]. Let D(x, y), A(x, y) be distribution functions defined by D(x, y) = car d{n ≤ x : S(n) ≤ yn}, A(x, y) = car d{n ≤ x : S(n) ≤ yx} 355

(184)

CHAPTER 4

where x ≥ 1, y > 0. By (183) one can say that D(x, y) is exactly the distribution function of E ∗ (n). For D and E the following estimates are true (see [327]):

log δ 5 1− = 4.20 . . . Let ε, λ real numbers such that ε > 5/3, λ > 3 δ √ 1+ 5 δ = log . Then for all x ≥ y ≥ 2 one has 2 x x L(x, y) y,λ D(x, y) ≤ A(x, y) log 2u, u u where u =

(185)

log x , and log y L(u, y) =

(log u)−λ , 2 ≤ y ≤ exp{(log log x)ε } 1, y > exp{(log log x)ε }

The following inequality for the Schinzel-Szekeres function is true: S(mn) ≤ max{S(m) · n, S(n)}

(m, n ≥ 1)

(186)

with equality if P(m) ≤ p(n) (where P(m) denotes the greatest prime factor of m). As a corollary, S(mp) ≤ pS(m) for all m ≥ 2, p ≤ S(m) ( p = prime),

(187)

which follows by (186), since S( p) = p 2 for a prime p. In analogy with (184) define D(x, y, z) = car d{n ≤ x : S(n) ≤ ny, p(n) > z} A(x, y, z) = car d{n ≤ x : S(n) ≤ x y, p(n) > z}

(188)

E. Saias [290] found that there exist three positive constants c4 , c5 and y0 such that under the conditions x ≥ y ≥ z + z 0.535 ≥ 3, x ≥ z 5 and y ≥ y0

(189)

we have c4 Let u =

x x log(y/z) log(y/z) · ≤ D(x, y, z) ≤ c5 · log x log z log x log z

log x log x and v = . log y log z 356

(190)


For v > 1, the Buchstab function ω(v) is defined as the unique continuous solution to the difference-differential equation (vω(v)) = ω(v − 1) (v > 2) vω(v) = 1 (1 ≤ v ≤ 2)

(191)

Let ω(v) = 0 for v < 1, and define ω at 1 and ω at 1 and 2 by right continuity. The Buchstab function arises in the study of D(x, x, z). For an overview of results on these functions, see [260] (Chapter 4). For u > 1 we define the function d(u, v) as the unique continuous solution to the equation

∂ u(v − 1) 2u (192) (vd(u, v)) = d ,v − 1 v > u > 1, v > ∂v u+v u−1 with initial conditions

  ω(v), if 0 ≤ u < 1,   u 2u d(u, v) = ω(v) − ω(u), if 1 ≤ u < v ≤ ,  v u−1   0, if u = v ≥ 0

2u , u−1 v = 2. To extend the domain of d to all of R2 we let d(u, v) = 0 outside the region 0 ≤ u ≤ v. It is easily verified that  1 (v − 1)(u − 1) 2u 4u u   , if 3 ≤ ≤v≤ ω(v) − ω(u) − log   v v u+1 u−1 u−1 d(u, v) =   4u  ω(v) − u ω(u) − 1 log v − 1 , if 3 ≤ u ≤ v ≤ v v u−1 u−1 (193) In a recent paper, A. Weingartner [349] shows that uniformly for 3/2 ≤ z ≤ y ≤ x,

x y z x D(x, y, z) = d(u, v) + − +O log z log y log z log2 z (194)

√ xy x z x d(u, v) + +O A(x, y, z) = √ − log z log x y log z log2 z For the behaviour of d(u, v) Weingartner proves that for 1 ≤ u ≤ v we have

4u 0.9g(u, v) ≤ d(u, v) ≤ 1.7g(u, v) v ≥ (195) u−1 d(u, v) ε g(u, v) (v ≥ 2 + ε, (u, v) ∈ Wε ) Note that d also satisfies the above equation in the region 1 ≤ u < v
1, to

∂σ v u (u, v) + σ (u − 1, v − v/u) = 0 u > , v>1 ∂u v−1 with initial conditions σ (u, v) = ω(v) (0 ≤ u < 1),

u . σ (u, v) = ω(v) − 1/v 1 ≤ u ≤ v ≤ u−1

(205)

This function has been studied by J. B. Friedlander [135], and E. Saias [292]. We note that results on D(x, y) and A(x, y) of (184) have been applied to the small sieve of Erdös and Ruzsa ([289]) and to practical numbers e.g. in [327] or [293]. E. Saias [291] improved result (185) to c6

x x ≤ D(x, y) ≤ A(x, y) ≤ c7 u u

where c6 , c7 > 0 are constants.

359

(x ≥ y ≥ 2),

(206)

CHAPTER 4

In a recent paper [350] A. Weingartner proves that for any ε > 0, for x ≥ 3 and x ≥ y ≥ exp{(log log x)5/3+ε }, we have

1 x = xd(u) 1 + O (207) A(x, y) = xd(u) + O log x log y and a similar result for D(x, y). Let B(x, y, z) be defined by B(x, y, z) = car d{n ≤ x : S(n) ≤ x z, P(n) ≤ y}

(208)

Let a function a(u, v) defined by a(u, v) = 0 if u < 0 or v < 0, = ρ(u) if u > v ≥ 0, = ρ(v) + A(u, v) for 0 ≤ u ≤ v, where ρ is the Dickman function, and v ds . A(u, v) =

a(s − 1, v(1 − 1/s)) 2v s max u, v+1 Then in [350] it is proved that for x ≥ 3, and x ≥ y ≥ z ≥ exp{(log log x)5/3+ε } we have

log u 1 + (209) B(x, y, z) = xa(u, v) 1 + O log z log y A similar result holds true when B(x, y, z) is replaced with E(x, y, z) = car d{n ≤ x : S(n) ≤ nz, P(n) ≤ y}

10

(210)

Hooley’s function

An important arithmetic function (with applications to many parts of Number theory) is the function by C. Hooley, introduced in 1979 [185]. For n ≥ 1 and all real x put (n, x) = car d{d|n : x < log d ≤ x + 1} and (211) (n) = max (n, x) x∈R

This function satisfies the elementary inequalities 1 ≤ (n) ≤ d(n) (n ≥ 1); (mn) ≤ (m)d(n) (m, n ≥ 1) Put S(x) =

(212)

(n).

n≤x

Hooley proved that 4

S(x) x(log x) π −1 360

(213)


and that

S(x) → ∞ as x → ∞ x Hooley in [185] introduced also the more general function

(214)

r (n) = max car d{d1 , . . . , dr −1 : d1 . . . dr −1 |n, x1 ,...,xr −1

xi < log di ≤ xi+1 , 1 ≤ i < r } and with Sr (x) =

(215)

r (n)

n≤x

showed that

√ r −1

Sr (x) r x(log x)

(r ≥ 2)

(216)

4 In 1982 Hall and Tenenbaum [173] improved the exponent − 1 = 0.27323 . . . π in (213) to 0.23457 . . . , and with an interesting more elaborate method, to 0.23454. Furthermore, they proved that S(x) x log x

(217)

(n) < (log n) B for almost all n,

(218)

and log 2 + ε. log 3 In 1984 and 1985 Maier and Tenenbaum [247], [248] have obtained the strong improvements

where B = log 2 −

(log log n)γ < (n) < ξ(n) log log n for almost all n,

(219)

for all constants γ < 0.28754 . . . , and all functions ξ(n) → ∞ as n → ∞. The left side of (219) implies (n) > 1 for almost all n,

(220)

and this contains essentially the famous conjecture of Erdös (see also (132)). In [172] it is proved that √

S(x) ε x L(log x)

2+ε

where L(u) = exp{ log u log log u}, (u ≥ 3), while for Sr (x) Maier and Tenenbaum deduced (related to (216)), x log log x Sr (x) ε,r x L(log x)αr +ε 361

(221)

(221 )

CHAPTER 4

for all r ≥ 2, where the constants αr satisfy " αr ≤ (r − 1)

1 r (r + 2) 2

(r ≥ 2)

(222)

For certain applications, it is important to introduce also the pondered sums r (n)y ω(n) (223) Sr (x, y) = n≤x

In 1985, Hall and Tenenbaum (see [172]) showed that

Sr (x, y) r x(log x)

Cr log r (log3 x 2 ) exp 1−y

for 0 < y < 1,

(234)

Sr (x, y) r,y,ε x(log x)r (y−1) L(log x)αr +ε for y ≥ 1, ε > 0,

(235)

y−1

and where the constants αr satisfy (222). In 1986 they obtained the asymptotic majorization √ (n)t y ω(n) t,y x(log x)β(t,y)−1 L(log x)2 t+o(1)

(236)

n≤x

for all t, y satisfying t ≥ 1, y ≥ t/(2t − 1), where β(t, y) = 2t y − t, and L is defined as above. In 1990 G. Tenenbaum [329] proved a partial generalization of (236): Let F(X ) be an irreducible polynomial over Z[X ] of degree > 1. Then for all t ≥ 1 one has

√

(F(n))t t x(log x)β(t)−1 L(log x)

2t+o(1)

,

x →∞

(237)

n≤x

where β(t) = 2t − t. Let M(x) denote the number of integers n ≤ x such that (n) = 1. A quantitative version of (n) = o(n) is the following (see [330]): M(x) ε x(log log x)−β+ε , where β = 1 − (1 + log log 3)/ log 3 = 0.00415 . . . 362

(238)


11

Extensions of the Erdös conjecture (theorem) Let Bλ (n) = {m : there exists d|n and d |m such that d < d ≤ (1 + (log n)−λ )d},

where λ ≥ 0. Then the Erdös conjecture can be written as dB0 (n) = 1 + o(1) for almost all n

(239)

where d denotes asymptotic density. In 1995 A. Rouj [283] proved a generalization of (239) in a strong effective form. In part I he proved that √ 1 − e−cλ log log n ≤ dBλ (n) ≤ 1 − (log n)−Q(β)+o(1) (240) for almost all n, where β = ((1 + λ)/ log 2) − 1 and Q(β) = β log β − β + 1. In part II, it is shown that for almost all n we have dBλ (n) = (log n)−F(λ)+o(1) ,

(241)

where F(λ) = 0 for λ ≤ log 4 − 1, F(λ) = Q(β) for log 4 − 1 < λ ≤ log 8 − 1, F(λ) = λ − log 2 for λ > log 8 − 1. An analogue of the Erdös conjecture result is due to M. Car [51]. Let Fq [X ] denote the finite field of order q. Then almost all (monic) polynomials of degree n in Fq [X ] possess two distinct divisors of the same degree. (242) Let t (n) be the number of exceptional polynomials. Then for any ε > 0, t (n) = Oε (q n (log n)−b+ε ),

(243)

1 where b = (1 − ((1 + log log 3)/ log 3) = 0.00103 . . . 4

12

The divisors in residue classes and in intervals

We now state certain results on the distribution of divisors in residue classes and in intervals. Let k and l be integers satisfying 0 < l < k, (l, k) = 1. Denote by f (x, k, l) the number of integers n < x which have a divisor t satisfying t ≡ l (mod k); and F(x, k) denote the number of integers n < x which have a divisor ≡ l (mod k) for every l. Clearly F(x, k) ≤ f (x, k, l). It is easy to see that for fixed k, F(x, k) = x + o(x). If x tends to infinity with k, the questions become much difficult. In 1964 363

CHAPTER 4

Erdös [103] proved that for any fixed ε > 0 and k < 2(1−ε) log log x , we have, uniformly in k, F(x, k) = x + o(x) (244) In other words, if k < 2(1−ε) log log x , then almost all numbers have a divisor in every residue class l (mod k). Similarly, let k > 2(1+ε) log log x . Then uniformly in k and l, x (245) f (x, k, l) = + o(x) l 1

Finally, let k < 2 2 (1−ε) log log x and denote by d(n, k, l) the number of divisors of n which are ≡ l (mod k). Then for every η > 0, we have for every l1 and l2 , for all but o(x) integers n < x, 1−η
α0 . In 1992 R. R. Hall [169] prove this conjecture with α0 = 1/ log 2, and makes further progress by allowing α to depend on k, and 1 − c log3 k/ log k, where letting α → α0 , as k → ∞. For example, if α < log 2 c > 2/ log 2, then A(k, α) → 0 as k → ∞ (248) Let A∗ (k, α) be the density of integers n such that for every (l, k) = 1, the number n has a divisor t ≡ l (mod k) in the interval exp exp( log k) < t < exp(k α ). Then 1 ξ(k) , where ξ(k) → ∞ (k → ∞), then if α = + log 2 log k A∗ (k, α) → 1 as k → ∞

(249)

The proofs use the law of iterated logarithms of Probability theory, as well as results from Probabilistic group theory. Let H (x, y, z) denote the number of integers n ≤ x, which have at least one divisor d satisfying y < d ≤ z. The first results on H (x, y, z) are due to S. Besicovitch, 364


these were sharpened and extended by Erdös in 1952 and Tenenbaum in 1981 (see e.g. [329] and the References therein). Their result is: 1 lim H (x, y, 2y) = (log y)−δ+o(1) , (y ≤ x 1−ε ), (250) x→∞ x where δ = 1 − log(e log 2)/ log 2 = 0.08607 . . . and ε > 0 is fixed. More generally, let F(x) be an irreducible polynomial with integer coefficients and of degree > 1. If HF (x, y, z) is the number of n ≤ x such that F(n) has at least a divisor d such that y < d ≤ z, then HF (x, y, 2y) = x(log y)−δ+o(1) (251) when x, y → ∞ and y ≤ x 1−ε . In [329] it is shown also that for any η > log 4 − 1, (252) HF (x, y, 2y) > x(log x)−η 1 when x, y → ∞ in the domain y ≤ x. 2 If 1 < y ≤ z < x, then in [331] it is proved that uniformly in x, y, z we have H (x, y, z) = x(1 + O(log y/ log z))

(253)

Further, for every ε > 0 and y ε z < x, for y > y0 (ε) we have x − H (x, y, z) εx(log y/ log z) (254) √ When 3 ≤ y ≤ z ≤ x, in 1984 Tenenbaum proved (see [332]) that if z = y + y(log y)−β with a fixed β ≥ 0, then H (x, y, z) = x(log x)−G(β)+o(1) ,

(255)

where



1+β  1+β log − 1 + 1, if β < log 4 − 1 G(β) = log 2 log 2  β, if β ≥ log 4 − 1. When β = log 4 − 1 + ξ/ log log y, Hall and Tenenbaum [174] were able to show that H (x, y, z) x(log y)−G(β) (1 + max{−ξ, 0})−1 (256)

uniformly in ξ ≥ −C(log log y)1/6 for any positive constant C. When y = eu , z = eu+1 one has a connection with Hooley’s function ; in this case one has (see [332]): 1 Uniformly for 3 ≤ u ≤ log u, 2 H (x, y, z) = H (x, eu , eu+1 ) = xu −δ exp(O log u log log u) (257) where δ = 0.08607 . . . 365

CHAPTER 4

13

Divisor density and distribution (mod 1) on divisors

We shall consider the notions of divisor density of a sequence, due to R. R. Hall [170], [171], as well as that of distribution (mod 1) on divisors, due to I. Kátai [205]. A sequence A has divisor density D A = z, if there is a sequence of integers S of asymptotic density 1 such that for d(n, A) = car d{d|n : d ∈ A} one has d(n, A) ∼ zd(n) as n → ∞ for n ∈ S (258) (χ A (n)−z)/4(n) ·n, where χ A is the characteristic function Let gk (x, A) = n<x,k|n

of the set A, and (n) is the number of prime divisors of n, counted with multiplicity. G. Tenenbaum [333] has shown that a necessary and sufficient condition for a sequence A to have divisor density D A = z is that |gk (x, A)| = o( log x) as x → ∞ (259) k<x

For example, the set A z,α = {d : (log d)α ≤ z (mod 1)} has divisor density z for all real α > 0 and all 0 < z < 1; i.e. the function f (x) = (log x)α is equidistributed (mod 1) with respect to divisors, conjectured by Hall. In fact, it was Kátai who first studied equidistribution on divisors of an additive arithmetic function satisfying for all 0 ≤ z ≤ 1, car d{d|n : f (d) ≤ z

(mod 1)} = (z + o(1))d(n).

Kátai proved that an additive function f satisfies this property iff ν f ( p) 2 / p = +∞ (ν = 1, 2, . . . )

(260)

p prime

where x denotes the distance of x to the nearest integer. For an arbitrary arithmetic function f , (259) has the following consequence: e(ν f (n)) = o( log x) (ν = 1, 2, . . . ) (261) n4(n) n<x k<x n≡0

(mod k)

where e(x) = exp(2πi x), is the necessary and sufficient condition for a function f to be equidistributed on divisors. For the function f (x) = (log log x)α , with α > 1, see [170], for f (x) = θ x (θ ∈ R \ Q), see [94]. Another function, f (x) = x α for α ∈ R+ \ N was studied by Hall and Tenenbaum. 366


14

The fractal structure of divisors

When d runs through the divisors of a typical integer n, the numbers log d/ log n exhibit a fractal-like behaviour on the unit interval. This has been studied in 1993 by M. Mendès France and G. Tenenbaum [258]. More generally, consider a dynamical system of points X = (X n )n≥1 , where for each n, X n = {0 = x0(n) < x1(n) < · · · < xk(n) = 1} with kn → ∞ as n → ∞. n Let ε = (εn )n≥1 such that εn → 0 as n → ∞, and put s(ε) = s(ε, X ) = lim sup n→∞

log(1/εn ) log kn

Let ε(α) = ε(α, X ) = (kn−α )n≥1 for α > 0, and consider # (n) 1 1 (n) x j − εn , x j + εn ∩ [0, 1] µn = µn (εn ) = meas 2 2 0≤ j≤kn where meas is the Lebesgue measure on R. The degree of resolution de X via ε is defined by g(ε, X ) = lim sup n→∞

log(µn /εn ) , log kn

while the resolution function on R+ is defined by ρ(α) = ρ(α, X ) = π(ε(α), X ) = where π(ε, X ) = lim sup n→∞

1 g(ε(α), X ), α

(262)

log(µn /εn ) log(1/εn )

Since µn ≤ min{1, εn kn }, one has

1 g(ε, X ) ≤ min{1, s(ε)}, ρ(α, X ) ≤ min 1, α

(α > 0)

(263)

When the function ρ(α) is constant on an interval (0, α0 ], then the value of ρ(α) for 0 < α ≤ α0 , will be called as the fractal dimension of X . By (263), clearly, 0 ≤ dim f X ≤ 1 367

CHAPTER 4

On the other hand, in order to introduce another dimension, for α ∈ [0, 1] put (n) α Hn (α, X n ) = (x j+1 − x (n) j ) 0≤ j0

Let now Dn =

log d : d|n log n

(n = 2, 3, . . . )

(266)

A subsequence {Dn : n ∈ A} of (266) will give a system D = D(A) Then Mendès France and Tenenbaum prove that there exists a sequence A of density 1 such that for all α > 0, 1 ρ(α, D(A)) = min log 2, (267) α so there exists a sequence A of density 1 such that dim D(A) = log 2

(268)

Particularly, from (267), (268) it results that for a suitable sequence A of density 1 dim f D(A) = dim D(A) = log 2

(269)

If the distribution of the prime divisors of a typical integer n were sufficiently regular, then this dimension would be 1; the fact that this dimension is strictly less than 1 is therefore evidence of some degree of irregularity in the distribution of the prime divisors. 368


15

The divisor graphs

In what follows we will study graphs connected to the set of divisors of a number. Given a number n one can generate a graph D(n) that reflects the structure of divisors of n as follows. The vertices of the graph represent all the divisors of n, each vertex is labelled by a certain divisor. If r and s are two divisors of n and r > s, then there is an edge between the vertices s and r iff s divides r and the ratio r/s is a prime number (see K. R. Bhutani and A. B. Levin [26]). As in the theory of graceful graphs (see J. A. Gallian [140] for a survey on various graph labelings), we label such an edge by the difference r − s of the labels of its vertices. Let S D(n) and S D(n) denote the sum of the labels of all edges, and all edges except the ones terminating at n, respectively. It is immediate that

n (270) n− S D(n) = S D(n) − p p|n where p denotes a prime. If n = p1a1 . . . prar is the prime factorization of n, then r S D(n) = ( piai − 1)

i=1

1≤ j≤k, j =i

a +1

pj j

−1

pj − 1

(271)

A number n is called graceful if S D(n) = n

(272)

In [26] it is shown that n is graceful iff n = 4q, where q is an odd prime. (273) As a corollary, the only perfect number (see Chapter 1), which is graceful is 28. In a series of papers, beginning from 1995, E. Saias has studied another graph, called as the divisorial graph the graph of a relation R f defined on the positive integers by (274) a R f b ⇔ a|b or b|a Let R xf be the restriction of R f to the integers ≤ x. For such integers, another relation Rgx will be defined as a Rgx b ⇔ [a, b] ≤ x

(275)

where [a, b] denotes the l.c.m. of a and b. If n i R xf n i+1 for i = 1, 2, . . . , k − 1 and n i = n j for i = j, then n 1 , . . . , n k is said to be a chain of length k for the relation R xf . Let f (x) denote the maximum 369

CHAPTER 4

value of k, and define similarly a quantity for the relation Rgx . In [293] Saies proved that cx/ log x ≤ f (x) ≤ g(x) ≤ c x/ log x, x ≥ 2, (276) for certain positive constant c and c . In [113] Erdös and Saias considered the minimum number φ f (x) of chains for the relation R xf that are required in order that every positive integer ≤ x belongs to at least one such chain, and the corresponding number φg (x) for the relation Rgx . The analogues quantity when the chains for R xf , Rgx are pairwise distinct is denoted by φ ∗f (x), φg∗ (x), respectively. The following results hold true: c2 x c1 x ≤ φg (x) ≤ φ f (x) ≤ , log x log x

x ≥2

(277)

x , x ≥2 (278) 2 Let R(x) denote the maximum number of integers r ≥ 2 which can be written as n i+1 ni r= or r = for R xf . Then in [294] the double-inequality ni n i+1 √ √ (279) (1 − o(1)) 8x ≤ R(x) < 8x c3 x ≤ φg∗ (x) ≤ φ ∗f (x) ≤

is proved. Let f (x, y) (resp. g(x, y)) denote the maximum number of a union of y chains of R xf (resp. Rgx ). In a recent paper, Saias [295] shows that c3 x

log 2y log 2y ≤ f (x, y) ≤ g(x, y) ≤ c4 x for x ≥ y ≥ 1, log 2x log 2x

(280)

with c3 , c4 > 0 constants. For the graph Rgx , a t-chain of integers ≤ x of length k is a k-tuplet (a1 , a2 , . . . , ak ) of integers ≤ x, ai = a j for i = j, such that for all 1 ≤ i < k one has [ai , ai+1 ] ≤ xt. Let h(x, t) be the maximum length of a t-chain of integers ≤ x. Then c5 x

log 2t log 2t ≤ h(x, t) ≤ c6 x for x ≥ t ≥ 1, log 2x log 2x

(281)

where c5 , c6 are positive constants. This improves a result of C. Pomerance [277] to the effect that lim+ lim sup

a→0

x→∞

h(x, x a ) =0 x

370

(282)


We note that Erdös, Freud and Hegyvári [105] have shown that for all function o(1) one has h(x, x 1−o(1) ) ∼ x as x → ∞ (283)

4.3 1

Arithmetic functions associated to the digits of a number The average order of the sum-of-digits function

Let q > 1 be a fixed integer and denote by sq (n) the sum of digits of n written in base q, i.e. m sq (n) = ai (1) i=0

where n =

m

ai q i for some integer m and 0 ≤ ai < q, am > 0. We will write

i=0

s(n) = s10 (n) for the decimal expansion (i.e. when q = 10). This function occurs in many problems of Number theory or Mathematics. It is sufficient to mention the well known Legendre formula giving the exponent e p (n!) of a prime p in n! (see e.g. [177]): e p (n!) =

n − s p (n) p−1

(2)

For a similar result, which can be attributed to Kummer (see J. W. Sander [298])

we note that 2n = s2 (n), (3) e2 n

2n where denotes a binomial coefficient. (For prime factors of binomial coeffin cients or consecutive integers, see [260], Chapter 12). It was L. E. Bush [46] who first showed that q −1 x log x as x → ∞ (4) sq (n) ∼ 2 log q n≤x In 1949 L. Mirsky [259] proved that q −1 x log x + O(x), sq (n) = 2 log q n≤x

(5)

which is best possible as can be seen by taking x = (1 − q)q l . A weaker error term, namely O(x log log x) was discovered a year earlier by R. Bellman and H. N. 371

CHAPTER 4

Shapiro [20]. P. Cheo and S. Yien [54] have rediscovered (5), and further showed that if bm (x) = car d{y ≤ x : sq (y) = m}, then

1 log x m bm (x) ∼ as x → ∞ (6) m! log k M. P. Drazin and J. S. Griffith [76] have studied more generally the sum of kth powers of digits of n written in base q: m

sq,k (n) =

(7)

aik

i=0

for a positive integer k, and by putting Aq,k (n) =

n−1

sq,k (m),

δq,k =

m=1

n−1 1 mk , q m=1

Fq,k (n) − Aq,k (n) n log n , q,k (n) = log q nδq,k they proved that for all q, k, n one has: Fq,k (n) = δq,k

q,k (n) ≥ 0,

2,k (n) < 1,

(8)

and for all q > 3,

q − 1 log(q − 1) · (9) q −2 log q For q = 2 (when one obtains the most precise results), these have been rediscovered by M. D. Mc Ilroy [186] as well as by I. Shiokawa [308]. For results on Aq,k (n) when q = 2 and k ≥ 0 see also K. B. Stolarsky [319]. In 1968 J. R. Trollope [344] discovered the following result. Let g(x) be periodic of period one and defined on [0, 1] by  1 1   x, if 0 ≤ x ≤   2 2 g(x) =     1 (1 − x), if 1 < x ≤ 1 2 2 q,k (n)
1, and s (n) denotes f (m i ) (where for the integer n, |σ i−1 (m i )| i=1

i=1

is the unique admissible representation of n, and f an application from A∗ to R). Dumont and Thomas prove that there exist a real number α and the functions G k,h with 1 f (s (n) − αl)2k = (2k − 1)(2k − 3) . . . 1 · β k l k + x n<x l h G k,h (l) + η(x), (16) + h 1, lim sup sq ( pn ) = +∞, n→∞

379

(39)

CHAPTER 4

where pn denotes the nth prime number. (39) implies that s1 ( pn+1 ) > sq ( pn ) for infinitely many n

(40)

In 1962 P. Erdös [104] solves an open question by Sierpinski, namely sq ( pn ) > sq ( pn+1 ) for infinitely many n

(41)

By assuming Schinzel’s H -Hypothesis, in [310] it is shown also that sq ( pn ) > sq ( pn+1 ) > sq ( pn+2 ) for infinitely many n;

(42)

sq ( pn ) = sq ( pn+1 ) = sq ( pn+2 ) for infinitely many n

(43)

and A. Schinzel has shown (see [310]) that accepting the H -hypothesis, for each given positive integer m, there exist positive integers n 1 , n 2 and n 3 such that s1 ( pn 1 +1 ) < s1 ( pn 1 +2 ) < · · · < sq ( pn 1 +m ) sq ( pn 2 +1 ) = sq ( pn 2 +2 ) = · · · = sq ( pn 2 +m ) sq ( pn 3 +1 ) > sq ( pn 3 +2 ) > · · · > sq ( pn 3 +m )

(44)

It is interesting to note that the proof of (41) is based on a strong theorem on the distribution of primes (Hoheisel-Ingham theorem on π(x), see [260]), and an elementary proof is missing. I. Shiokawa [309] proved that for all q > 1, 1 x sq ( p) = (q − 1) (45) + O(x(log log x/(log x))1/2 ) 2 log q p≤x where p runs through the primes. I. Kátai [207] was able to show that k sq ( p) − q − 1 log x x(log x) k2 −1 , 2 log q p≤x

(46)

where k is a positive integer. For k = 1 this improves relation (45). E. Heppner [180] considered, more generally the values of sq (n) for n ∈ B, where B ⊂ N is a subset of positive integers. Let B(x) be the counting function of B, and assume that log(x/B(x)) = o(log x). Then  

1/2  x       log log x + log      q − 1 log x B(x)    sq (n) = · B(x) 1 + O       2 log q log x   n≤x,n∈B     (47) 380


For B = { p1 , p2 , . . . , pn , . . . } (i.e. the sequence of primes), all conditions are satisfied and (47) gives (45). For the prime values taken by sq (n), R. Warlimont [347] proved that car d{n ≤ x : sq (n) = prime}

4

x . log log x

Niven numbers An integer n is called a Niven number if (48)

s(n)|n,

i.e. if it is divisible by its (base 10) digital sum. These numbers were first considered by I. Niven [266] at a Conference on number theory. In fact this concept was introduced and investigated by R. Kennedy, T. Goodman and C. Best [217] and R. Kennedy [214]. Some examples of Niven numbers are 8, 12, 180, 4050. The set N of these numbers is clearly infinite since 10k ∈ N for any k = 1, 2, . . . Let N (x) be the number of elements of N not exceeding x. The natural density of Niven numbers is zero; that is N (x) =0 (49) lim x→∞ x This was shown in 1984 by R. E. Kennedy and C. N. Cooper [215]. Another proof by them can be found in [62], where general conditions are given for a set to have natural density equal to zero. Let Nk = {n ∈ N : s(n) = k}. Then (see C. N. Cooper and R. E. Kennedy [63]) Nk (x) ∼ C(k)(log x)k

(x → ∞)

(50)

which was a partial answer to the determination of the asymptotic formula for N (x). For similar particular results, see [64]. The first nontrivial bounds for N (x), by elementary methods are due to J.-M. De Koninck and N. Doyon [226]: For given ε > 0, x 1−ε N (x)

x log log x log x

(51)

Later, using complex variables as well as probabilistic arguments, De Koninck, Doyon and Kátai [228] have deduced that x (52) N (x) = (c + o(1)) log x where c =

14 log 10 = 1.1939 . . . 27 381

CHAPTER 4

Let T (x) denote the number of Niven number n ≤ x such that n + 1 is also a Niven number. Recently De Koninck and Doyon [227] showed that T (x)

x log log x (log x)2

(53)

Let T = {n ∈ N : n + 1 ∈ N }. Then (52) implies 1

< +∞,

(54)

1 = (c + o(1)) log log x, n

(55)

n∈T

n

while (52) implies that n≤x,n∈N

where c is the same as in (52). Consecutive Niven numbers have been first studied by Kennedy [214] where it was shown that no more than 21 consecutive Niven numbers is possible. Later, Cooper and Kennedy [65] replaced 21 with 20, and showed in fact the existence of infinitely many such sequences. This result is best possible. (56) Let q > 1. In 1994 H. G. Grundman [160] defined a q-Niven number n as satisfying sq (n)|n (57) For q = 10 one obtains the usual Niven numbers. Grundman proved that the length of a sequence of consecutive q-Niven numbers is at most 2q. (58) He found also the smallest sequence of 20 consecutive Niven numbers, and conjectured that there exists a sequence of consecutive q-Niven numbers of length 2q for each q > 1. (59) For q = 2, 3, T. Cai [47] showed that there exists an infinite family of sequences of consecutive q-Niven numbers of length 2n. (60) De Koninck and Doyon [227] denote by n k the smallest positive integer n such that the interval [n, n + k − 1] does not contain any Niven number (k ≥ 1 given), and prove: n k < (100(k + 2))k+3 (61) For each l ∈ [2, 20] let Tl (x) = car d{n ≤ x : n + 1, n + 2, . . . , n + l − 1 are all Niven numbers}. De Koninck and Doyon conjecture that Tl (x) 382

x loglx

(62)


A number n is called all-Niven (see E. Weisstein [351]) if sq (n)|n for all q > 1. Then A. Kertesz proved that the only all-Niven numbers are 1, 2, 4 and 6. (63) Another special Niven numbers are the so-called sum-product numbers n for which n = s(n) · a(n), where a(n) = product of digits of n. E.G. 135 = (1 + 3 + 5) · (1 · 3 · 5). D. Wilson (see [312] (sequence A038369), [352]) proved that there are only three such numbers, namely 1, 135 and 144. (64)

5

Smith numbers

Let 1 < n = p1a1 . . . prar (r ≥ 2) be the prime factorization of the composite number n. A. Wilansky [354] defined n to be a Smith number if s(n) = a1 s( p1 ) + · · · + ar s( pr ) = S p (n)

(65)

i.e. numbers whose digit sum is equal to the sum of the digits of its prime factors (counted with multiplicity). For example, 493775 = 3 · 52 · 65837 is a Smith number, since 4 + 9 + 3 + 7 + 7 + 5 = 3 + 2 · 5 + 6 + 5 + 8 + 3 + 7(= 42). The first few such numbers are 4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, . . . (see [312], sequence A006753). Wilansky found 360 Smith numbers n ≤ 105 , and S. Oltikar and K. Wayland [268] have noted that relatively large Smith numbers are easily generated from primes whose digits are all 0’s or 1’s, but only a small number of such primes are known. In 1987 W. L. Mc Daniel [70] proved the existence of infinitely many Smith numbers. (66) Mc Daniel introduced also the concept of a k-Smith number which satisfies S p (n) = k · s(n),

(67)

where S p (n) is defined in (65). For example, n = 104 = 23 · 13 is a 2-Smith number as S p (104) = 10 = 2 · s(104). The number n = 402 = 2 · 3 · 67 is 3-Smith, and there are 21 2-Smith numbers, three 3-Smith numbers, one 7-Smith number, etc. for n ≤ 1000. There are infinitely many k-Smith numbers (see [70]). (68) For tables on k-Smith numbers, see [312] (e.g. sequences A050224 for k = 2 and A050225 for k = 3). Let Rn be the nth repunit number. It seems that the largest Smith number is (see [353]) (69) 9 · R1031 · (104594 + 3 · 102297 + 1)1476 · 103913210 For special sets of Smith numbers, see S. Yates [356], [357], Mc Daniel [71], Mc Daniel and Yates [72] (where one can find extensions to base q > 1, too). 383

CHAPTER 4

R. L. Bishop [29] says that n is a Smith-Jones number, if s(n) ≡ S p (n) (mod 9) p1a1

(70)

Let p1 and q1 be such numbers that s( p1 ) = s(q1 ), and suppose that n = . . . prar is a Smith-Jones number. Then m = q1 p2a2 . . . prar is also a Smith-Jones number. (71) If a composite number n satisfies s(n) = s( p1 ) + · · · + s( pr )

(72)

(in place of (65)), then it is called a hoax number, see [312], sequence A019506. The first few hoax numbers are 22, 58, 84, 85, 94, 136, 160, . . . Are there infinitely many? Consecutive Smith numbers (n, n + 1) are also called Smith brothers. The first few Smith brothers are (728, 729), (2964, 2965), (3864, 3865), (4959, 4960), . . . It is not know if there exist infinitely many such pairs. By making investigations with a computer, J. L. James [193] conjectures that there do not exist Smith numbers which are perfect numbers. Monica sets and Suzanne sets are defined in M. Smith [313]. For example, let Sn = {m composite : n|s(m) and n|S p (m)},

(73)

where S p is defined by (65). Then Sn is called the nth Suzanne set. Every Suzanne set has an infinite number of elements. (74) Similarly, let Mn = {m composite : n|s(m) − S p (m)} Then Mn has an infinite number of elements, Mn ⊂ Sn , and if m is a Smith (74 ) number, then m ∈ Mn for all n. If m is a k-Smith number, then m ∈ Mk−1 .

6

Self numbers

In 1963 D. R. Kaprekar [202] introduced the concept of a self-number. Let q > 1 be fixed integer. Then a positive integer n is called to be a q-self-number if the equation n = m + sq (m) (75) has no solution in positive integers m. Otherwise, it is called a q-generated number. In 1973 V. S. Joshi [200] proved that if q is odd, then n is a q-self number iff n is odd. Every even number in an odd base is a generated number. (76) 384


This property appears also in Solution of Problem E2408, see [282]. The set of q-self numbers is infinite, and its asymptotic density exists, and is positive (when q 1 is odd, by (76) this density is ). (77) 2 More general results are treated by R. Guaraldo [164]. In part II of [164], the above density is explicitly calculated for all bases q > 1. For example, when q = 10, the density is approximately 0.9022222 . . . (78) When q = 2, a more precise result has been obtained by U. Zannier [359]: car d{n ≤ x, n = 2 − self-number} = L x + O((log x)s2 ([x]))

(79)

where L > 0; car d{n ≤ x, n = 2 − generated} = L x + O(log2 x)

(80)

More general results for the number of solutions of m + sq (m) ≤ x are proved by M. B. S. Laporta and E. Laserra [240]. For example, when b is odd, a is arbitrary, car d{m + sq (m) ≤ x, m + sq (m) ≡ a

(mod b)} =

L x + O(x µ ), b

(81)

where L is as in (80), and 0 < µ < 1. R. B. Patel [271] proved that n = 4q + 2 is a q-self-number iff 2|q, q ≥ 4; 2q is a q-self-number in every even base q ≥ 4; q 2 + 2q + 1 is a q-self-number in an even base q ≥ 4; 3q + 1 is a q-self-number iff 2|k, k ≥ 4; q 2 + 3q + 2 is a q-self-number iff 2|q, q ≥ 4. (82) For other classes, see also T. Cai [48]. An integer n is said to be universal generated if it is q-generated for every base q ≥ 2. E.g. 2, 10, 14, 22, 38, 60, . . . are such numbers. Let G(x) be the counting function of universal generated numbers. Then (see T. Cai [48]) √ G(x) ≤ 2 x (83) A generalization of q-self-numbers can be found in [164], part I. Let n =

m i=0

ai q i

be the unique representation of n in base q. Let f (a, i) be a nonnegative, integervalued function of the digit a, and the place where the digit occurs. m f (ai , i), and let Put s f (n) = i=0

T f (n) = n + s f (n),

R f = {n : n = T f (x) for some x},

C f = {n : n = T f (x) for any x}. 385

CHAPTER 4

A number n is f -self-number iff n ∈ C f , and it is a f -generated number, iff n ∈ Rf. Let f (a, i) satisfy the following conditions: f (0, i) = 0

(i = 0, 1, 2 . . . )

f (a, i) = o(q i ) for 1 ≤ a ≤ q − 1

(84) (85)

Then the density of f -generated numbers exists. When f depends only on a (1 ≤ a ≤ q − 1), and f (0) = 0, then the density L f exists, and L f < 1 if and only if the application T f is not one-one. (86) It is interesting to note that if one assumes only the second condition of (84), then the density may not exist. Let e.g. f (a, i) = 0 if i is even; = q i if i is odd. Then the density of R f doesn’t exist. Now, a result of different nature is the following ([164], I): If f (a, i) = O(q i /i 2 log2 i) for all a, (87) (88) then the density of R f exists. Similar results hold true, when considering ”factorial base” in place of the q-adic expansion. It is known that (see e.g. G. Faber [120]) n may be uniquely represented in the form n = a1 · 1! + a2 · 2! + · · · + am · m! (0 ≤ ai ≤ i). Let f (a, i) be a nonnegative integer-valued function of i for each ”digit” a, 0 ≤ a ≤ i (i = 1, 2, . . . ) and define s f (n), T f (n), R f , C f as above. Now, in place of (84) assume that (see [164], III) f (0, i) = 0

(i = 1, 2, . . . )

f (a, i) = o(i!) uniformly in i(i.e. sup{ f (a, i), 0 ≤ a ≤ i} = o(i!)).

(89)

Then the density of R f exists. (90) As a corollary, one obtains that if f (a, i) = F(a) depends only on a, and F(0) = 0, F(a) = o(i!) uniformly in i for all ”digits” a, then the density of R f exists, and (91) this density is < 1 iff T f is not one-one. In the case F(a) = a (when T f (n) = n+ sum of ”digits” of n), the density of R f is 0.879888 . . . (92) Similarly, assume that f (a, i) = O(i!/i 2 log2 i) uniformly in i Then the density of R f exists. More general base expansions will be considered in further sections. 386

(93) (94)


7

The sum-of-digits function in residue classes

The distribution of sq (n) in residue classes was first studied by A. O. Gelfond [141], who for N ∈ N and r ∈ Z considered the sets Sr,m (N ) = {n < N : sq (n) ≡ r

(mod m)}

where q, m ∈ N are fixed positive integers, q ≥ 2, (m, q − 1) = 1. Then 1 1 car d Sr,m = (95) lim N →∞ N m for all r , i.e. Sr,m is equidistributed in residue classes mod r . See also M. N. J. Fine [125]. Gelfond conjectured that the joint distribution of sum of digit functions with different bases satisfies N + O(N λ ) m1m2 (96) for a certain λ < 1, where (m 1 , q1 − 1) = 1, (m 2 , q2 − 1) = 1 and r1 , r2 ∈ Z. In 1972 J. Bésineau [25] showed that the main term in (96) is true (i.e. the left N as N → ∞). side ∼ m1m2 In 1999 D.-H. Kim [218] proved completely Gelfond’s conjecture in the general context of q-additive functions. A function f is called q-additive if f (0) = 0 and f (aq k + b) = f (a) + f (b) for all integers a ≥ 1, k ≥ 1 and 0 ≤ b < q k . This notion is due to Gelfond [141]. Let q = (q1 , . . . , ql ) and m = (m 1 , . . . , m l ) be tuples of integers with q j , m j ≥ 2 and (qi , q j ) = 1 for i = j. For each j ∈ {1, . . . , l} let f j be a q j -additive function with integer values and let f = ( f 1 , . . . fl ). Further, let F = (F1 , . . . , Fl ) and d = (d1 , . . . , dl ) be defined by F j = f j (1) and car d{n < N : sq1 (n) ≡ r1 (mod m 1 ), sq2 (n) ≡ r2 (mod m 2 )} =

d j = gcd(m j , (q j − 1)F j , f j (r ) − r F j (2 ≤ r ≤ q j − 1)) Let f (n) = b (mod m) mean that f j (n) = b j (mod m j ) for each j. We call a tuple b of integers admissible with respect to q, m and f if the system of congruences Fn ≡ b

(mod d)

has a solution. Now, Kim’s result can be stated as follows: N /A + O(N λ ), if b is admissible, car d{n < N : f (n) ≡ b (mod m)} = 0, otherwise (97) 387

CHAPTER 4

as N → ∞, where λ = 1 − 1/(120l 2 (max q j )3 (max m j )2 ) and A = car d{b : 0 ≤ b j < m j , b admissible}. The implied constant depends only on l and q. In 1996 C. Mauduit and A. Sárközy [254] proved an Erdös-Kac theorem for the distribution of sq (n) in residue classes: 1 car d S (N ) car d{n ∈ Sr,m (N ) : ω(n) − log log N ≤ x log log N } − φ(x) = r,m =O

log log log N log log N

,

(98)

where φ(x) denotes the normal law. Other versions can be found in [255] and in J. M. Thuswaldner [336]. For systems of q-additive functions, J. M. Thuswaldner and R. F. Tichy [341] defined q, b, m and f as in (97). Let M(N ) = {n < N : f (n) ≡ b

(mod m)},

and assume that d = (1, . . . , 1). Then (98) holds for Sr,m (N ) replaced with M(N ), uniformly for all real x and N ≥ 8. (99) For the distribution in residue classes of the sum of digits function in number fields, see J. M. Thuswaldner [337]. The function sq (n) in number fields will be studied later. The theory of q-additive functions of Gelfond has been extended by J. Coquet [67]. Let Q = {Q j } j≥0 be a sequence of strictly increasing positive integers with Q 0 = 1 such that Q j |Q j+1 for all j. Note that the sequence Q is uniquely determined by the factors q j = Q j+1 /Q j . Is it easily seen that each nonnegative integer n has a unique ”base-Q” representation of the form n = a j (n)Q j , where the j≥0

”digits” a j (n) satisfy 0 ≤ a j (n) < q j . For example, for Q j = ( j + 1)! one obtains the factorial representation (see (89)), while for Q j = q j one has the ordinary base-q representation. For other particular cases, see e.g. A. Fraenkel [131] and the references therein. This representation is also called Cantor representation, since Cantor considered essentially the case Q j = a(0)a(1) . . . a( j), where a(0) = 1, a(i) ≥ 2 for i ≥ 2 are positive integers. For results on the sum-of-digits function in this case, see P. Kirschenhofer, H. Prodinger and A. F. Tichy [221]. 388


Given a system Q, Coquet defined a Q-additive function f : N → C to be a function of the form f (n) = f j (a j (n)) where n = a j (n)Q j is the basej≥0

j≥0

Q representation of n, and the component functions f j are functions defined on {0, 1, . . . , q j − 1} and satisfying f j (0) = 0. Set µ j = 1 − max r

σ j = max

1≤N ≤q j

1 car d{0 ≤ n < q j : f j (n) ≡ r qj

(mod m)} and (100)

1 car d{0 ≤ n < N : f j (n) ≡ 0 (mod m)} N

We call f j uniformly distributed mod m if, for every integer r , 1 car d{0 ≤ n < q j : f j (n) ≡ r qj

(mod m)} =

1 m

We say that an arithmetical function f has a limit distribution mod m, if for each integer r , the limit lim

N →∞

1 car d{0 ≤ n < N : f (n) ≡ r N

(mod m)}

(101)

exists. If each of the limits (101) is 1/m, we say that f has a uniform limit distribution mod m (or that the set in (101) is equidistributed in residue classes mod r (see (95)). The following theorem is due to A. Hoit [183]. Let f be an integer-valued Qadditive function, and let m be a prime. Then the function f has a uniform limit distribution mod m iff at least one of the following conditions holds: (i) For some j, f j is uniformly distributed mod m; ∞ µ j = +∞ (ii)

(102)

j=0

The function has a (non-uniform) limit distribution mod m iff the following three conditions all hold: (i’) There is no j for which f j is uniformly distributed mod m; ∞ µ j < ∞; (ii’) j=0

(iii’)

lim σ j = 0,

j→∞

where µ j and σ j are defined by (100). 389

(103)

CHAPTER 4

For example, let f (n) = sum of digits with prime indices in the base-Q representation of n. Then f has a uniform limit distribution mod n. Let f (n) = sum of prime digits in the factorial representation of n. This function has also a uniform limit distribution mod m. If Q j = (( j + 1)!)2 , and f (n) = number of digits 1 in this representation, then f has no limit distribution mod n. (In all examples, m = prime.) E. Fouvry and C. Mauduit [130], by studying the problem of existence of almost primes in sets of integers generated by finite automata, have proved that the sets {n : s2 (n) ≡ r

(mod m)}

x below x) with at log x most two prime factors. (104) If M is a set of residue classes (mod m), and car d M ≥ 0.722q, then there are (105) infinitely many primes p such that the residue of s2 ( p) (mod n) is in M. (m ≥ 1, r integers) contain infinitely many numbers (even

8

Thue-Morse and Rudin-Shapiro sequences

In 1906 A. Thue [335] (see also J. Berstel [22]) initiated the study of what is now called combinatorics on words with his results on repetitions in words. We say a nonempty word w is a square if it can be written in the form x x for some word x. (For example: murmur in English, chercher in French, or mama in Hungarian). We say that w is an overlap if it can be written in the form axaxa for some word x and single symbol a. Thue explicitly constructed an infinite word on two symbols that is overlap-free, that is, contains no subword that is an overlap. He also constructed an infinite word on three symbols that is square-free, i.e. contains no subword that is a square. Thue’s constructions are based on what is now called the Thue-Morse sequence (in terms of its blocks) t = t (0)t (1)t (2) · · · = 0110100110010110 . . .

(106)

where t (n) = s2 (n) (mod 2) for all n ≥ 0. Thue proved that t is overlap-free. Since Thue’s pioneering work, many other investigators have studied overlap-free words or their generalizations. Thue’s construction was rediscovered by M. Morse [261], who used it in a construction in differential geometry. The chess master M. Euwe [119] rediscovered Thue’s construction in connection with a problem about infinite chess games. In 1980 E. D. Fife [124] described all infinite overlap-free binary sequences. P. Sée´ bold [304] proved the remarkable result that t is essentially 390


the only infinite overlap-free binary sequence which is generated by iterating a morphism. (107) J. P. Allouche and J. Shallit [9] proved that the sequence tq,m = (sq (n) (mod m))n≥0 over the alphabet m = {0, 1, . . . , m − 1} is overlap-free if and only if m ≥ q (where q ≥ 2, m ≥ 1 are integers). (108) A palindrome is a word that is equal to its reversal (e.g. radar). Allouche and Shallit prove also that tq,m always contains arbitrarily long squares. It contains arbitrary long palindromes iff m ≤ 2. (109) The sequence tq,m is ultimately periodic, iff m|(q − 1), (110) a result due to P. Morton and W. J. Mourant [262]. Overlaps, squares and palindromes in sequences have many applications in other fields. For example, in number theory they aid in proving the transcendence of real numbers whose base q expansion or continued fraction expansion have repetitions (see e.g. S. Ferenczi and C. Mauduit [123], M. Queffélec [281]). In statistical physics they are useful for studying the spectrum of certain discrete Schrödinger operators (see e.g. A. Bovier and J.-M. Ghez [33], or A. Hof, O. Knill and B. Simon [182]). For Thur-Morse like sequences, see also J. Grytczuk [162]. Closely related to the Thue-Morse sequence is a sequence c defined to be lexicographically least sequence of positive integers satisfying n ∈ c ⇒ 2n ∈ c. Equivalently, c is defined inductively by c0 = 1 and ck + 1, if (ck + 1)/2 ∈ c, (111) ck+1 = ck + 2, otherwise This sequence appeared in a problem by C. Kimberling [219]. Define the sequence (dk ) by dk = ck − ck−1 for k ≥ 0 (c−1 = 0) Writing the Thue-Morse sequence in terms of its blocks

t = 011010011 · · · = 0d0 1d1 0d2 1d3 . . . , one obtains a sequence (dk ). Then the following surprizing fact is true (see J. P. Alloche et al. [6]): dk = dk for all k ≥ 0 (112) The generating function of the sequence c is k≥0

ck x k =

1 (1 − x 2e j )/(1 − x e j ) 1 − x j≥1 391

(113)

CHAPTER 4

where e1 = 1,

e j+1 =

2e j + 1, if j is even 2e j − 1, otherwise

(answering a problem by S. Plouffe and P. Zimmermann [275]). In n ∈ c, let r (n) be its rank, i.e. satisfying cr (n) = n Then r (n) =

2n + O(log n), 3

(114)

2n infinitely often. and r (n) takes the value 3 As a corollary, one has (see [6]): ck =

3k + O(log k), 2

(115)

3k and ck = infinitely often. 2 For a recent new generalization of the sequence t, see U. Astudillo [12]. Let now tn = (−1)s2 (n) , and for any positive integer k and i ∈ Z denote Sk,i (n) =

t j

0≤ j 0 (116) More precisely, he proved that S3,0 (n) 3α log 3 < < 5 · 3α with α = α 20 n log 4 In 1983 J. Coquet [68] provided an explicit precise formula for S3,0 (n) by the use of a continuous, nowhere differentiable function ψ3 (x), of period 1:

ε(n) log n α , (117) S3,0 (n) = n ψ3 − log 4 3 where α =

log 3 , and ε(n) ∈ {−1, 0, +1}. log 4 392


The general case has been investigated by J. M. Dumont [91], and S. Goldstein, K. A. Kelly and E. R. Speer [146]. For example, when k = p (prime), in [146] it is proved that by denoting by Sk (n) the column vector with entries Sk,i (n), one has

log n α + ε(n), (118) Sk (n) = n φ r s log 2 log λ1 , where λ1 is the s log 2 largest eigenvalue of a certain matrix M satisfying Sk (2s n) = M Sk (n) with s being the multiplicative order of 2 (mod p). Moreover, ε(n) = O(n β ) with β < α. By using the method of Goldstein, Kelly and Speer, in 1999 M. Drmota and M. Skalba [86] have studied the sum Sk,i (y, n) = y s2 ( j) where φ : R → R p is continuous of period 1, and α =

j 1, and V (m) that corresponding to those eigenvalues with maximal modulus. Furthermore, let P (0) , P (s) , P (1) , P (u) and P (m) denote the orthogonal projections on V (0) , V (s) , V (1) , V (u) and V (m) , respectively. Then there exists a continuous function F(y, ·) : R+ → V (u) satisfying F(y, 2s x) = M(y)F(y, x) (x > 0), and Pu Sq (y, n) = F(y, n). Consequently Sq (y, n) = F(y, n) +

O(1) if V (1) = {0}, O(log n) if V (1) = {0}

Let |λl (y)| > 1. Then G l (y, t) = λl (y)−t Pl F(y, 2st ) is a continuous function log λl (y) G l (y, ·) : R → V1 which satisfies G l (y, t + 1) = G l (y, t). With αl (y) = s log 2 we obtain the fractal representation for Sq (y, n):

log n + O(log n) (120) Sq (y, n) = n αl (y) G l y, s log 2 |λ (y)|>1 l

Let Ak,i,r,m (n) = car d{ j < n : j ≡ i

(mod k), s2 ( j) ≡ m

and Ar,m (n) = car d{ j < n : s2 ( j) ≡ m Then

(mod r )}

1 Ar,m (n) + Rk,i,r,m (n) k Newman’s theorem (116) can be rewritten as Ak,i,r,m (n) =

A3,0,2,0 (n) > A3,0,2,1 (n) 394

(mod r )}


Dumont proved also that (see [91]) A3,1,2,0 (n) < A3,1,2,1 (n) for almost all n ≥ 0 Drmota and Skalba [86] discuss the following two kinds of positivity phenomena: (N1) Ak,0,r,0 (n) > max Ak,0,r,m (n) for almost all n ≥ 0; 0<m 0 for almost all n ≥ 0. They prove the following results: Let k be an odd multiple of 7, and suppose that r = 3. Then (N1) and (N2) hold. (121) Let k, r be positive integers such that k is odd, and r ≥ 2. If s = or dk (2) and r are coprime or if there exists an integer r > 0 such that λl (ζrm )r < 0 for those λl (ζrm ), 0 < l < k, 0 < m < r , with minimal modulus, then (N1) and (N2) fail. (122) Let Pt (t ≥ 1) denote the set of those primes p where the order or d p (2) of 2 is p−1 equal to . t For any r > 1 there exists a constant Cr > 0 such that for any t ≥ 1 primes q ∈ Pt satisfying (N1) or (N2) are bounded by q ≤ Cr t 4 log4 t

(123)

A2r −1,0,r,0 (n) > max A2r −1,0,r,m (n) for almost all n

(124)

The inequality 0<m 0 for almost all n ≥ 0

(125)

For the positivity of Sk,0 (n), we have: Suppose k is divisible by 3, or k = 4 N + 1. Then Sk,0 (n) > 0 for almost all n. The only primes p ≤ 1000 satisfying S p,0 (n) > 0 for almost all n are p = 3, 5, 17, 43, 257, 683. There exists a constant C > 0 such that for any t ≥ 1 and primes p ∈ Pt satisfying S p,0 (n) > 0 for almost all n are bounded by p ≤ Ct 2 log2 t. Furthermore, the total number of primes p ≤ x with S p,0 (n) > 0 for almost all n is o(x/ log x) as x → ∞. (126) 395

CHAPTER 4

n+1 s2 (n) n + 1 , where is a For results on the twisted sum (−1) p p Legendre symbol, see another paper by Drmota and Skalba [87]. P. J. Grabner, T. Herendi and R. F. Tichy [150] study the case p = 17, and use these functions to generate a special code: the analysis of this code shows that it is exponential, extremely redundant and thus strongly error correcting with a linear decoding procedure. The Rudin-Schapiro sequence (a(n)) is defined by a(k) = (−1)e(k) where e(k) =

s−1

εi εi+1 and k =

s

i=0

εi ei with εi ∈ {0, 1} (i.e. the number of con-

i=0

secutive 11-s in the binary expansion of k). In fact, a(2k) = a(k), a(2k + 1) = (−1)k a(k) for k ≥ 0, where a(0) = 1. J. Brillhart and P. Morton [42] have studied the sequences A(n) =

n

B(n) =

a(n),

k=0

(−1)k a(n).

k=0

They proved that " A(n) √ 3 < √ < 6, 5 n

n

B(n) √ 0≤ √ < 3 n

(n ≥ 1)

(127)

0 /"

3 √ B(n) A(n) , √ are dense in the intervals , 6 , resp. √ 5 n n

and that the sequences √ [0, 3]. (128) J. Brillhart, P. Erdös and P. Morton [41] have defined the continuous versions by A(x) =

[x]

B(x) =

a(k),

k=0

[x] (−1)k a(k) k=0

They defined also the functions A(4k x) λ(x) = lim √ , k→∞ 4k x

B(4k x) µ(x) = lim √ k→∞ 4k x

which are defined for x > 0. These limits exist for all x > 0, and one has µ(x) = √ 2λ(2x) − λ(x) and µ(4x) = µ(x). (129) The functions λ and µ are continuous on (0, ∞), √and in√fact the function λ maps both intervals (0, ∞) and [1, 4] continuously onto [ 3/5, 6]. 396


√ The function µ maps (0, ∞) and [1, 4] continuously onto [0, 3]. A real number x0 > 0 is called normal (to the base 4) iff the sequence (4n x0 )n≥0 is uniformly distributed modulo 1. If x0 > 0 is normal, then λ is not differentiable at x0 . Therefore, λ is nondifferentiable almost everywhere. (130) The cumulative distribution function is defined as follows. Let (u n ) be a sequence of real numbers contained in an interval J , and let α ∈ J . If D(x, α) denotes 1 the number of n ≤ x for which u n ≤ α, and if the limit lim D(x, α) = D(α) exx→∞ x ists, then the sequence (u n ) is said to have the distribution D(α) at α. D(α) is called the cumulative distribution function of (u n ).

A(n) For the sequence √ the following is true: n

A(n) doesn’t exist at any point of The cumulative distribution function of √ n "

√ 3 √ B(n) , 6 . Similar result is true for √ (131) on (0, 3). 5 n The logarithmic distribution function is defined similarly by introducing 1/n L(x, α) = 1≤n≤x,u n ≤α

and considering 1 L(x, α) = L(α). x→∞ log x lim

If this limit exists, then it is called the logarithmic distribution of the sequence (u n ). Now, the /"following 0 can be proved (see [41]):

√ A(n) 3 If α ∈ exists at α, and , 6 , then the logarithmic distribution of √ 5 n has the value 1 1 d x, L(α) = log u Eα x where E α = {1 ≤ x ≤ 4 : λ(α) ≤ α}. Similar results holds true for α ∈ [0,

√ 3] for

1 L (α) = log 4 ∗

where E α∗ = {1 ≤ x ≤ 4 : µ(x) ≤ α}.

E α∗

B(n) : √ n

1 d x, x (132)

397

CHAPTER 4

Finally we mention that the function λ(x) has the logarithmic Fourier series expansion ∞ cn eπin log x/ log 2 (x > 0), λ(x) = n=−∞

where 1 cn = log 4

4 1

λ(x) x 1/2+γn

,

γn =

π ni 1 + , 2 log 2

and where the infinite series converges in the (C, 1) sense for all x > 0 ∞ 1 (i.e. cn eπin log x/ log 2 = lim (σ0 + σ1 + · · · + σk ) with k→∞ k + 1 n=−∞ k σk = cn eπin log x/ log 2 ).

(133)

n=−k

In [7], Allouche, Cohem, Mendès France and Shallit have proved that for all x = 1, |x| ≤ 1 (x ∈ C),

x e(n) log

n≥0

If T (n) =

(2n + 1)2 − log 2 = . (n + 1)(4n + 1) 1−x

x e(k) , then on a nonreal, positive ray of the unit circle, one has

0≤k≤n

uniformly

T (n) = O(n α ) for 0 < α < 1.

For example, if x = −1 one obtains the infinite product result: ∞ n=0

(2n + 1)2 (n + 1)(4n + 1)

(−1)e(n)

= 2−1/2 .

See also 15. for related identities. In 1972 E. Zeckendorf [360] proved that any non-negative integer n can be uniquely represented as the sum of distinct Fibonacci numbers n=

z(n)

Fk j

(134)

j=1

where k1 ≥ 2 and k j+1 > k j + 1 ( j ≥ 1). Here F0 = 0, F1 = 1, Fk = Fk−1 + Fk−2 (k ≥ 2). The number z(n) of summands in the Zeckendorf representation will be called Zeckendorf sum-of-digits function; and the sequence (−1)z(n) will be the Zeckendorf 398


Thue-Morse sequence. Let S(N ) = (−1)z(n)

and

Sk,i (N ) =

(−1)z(n) .

n 1be pairwisely coprime integers, and consider the ql additive functions fl (n) (l = 1, 2, . . . , d). For the joint distribution of these functions A. J. Hildebrand (see [78]) proved that 1 car d{n < x : fl (n) < yl , 1 ≤ l ≤ d} → F1 (y) . . . Fd (y) x

(150)

if fl satisfy (145) for all l = 1, . . . , d; and there is a joint central limit theorem of the form fl (n) − Mql (x) 1 car d n < x : < yl , 1 ≤ l ≤ d → φ(y1 ) . . . φ(yd ), (151) x Dql (x) if Bql → ∞ and Bql (x η ) ∼ Bql (x) for every η > 0, as x → ∞. (Note that the function sq (n) is not covered by this result.) M. Drmota [78] has extended the Bassily-Kátai theorem to the joint distribution case: Let q1 , . . . , qd > 1 be pairwisely coprime integers and let fl (1 ≤ l ≤ d) be j ql -additive functions such that fl (cql ) = O(1) as j → ∞ and c ∈ El . Assume that Dql (x)/(log x)η → ∞ as x → ∞ (1 ≤ l ≤ d), for some η > 0, and let Pl (x) be polynomials with integer coefficients of different degrees rl and positive leading term (1 ≤ l ≤ d). Then as x → ∞, fl (Pl (n)) − Mql (x rl ) 1 , 1 ≤ l ≤ d → φ(y1 ) . . . φ(yd ), car d n < x : < y l x Dql (x rl ) (152) and fl (Pl ( p)) − Mql (x rl ) 1 car d p < x : < yl , 1 ≤ l ≤ d → φ(y1 ) . . . φ(yd ) π(x) Dql (x rl ) (153) This theorem contains the condition that all polynomials Pl (x) have different degrees. It seems that this condition is not necessary. For the case d = 2 and linear polynomials Pl (x) = Al x + Bl , the following result holds true (see [78]): j Let q1 , q2 > 1 be coprime, fl be ql -additive (l = 1, 2), with fl (cql ) = O(1) as j → ∞ and c ∈ El . Assume further that Dql (x)/(log x)η → ∞ as x → ∞ (l = 1, 2) for some η > 0. Let Pl (x) = Al x + Bl (l = 1, 2) be arbitrary linear 403

CHAPTER 4

polynomials with integer coefficients and positive leading terms (Al , ql ) = 1. Then as x → ∞, fl (Pl (n)) − Mql (x) 1 car d n < x : < yl , l = 1, 2 → φ(y1 )φ(y2 ) (154) x Dql (x) For the sum-of-digits function sq (n), a local version of (154) holds true: Let (q1 , q2 ) = 1 and set d = gcd(q1 − 1, q2 − 1). Then, as x → ∞, 1 car d{n < x : sq1 (n) = k1 , sq2 (n) = k2 } = x 



q −1 logql x kl − 2   1 2   =d exp − "   q2 − 1 ql2 − 1 l=1 logql x 2· l logql x 2π · 12 12

2 

 1   + o  log x (155)

uniformly for all integers k1 , k2 ≥ 0 with k1 ≡ k2 (mod d). Note that sql (n) ≡ n (mod (ql − 1)), so we always have sq1 ≡ sq2 (mod d), and consequently car d{n < x : sq1 (n) = k1 , sq2 = k2 } = 0, if k1 ≡ k2

(mod d).

(156)

For digital expansion with respect to different bases see also M. Drmota and J. Schoissengeier [85]. For the joint distribution of Q-additive functions on polynomials over finite fields, see M. Drmota and G. Gutenbrunner [83]. Recently B. Gittenberger and J. M. Thuswaldner [143] have extended the BassilyKátai theorem to canonical number systems in the ring of Gaussian integers Z[i]. Let b ∈ Z[i] and N = {0, 1, . . . , |b|2 − 1}. A pair (b, N ) is called a canonical number system if any γ ∈ Z[i] has a representation of the form γ = c0 + c1 b + · · · + ch bh ,

ch = 0 if h = 0,

where h ≥ 0 is a nonnegative integer and c j ∈ N for j = 0, . . . , h. Here b is called base and N is called set of digits of (b, N ). Let (b, N ) be a canonical number system in Z[i]. A function f is called badditive if f (0) = 0 and f (a j (γ )b j ) for γ = a j (γ )b j (a j (γ ) ∈ N ) f (γ ) = j≥0

j≥0

404


The Bassily-Kátai theorem for b-additive functions can be stated as follows: Let f be a b-additive function such that f (cb j ) = O(1) for j ∈ N and c ∈ N . Furthermore, let 1 1 2 k mk = 2 f (cbk ), σk2 = 2 f (cb ) − m 2k , |b| c∈N |b| c∈N M(N ) =

L

mk ,

k=0

D 2 (N ) =

L

σk2 , with L = [log|b| N ].

k=0

Assume that D(N )/(log N )1/3 → ∞ as N → ∞, and let P(z) = pr z r + · · · + p1 z + p0 be a polynomial with coefficients in Z[i]. Then, as N → ∞, f (P(z)) − M(N r ) 1 2 car d |z| < N : < y → φ(y) (157) car d{z : |z|2 < N } D(N r ) where φ is the normal distribution function and z runs over the Gaussian integers. Let sb (z) = c0 + c1 + · · · + ch be the sum-of-digits function in Z[i]. As a corollary of (157), one has: sb (P(z)) − M(N r ) 1 2 car d |z| < N : < y → φ(y) (158) car d{z : |z|2 < N } D(N r ) The proof is based among others on certain results on exponential sums over number fields, as well as a two-dimensional version of the Erdös-Turán-Koksma inequality of discrepancy theory. We note that the notion of canonical number system in Z[i] is due to I. Kátai and J. Szabó [212] who showed that the only bases are given by b = −n ± i, where n = 1, 2, . . . I. Kátai and B. Kovács [211] extended the notion to imaginary quadratic fields, while in 1992 I. Kátai and I. Környei [210] considered the general case of algebraic number fields. A function f is called q-multiplicative if f (0) = 1 and f (n) = f (aq, j (n)q j ) for n = aq, j (n)q j , j≥1

j≥0

where aq, j (n) ∈ E q . For q-multiplicative function f satisfying | f (n)| = 1, K. H. Indlekofer and I. Kátai [188] obtained the following result: There exists a constant c1 such that if f is q-multiplicative, with | f (n)| = 1 (n ≥ 0) and f ( p) = constant for every large prime p, then f k (nq) = 1 for every n ≥ 0, with a suitable integer k ∈ [1, c1 ]. (159)

405

CHAPTER 4

The result remains true also if we assume the fulfilment of f ( p) = constant with the possible exception of primes of a set of relative density zero. q-multiplicative functions of modulus at most 1 have been first studied (in the context of Q-multiplicative functions, see 7.) by J. Coquet [67]. Let Q = (Q j ) j≥0 be a sequence of strictly increasing positive integers with Q 0 = 1 such that Q j |Q j+1 for all j. Put q j = Q j+1 /Q j . Then every nonnegative integer n has a unique baseQ representation n = a j (n)Q j , where 0 ≤ a j (n) < q j . A function f will j≥0 f j (a j (n)), where n = a j (n)Q j , and be called Q-multiplicative if f (n) = j≥0

j≥0

the component functions f j are functions defined on {0, 1, . . . , q j − 1} satisfying f j (0) = 1. The mean value of f is defined by M( f ) = lim

N →∞

1 f (n) N 0≤n 0} = 1, Then, if a sequence (xn ) is w.d. mod 1, then (x f (n) ) is w.d. mod 1, too. (173) For the higher dimensional analogue of (169), M. Drmota and G. Larcher [84] have proved that if q1 , . . . , qd are pairwisely coprime integers > 1, then the ddimensional sequence (α1 sq1 (n), . . . , αd sqd (n)) (174) is u.d. mod 1 if and only if α1 , . . . , αd are all irrational. The same result for w.d. mod 1 has been proved by P. J. Grabner, P. Liardet and R. F. Tichy (see [155]) via ergodic theory, even for Cantor representations. See also Drmota and Tichy [90]. For applications of ergodic theory to digital problems see also e.g. P. Liardet [243], T. Kamae [201], U. Krengel [237], P. J. Grabner and P. Liardet [154]. For the discrepancy of the above d-dimensional sequence, Drmota and Larcher prove: Let α1 , . . . , αd be irrational numbers. Suppose that there exists η > 0 and a constant c1 > 0 such that for all integers h > 0 we have hα j ≥ c1 h −η for all 1 ≤ j ≤ d. Then the discrepancy D N of the sequence (α1 sq1 (n), . . . , αd sqd (n)) is bounded by

log log N 1/2η (175) D N ≤ c(c1 , η, q) log N with some constant c(c1 , η, q) depending on c1 , η, and q = (q1 , . . . , qd ). Conversely, if for some η ≥ 1 and some constant c2 > 0 there exists j such that hα j ≤ c2 h −η for infinitely many integers h > 0, then D N ≥ c (c2 , η, q) ·

1 (log N )1/2η

(176)

for infinitely many N ≥ 0, where c (c2 , η, q) depends on c2 , η and q.

4 An analogue of (169) is due to C. Mauduit and J. Rivat [253]: Let 1 ≤ c ≤ be 3 a real number and α an irrational number. Then the sequence (α · sq ([n c ])) 412

(177)


is u.d. mod 1. This result follows from a more general theorem on q-multiplicative functions f : 1 f ([n c ]) = f (m)m c−1 + O(x 1−ε ) (178) c 1≤n≤x 1≤m≤x c as x → ∞ (where ε > 0). For q-multiplicative functions with modulus 1, and a kind of uniform distribution, (namely uniform summability), Indlekofer and Kátai [189] have recently obtained a representation theorem. A function g is called uniformly summable (a notion due to Indlekofer [187]) if sup x≥1

1 x

| f (n)| → 0 as K → ∞.

(179)

n≤x,| f (n)|≥K

Let g be uniformly summable. We say that α is in the Bohr-Fourier spectrum of g, if 1 (180) lim sup f (n)e(−nα) > 0 x x→∞ n≤x (where e(x) = exp(2πi x)). Assume now that f is q-multiplicative with modulus 1, and that g is uniformly summable multiplicative function (in ordinary sense), and that 1 lim sup f (n)g(n) > 0. (181) x→∞ x n≤x Then f (n) can be written as f (n) = e

r D

h(n)

r with a suitable rational number and with a function h, which is q-multiplicative D with modulus 1, for which q−1 ∞

Re(1 − h(cq j )) < ∞

(182)

j=0 c=0

holds. If the Bohr-Fourier spectrum of g is empty, then 1 f (n)g(n) → 0 x n≤x

(x → ∞)

for each q-multiplicative function f of modulus 1. 413

(183)

CHAPTER 4

11

The G-ary digital expansion of a number

Let G = (G j ) j≥0 be a strictly increasing sequence of integers with G 0 = 1. Then every nonnegative integer n has a unique proper G-ary digital expansion n= a j (n)G j j≥0

with integer digits a j (n) ≥ 0 provided that a j (n)G j < G k for all k ≥ 0. j 0 is a constant. When g1 ≥ g2 ≥ · · · ≥ gr ≥ 0 and G j =

j

g j G j−1 + 1 for j < r , then all

i=1

assumptions are satisfied. Furthermore, P(u) is irreducible and α is a Pisot number, see [159]. The fact that α is a Pisot number, is essentially due to A. Brauer [38]. For Pisot (or Pisot-Vijayaraghavan) and Salem numbers, see e.g. the monograph [24] by M. J. Bertin, et al. For more recent results, see D. W. Boyd [35], D. W. Boyd and R. D. Mauldin [37], or M. J. Bertin and D. W. Boyd [23]. For connections to Fourier analysis, see R. Salem [297], and to Harmonic analysis, see Y. Meyer [256]. For infinite recurrences our starting point is Parry’s α-expansion of 1 (see [270]) 1=

g1 g2 g3 + 2 + 3 + ... α α α

(185)

where α > 1 is a real number and gi (i ≥ 1) are positive integers. (In the case of ambiguity we take the infinite representation of 1.) The sequence G = (G j ) j≥0 is now defined by G 0 = 1,

Gj =

j

g j G j−1 + 1

( j ≥ 1)

(186)

i=1

If we further set A(u) =

gi u i ,

G(u) =

i≥1

G ju j,

j≥0

then G(u) =

1 (1 − u)(1 − A(u))

1 > 0 is the only singularity on the circle of convergence and it follows that z 0 = α |z| = z 0 , which is a simple pole. Hence G j ∼ C α j as j → ∞ and so we are in similar situation as above. The following theorem is a collection of results from [272], [158], [159] etc. (see [82]): 415

CHAPTER 4

Suppose that G = (G j ) satisfies a finite or infinite linear recurrence of the above types (see (184), (185), (186)). Set −1 j g G(z, u) = z l z g1 +···+g j−1 u j j≥1

l=0

and let 1/α(z) denote the analytic solution u = 1/α(z) of the equation G(u, z) = 1 for z in a sufficiently small (complex) neighbourhood of z 0 = 1 such that α(1) = α. Then log N EX N = µ + O(1), (187) log α and log N + O(1), (188) VX N = σ 2 log α α (1) α (1) and σ 2 = + µ − µ2 . where µ = α α For the asymptotic normality in the weak sense we have: 1 |car d{n < N : SG (N ) < EX N + xVX N }| = N (189) = φ(x) + O((log N )−1/2+ε ), uniformly for all real x, as N → ∞ (φ is the normal law). A local limit law is provided by car d{n < N : sG (n) = k} =

(k − EX N )2 N −1/2+ε exp − + O((log N ) ) , (190) =√ 2VX N 2π VX N uniformly for all nonnegative integers k, as N → ∞. By assuming that all digits are uniformly bounded by some integer bound K (i.e. the sequence of fractions G j+1 /G j is bounded), and letting F : {0, 1, . . . , K } K +1 → R (L ≥ 0) with F(0, . . . , 0) = 1, one can define a general sum-of-digits function s F (n) = F(a j+L (n), a j+L−1 (n), . . . , a j (n)) (191)

j≥0

In the case of q-ary expansions (i.e. G j = q j ) and finite recurrences (see (184)), similar results to (189) and (190) have been proved in M. Drmota [80]. It is an open problem if corresponding theorems hold for infinite recurrences. For summatory formulae in the case of q-ary expansions, see also G. Barat, R. F. Tichy and R. Tijdeman [17]. For functional limit theorems for digital expansions, see M. Drmota, M. Fuchs and E. Manstaviˇcius [81]. 416


12

The sum-of-digits function for negative integer bases

The number systems with negative integer bases were first introduced by V. Grünwald in 1885, in a little known journal [161]. Later the idea was rediscovered by A. J. Kempner in 1936, Z. Pawlak and A. Wakulicz in 1957, I. Wadel in 1957, D. E. Knuth in 1955 (see the book [224] by D. E. Knuth). Knuth studied also numerical systems with complex bases. It is easy to prove that for an integer q ≥ 2, every n ∈ Z has a unique representation of the form n = c0 + c1 (−q) + c2 (−q)2 + · · · + ch (−q)h

(192)

with ci ∈ {0, 1, . . . , q − 1}, 0 ≤ i ≤ h, and c j = 0 for h = 0. Expression (192) is called (−q)-adic representation of n. The sum of digits function of n now is defined by s−q (n) = c0 + c1 + · · · + ch For the mean value of s−q (n): s−q (n) = (q − 1)N logq N + N F(logq 2 N ),

(193)

|n| 1, then n−1

k n−1 ≡ −1

(mod n) ⇔ n prime

(148)

k=1

The Giuga-Agoh conjecture states that n/ p ≡ 1 (mod n) ⇔ n prime

(149)

p|n,( p−1)|(n−1)

The factorization of Bernoulli numerators goes back to M. Ohm [340]. Then J. C. Adams [3] in 1878 published a table for the first sixty-two numbers of Bernoulli. In 1978 S. S. Wagstaff [473] published the factorizations through N60 and E 42 . Recently [474] he completely factored all N2k for 2k ≤ 152, and also the Euler numbers E 2k for 2k ≤ 112. The results are completed continuously at the web address [475]. F. The prime factors of the Euler numbers determine the structure of certain cyclotomic fields; see e.g. R. Ernwall and T. Metsänkylä [157]. Since the Euler numbers are all integers, there is no analogue for them of the von Staudt-Clausen theorem. But Kummer’s congruence has an analogue, due also to Kummer [265]: If n ≥ 1 and p ≥ 3 is a prime, then E 2n+ p−1 ≡ E 2n (mod p) (150) See also L. Carlitz and J. Levine [96] and S. S. Wagstaff, Jr. [474]. The following two theorems have been discovered recently by Wagstaff [474], the first being an 556

STIRLING, BELL, BERNOULLI, EULER, AND EULERIAN NUMBERS

analogue of Adams’ theorem (83): Let p be an odd prime, n ≥ 1 and N ≥ 0 an integer. Suppose ( p − 1) p N |n. Then (mod p N +1 )

E n ≡ 0 or

(151)

according as p ≡ 1 or 3 (mod 4). For all integers n ≥ 0 and k ≥ 0 we have E 2n ≡ E 2n+2k + 2k

(mod 2k+1 )

(152)

Theorems of type (151) and (152) were probably known to Kummer, too. In 1938 E. Lehmer [275] proved that if p ≡ 5 (mod 8) is a prime, then E ( p−1)/2 ≡ 0 (mod p)

(153)

For an elementary proof, see R. Ernvall [155]. In 1982 R. Ernvall [156] proved that (153) holds true for all p ≡ 1 (mod 4). For connections of congruences of type (153) with Diophantine equations (Pell equations), see L. J. Mordell [314]. In [84] Carlitz proves that none of the following numbers |E 4n |,

|E 8n+6 |,

|E 24n+18 |,

|E 40n+34 |,

|E 40n+26 |

(154)

is a perfect square, and conjectures that the same is true for |E 8n+2 |

(155)

(i.e. |E 2m | is never a square for m > 1). In the proof of (154) various congruences are used, e.g. E 2n ≡ 1 − 2n (mod 8) for all n ≥ 1 (156) The congruence E 4n ≡ −1

(mod 3)

(157)

appears in N. Nielsen [334]. On the other hand E 4n ≡ 1

(mod 4),

(158)

∗ ∗ = (−1)n E 2n , E 2n+1 = 0 More generally, let us define the numbers E n∗ by E 2n ∗ ∗ (n ≥ 0) (see (12 )). Put E m = E 2m (m ≥ 0). Then A. Junod [238] has proved that ∗ ∗ ∗ E m+2 ≡ E m∗ (mod 4), E m+3 ≡ 5E m+1 (mod 36), ∗ ∗ ∗ E m+4 ≡ 14E m+2 − 9E m (mod 576), ∗ ∗ ∗ E m+5 ≡ 30E m+3 − 89E m+1 (mod 14400)

557

(159)

CHAPTER 5

and that m∗ ≡ · · · ≡ E ∗ = 1 (mod 4), ∗ ≡ E E m+1 0 ∗ ∗ ∗ = 5m+1 (mod 36), E m+2 ≡ 5 E m+1 ≡ · · · ≡5m E 2 1, if m is even ∗ ∗ (mod 30) E m+3 ≡ E m+1 ≡ · · · ≡ 5, if m is odd

(160)

These follow from more general results for the Meixner polynomials Q n (x) defined by Q 0 (x) = 1, Q 1 (x) = x, Q n+1 (x) = x Q n (x) − n 2 Q n−1 (x) (n ≥ 1): If p is an odd prime, then Q p (x) ≡ x p − (−1)( p−1)/2 x

(mod pZ p [x])

(161)

Junod conjectures that Q np (x) ≡ Q np (x) ≡ (x p − (−1)( p−1)/2 x)n

(mod npZ p [x]),

(162)

which would imply ∗ ∗ E m+np ≡ (−1)n( p−1)/2 E m+n (mod npZ p ) and ∗ ∗ E m+np ≡ E m+n (mod npZ p )

for any m, n ≥ 0, and p = 2 a prime. The higher order Euler polynomials are defined by r ∞ 2 tn xt (r ) e = E (x) n et + 1 n! n=0

(163)

(164)

where n, r ≥ 0 are integers. For r = 1, E n(1) (x) = E n (x), as given by relation (14). By generalizing results by M. Zuber [489], A. Junod [238] has recently proved that (r ) E np (t) ≡ E n(r ) (t p ) (mod npZ p [t])

(165)

for all integers n, r ≥ 0, and an odd prime p. For r = 1 this gives a Honda type congruence for the classical Euler polynomials. Further, if a ∈ Z p , then (r ) (r ) E m+np (a) ≡ E m+n (a) (mod npZ p )

(166)

for all n, m, r ≥ 0. Particularly, the sequence (E n(r ) (a))n≥1 is p − 1-periodical (mod pZ p ): (r ) (r ) E m+ (167) p−1 (a) ≡ E m (a) (mod pZ p ) As for the variant of Euler numbers defined in (159), there are also other ”Euler numbers” definition in the literature. However, we wish to use always the classical 558


definition (11) for the Euler numbers. For example, in [380] the Euler numbers are defined by ∞ xn = tan x + secx (168) En n! n=0 Then clearly, E 2n = (−1)n E 2n (called also as ”secant numbers”), and E 2n+1 = B2n+2 (−1)n · 4n (4n+1 − 1) (called also as ”tangent numbers”). In [420] R. Stanley 2n + 2 has shown that the volume of the convex polytope determined by xi ≥ 0 (i = 1, n), and xi + xi+1 ≤ 1 (1 ≤ i ≤ n − 1) is given by E n . (169) In fact, E n counts the number of permutations π = a1 a2 . . . an in Sn (the symmetric group of all permutations of {1, 2, . . . , n}) that alternate, i.e. a1 < a2 > a3 < . . . , due to D. André [24] (see also [116]). There are many known q-analogs of Euler numbers or its variants. See e.g. a paper by L. Carlitz [82] from 1954. The divisibility properties of q-tangent numbers have been studied e.g. by G. Andrews and I. Gessel [26], D. Foata [162] etc. Let q ≥ 1, and as usual put [k] = [k]q = 1 + q + · · · + q k−1 . The q-Euler numbers E n|k (q) can be defined (see Sagan and Zhang [380]) by the recurrence E (n+1)|k (q) =

∗ [n/k]

m=1

n q n−mk+1 E (mk−1)|k (q)E (n−mk+1)|k (q)+ mk − 1

+χ (k n)E n|k (q),

(n ≥ 0)

(169)

and E 0|k (q) = 1, where χ (P) is the characteristic function of property P (i.e. is 1 if n [n]! ([n]! = [n][n − 1] . . . [1]) is P is true, and 0 if it is false), and = [k]![n − k]! m the Gauss q-binomial coefficient. Sagan and Zhang have proved the following divisibility theorems: Let p be a prime, and 1 ≤ i ≤ p − 1. Then E (np+i)| p (q) is divisible by [ p]n

(170)

E (np+i)| p (q) is divisible by [ p][ p]q 2 [ p]q 3 . . . [ p]q n

(171)

Further, For p = 2, i = 1 these were proved in [26]. Let E n|k = E n|k (1). Then (170) gives: E (np+i)| p is divisible by [ p]n = p n 559

(172)

CHAPTER 5

for all 1 ≤ i ≤ p − 1. I. Gessel and G. Viennot [189] have shown that np− j ∗ np E (np− j)| p p p−1 j

(173)

where [·]∗ denotes the integer part. For p = 2, j = 1 this reduces to the well known fact that 22n−1 |2n E 2n−1 (174) where E 2n−1 = E 2n−1|2 is a (classical) tangent number. In 1911 F. H. Jackson [235] defined the q-variant of sin, cos and tan by sinq (x) =

∞ (−1)n x 2n+1 n=0

[2n + 1]!

,

cosq (x) =

∞ (−1)n x 2n n=0

[2n]!

(175)

1 tanq (x) = sinq (x)/ cosq (x), secq (x) = cosq (x) Then the q-Euler numbers E n (q) may be defined by n≥0

where (x, q)n =

E n (q)

xn = tanq (x) + secq (x) (q, q)n

(n ≥ 0)

n−1 (1 − xq l ), for n ≥ 1 and (x, q)0 = 1. l=0

More generally, J. Désarménien [133] defined sinq (u; x) = sin u cosq (x) + cos u sinq (x) = =

(−1)(m+n−1)/2 m,n

um x n m!(q, q)n

(m, n ≥ 0, m + n = odd)

and cosq (u; x) = cos u cosq (x) − sin u sinq (x) = =

(−1)(m+n)/2 m,n

um x n m!(q, q)n

(m, n ≥ 0, m + n = even)

tanq (u; x) = sinq (u; x)/ cosq (u; x),

secq (u; x) =

1 cosq (u; x)

He defined the numbers E m,n (q) by m,n≥0

E m,n (q)

um x n = tanq (u; x) + secq (u; x). m!(q, q)n 560

(175 )


One has E 0,n (q) = E n (q), E m,n (1) = E m+n . The following congruences are true: Let m, k, a, b be integers, m, a, b ≥ 0, k ≥ 1, Then: i) if k is even, and m + ka + b is odd, with a ≥ 1, then E m,ka+b (q) ≡ 0

(mod k (q)).

If m + ka + b is even, then E m,ka+b (q) ≡ (−1)(k+2)a/2 E m,b (q) (mod k (q))

(175 )

ii) If k is odd, then E m,ka+b (q) ≡ (−1)(k−1)a/2 E m+a,b (q) (mod k (q)), where k denotes the kth cyclotomic polynomial (see Chapter 3). For m = 0, relation i) of (170 ) is due to G. Andrews and I. Gessel [26], see also [162] and [25]. For k = 2, q = 1 these were proved by Kummer in 1850. In 2000 H. Prodinger [356] as variations to Jackson’s definitions, has defined the q-trigonometric function sinq∗ (x) =

∞ (−1)n x 2n+1 n=0

[2n + 1]!

q n , cosq∗ (x) = 2

∞ (−1)n x 2n n=0

[2n]!

2

qn , (176)

tanq∗ (x) = sinq∗ (x)/ cosq∗ (x) and deduced among others divisibility properties of these tangent numbers. For continued fraction expansions, see M. Fulmek [169]. For another q-analogue of the Euler numbers, see G.-N. Han, A. Randrianarivony and J. Zeng [212]. G. Several nonequivalent definitions of q-analogues of Bernoulli polynomials and numbers are known in the literature. In 1948 L. Carlitz [91] defined the qBernoulli numbers βk (q) by β0 (q) = 1,

k k j+1 1, k = 1 q β j (q) − βk (q) = 0, k≥2 j j=0

(177)

In 1954 he introduced the q-Euler numbers Hk (u, q) (associated to u) by (see [82]) H0 (u, q) = 1,

k k j q H j (u, q) − u Hk (u, q) = 0 (k ≥ 1) j j=0

561

(178)

CHAPTER 5

Note that if q → 1, then βk (q) → Bk and Hk (u, q) → Hk (u), where (Bk ) are the ordinary Bernoulli numbers, while Hk (u) are defined by ∞ 1−u tk = H (u) k et − u k! k=0

(179)

J. Satoh [392] defined a q-Riemann ζ -function by ∞ ∞ qn qn 2−s ζq (s) = (1 − q) + s−1 [n]s−1 n=1 [n]s n=1

(s ∈ C)

(180)

and proved that ζq is analytic in the whole complex plane. For k ≥ 1, integer, one has   qβ1 (q) if k = 1 (181) ζq (1 − k) = β (q)  − k if k ≥ 2 k Further, Satoh defined l(s, u, q) =

∞ u −n [n]s n=1

(s ∈ C)

and proved that l(s, u, q) is analytic in C, and for k ≥ 0 integer    1 if k = 0 u−1 l(−k, u, q) = u   Hk (u, q) if k ≥ 1 u−1

(182)

For a construction of q-Bernoulli type numbers using Stirling numbers, see J. Satoh [390]. The q-Bernoulli polynomials βk (x, q) can be defined inductively by βk (x, q) = (q x β + [x])k with replacing β i by βi (x, q). N. Koblitz [257] defined the generalized q-Bernoulli numbers βk,χ (q), where χ is a primitive Dirichlet character with conductor f : f a f k−1 a ,q (183) χ (a)q βk βk,χ (q) = [ f ] f a=1 Sato [392] has constructed the generalized q-Euler numbers Hk,χ (u, q) by f k f −a f a f (184) u χ(a)Hk u , , q Hk,χ (u, q) = [ f ] f a=1 562


where the q-Euler polynomials Hk (u, x, q) are defined inductively by Hk (u, x, q) = (q x H + [x])k

(k ≥ 1)

with replacing H i by Hi (u, x, q). Further, Sato introduced a q − L-series L q (x, χ) by ∞ ∞ q n χ (n) q n χ (n) 2−s L q (s, χ) = + , (185) (q − 1) s−1 [n]s−1 [n]s n=1 n=1 and a function lq (u, s, χ) by lq (u, s, χ) =

∞ u −n χ (n) n=1

[n]s

(186)

These functions interpolate the q-Bernoulli and q-Euler numbers as follows: L q (1 − k, χ) = −βk,χ (q)/k, 1 lq (u−, −k, χ) = Hk,χ (u, q), 1−uf

(187)

for k > 1 integer. The values L q (k, χ) for k ≥ 2 integer have been evaluated by H. Tsumura [453]: f 1 a(2−k) (−1)k (k) −a [a] f · ,q , q q χ (a)G L q (k, χ) = (k − 1)! [ f ]k a=1 [f]

(188)

where

1 G(x, q) = x − 1+q

log x − x +

∞ (−1)k+1 1 βk+1 (q) q k(k + 1) x k=1

for |x| > 1/(1 − |q|)2 (with |q| < 1). Since ∞ ∞ (−1)k k qn qn 2−k G (x, q) = (1 − q) + (1 + x − q x) (k − 1)! k−1 (x + [n])k−1 (x + [n])k n=0 n=0

for k ≥ 2 integer, one has a q-analogue of the classical formula for the Euler gamma function: ∞ (−1)k d k 1 log (x) = k (k − 1)! d x (x + n)k n=0 Therefore, G(x, q) can be considered as a q-log- function. 563

CHAPTER 5

n (q) by In 1991 H. Tsumura [389] defined the modified q-Bernoulli numbers β Fq (t) =

∞

n

n (q) t , β n! n=0

(189)

where Fq (t) is determined as a solution of the following q-difference equation: Fq (t) = et Fq (qt) − t,

Fq (0) =

q −1 log q

t n (1) = Bn , which is the ordinary , and β −1 Bernoulli number. For 0 < q < 1 the following series representation is valid: Moreover, we let F1 (t) =

et

∞ q − 1 t/(1−q) −t q n e[n]t e log q n=0

Fq (t) =

Thus, Fq (t) is continuous as a function of (q, t) on (0, 1] × {t ∈ C : |t| < 2π }. n (x, q) are defined by The modified q-Bernoulli polynomials β Fq (q x t)e[x]t =

∞

n

n (x, q) t β n! n=0

(190)

Note that Fq (q x t)e[x]t =

∞ q − 1 t/(1−q) e −t q n+x e[n+x]t log q n=0

J. Satoh [389] considered the q-series Z q (s) =

∞

q n /[n]s

n=1

k (q)) at non-positive integers for a complex number q with which interpolated (β |q| < 1, and where [x] = (1 − q x )/(1 − q). Let Z q (s) = Z q (s) + (1 − q)s /((1 − s) log q). Note that if q → 1, then Z q (s) → ζ (s) for Re s > 1. Satoh proved that  k (q)  β − if k ≥ 2 Z q (1 − k) =  k −β1 (q) − 1 if k = 1 564

(191)


In [452] H. Tsumura considered Z q (s) at positive integers s. Particularly, we quote the following result: 2k Z q (2k + 1) − 2k

∞ q n cos([n]π )

[n]2k+1

n=1

=

k−1 (−1) j−1 π 2 j j=1

(2 j)!

−π

∞ q n sin([n]π )

[n]2k

n=1

=

π (1 − q)2k+1 (2k − 2 j) Z q (2k − 2 j + 1) − cos + log q 1−q +(−1)k+1 π 2k

∞ (−1)m π 2m β2m (q), (2k + 2m)! m=0

(192)

which for q → 1 gives a result of D. Cvijović and J. Klinowski [126]: ( k−1 (−1) j−1 j ζ (2 j + 1) (−1)k (2π )2k + ζ (2k + 1) = · k(2k+1 − 1) j=1 (2k − 2 j)! π2j ∞

ζ (2m) (2m)! · 2m + (2m + 2k)! 2 m=0

) (193)

The modified q-Hurwitz ζ -function is defined by ζq (s, x) =

∞ (1 − q)s q n+x /[n + x]s for x > 0. + (1 − s) log q n=0

Then for k ∈ N, one has k (x, q) β ζq (1 − k, x) = − k The modified q − L-series and generalized q-Bernoulli numbers are given by f a −s χ (a)[ f ] ζq f s, L q (s, χ) = f a=1 and k,χ (q) = [ f ]k−1 β

f

k χ(a)β

a=1

a f ,q f

(k ≥ 0)

k,χ (q) = Bχn , the generalized Bernoulli numbers given by (134). Note the lim β q→1

The following formula holds true: k,χ (q) β L q (1 − k, χ) = − k 565

(k ≥ 1 integer)

(194)

CHAPTER 5

For (194) and related results, see H. Tsumura [455]. By applications of methods of [455] the following result of M. Katsurada [245] (who used Mellin transform) can be reobtained: Let n be a positive integer, x a real number with |x| ≤ 1, and let f ∞ τ (χ) = χ(a) exp(2πia/ f ) be the Gauss sum. Let L(m, χ) = χ (γ )γ −m be γ =1

a=1

the Dirichlet L-function. If χ (−1) = 1 and χ ≡ 1, then n L(2n + 1, χ) − n

∞ χ(l) cos(2πlx/ f )

l 2n+1

l=1

= (−1)n

2π x f

2n n−1 k=1

−

∞ χ(l) sin(2πlx/ f ) πx = f l=1 l 2n

∞ (−1)k−1 k L(2k + 1, χ) τ (χ ) (2k)!L(2k, χ ) 2k x + 2k (2n − 2k)!(2π x/ f ) f k=1 (2n + 2k)!

"

If χ (−1) = −1, then L(2n, χ) −

∞ χ (l) cos(2πlx/ f )

l 2n

l=1

=

2n−1 n−1

(−1)k−1 L(2k, χ) + (2n − 2k)!(2π x/ f )2k−1 k=1 " ∞ (2k)!L(2k + 1, χ) 2k+1 2iτ (χ) + x f (2n + 2k)! k=0

= (−1)

n

2π x f

(195)

For q-analogue of the p-adic L function of Kubota and Leopoldt [264], and connections with q-Bernoulli and Euler numbers, see N. Koblitz [257], H. Tsumura [456]. For the q-extension of Morita’s p-adic gamma function, see N. Koblitz [258], Y. S.Kim [250]. For p-adic log-gamma functions, see e.g. J. Diamond [136], T. Kim [249]. See also Y. Morita [315]. For the q-gamma functions of F. H. Jackson, see R. Askey [29], D. S. Moak [313], M. Badiale [31], A. Gupta [204], A. B. Olde Daalhuis [341], K. Ueno and M. Nishizawa [458], H. Alzer [21], J. W. Son and D. S. Jang [415]. For p-adic functions attached to the Lubin-Tate groups, see K. Shiratani [400], K. Kozuka [127] and H. Tsumura [454]. By means of p-adic integrals with respect to the q-analogue of the p-adic measure defined by T. Kim [249], recently J. W. Son and M. S. Kim [252] have defined other p-adic q-analogs Bn∗ (q) and Bn∗ (x, q) of Bernoulli numbers and polynomials. The numbers Bn∗ (q) can be defined by ∞ tn q − 1 log q + t ∗ = B (q) , (196) n log q qet − 1 n! n=0 566


while the q-analogs Hn∗ (q) of Euler numbers are defined by ∞ tn q −1 ∗ = H (q) n qet − 1 n! n=0

(197)

∗ ∗ They defined also Bn,χ (q) and Hn,χ (q), where χ is a Dirichlet character, proved ∗ Kummer type congruences for Hn,χ (q), and some relations between Bn∗ (q) and Hn∗ (q). H. The Euler numbers (E n ) should nor be confused with another kind of numbers A(n, k), introduced by Euler in 1755, and called Eulerian numbers. These numbers may be defined recursively via

A(n + 1, k) = (n − k + 2)A(n, k − 1) + k A(n, k),

(k ≥ 2, n ≥ 0)

(198)

A(n, 1) = 1 for n ≥ 0 and A(0, k) = 0 for k ≥ 2. These numbers are generated by G = G(t, u) =

n t n k−1 1−u A(n, k) = 1 + u et (1−u) − u n! k=1

It is easy to verify that (u − u 2 )

∂G ∂G + (tu − 1) + G = 0, ∂u ∂t

and by letting the coefficient of u k−1 t n /n! equal to 0 in this differential equation, (198) follows at once. Some authors define the Eulerian numbers a(n, k) which satisfy a(n, k) = (n − k)a(n − 1, k − 1) + (k + 1)a(n − 1, k) (n ≥ 1, k ≥ 1)

(199)

with a(n, 0) = 1 for n ≥ 0 and * n +a(0, k) = 0 for k ≥ 1. is also applied. (We note that some authors use also The notation a(n, k) = k *n + ). These numbers a(n, k) count in fact the number of permutations π A(n, k) = k of the symmetric group Sn of {1, 2, . . . , n} having exactly k ascents (an ascent is an occurrence of π( j) < π( j + 1) for 1 ≤ j ≤ n − 1), see e.g. [116]. However, the numbers A(n, k) and a(n, k) are connected by A(n, k) = a(n, k − 1)

(k ≥ 2)

(200)

and they have the symmetric property A(n, k) = A(n − k + 1),

a(n, k) = a(n, n − k − 1) 567

(201)

CHAPTER 5

Therefore, any property for A(n, k) can be written via (200) to a property of a(n, k) and vice-versa. Two fundamental properties of A(n, k) are given by: k j n+1 A(n, k) = (k − j)n , (−1) j j=0

(202)

and the Worpitzky identity from 1883 (see [116] and [487]) x = n

n k=1

x +k−1 A(n, k) n

(203)

The Eulerian polynomials An (x) are defined by An (x) =

n−1

A(n, k + 1)x k+1 , n ≥ 1

(A0 (x) = 1)

k=0

While no closed formula is known for the Eulerian polynomials, their generating function is given by (see e.g. D. Foata and M. P. Schützenberger [163]) ∞ 1−x An (x)t n = and n! 1 − xe(1−x)t n=0 ∞ n=0

−1 An (x) tn = · n+1 (x − 1) n! 1 − xe−t

(204)

giving the recurrence relation An (x) = x(1 − x)

n−1

+

n−1 n i=1

i

Ai (x)x(1 − x)n−1−i

The Eulerian numbers A(n, k) and a(n, k) occur in many fields. For example, F. Schmidt and R. Simion [395] deal with a set of probability problems that lead to the computation of volumes of regions obtained by dissecting a polytope P with hyperplanes. They consider in particular the case when P is an n-dimensional symplex. The regions formed by dissecting a symplex by certain pencils of hyperplanes through a point have volumes proportional to the Eulerian numbers a(n, k). R. Ehrenborg, M. Readdy and E. Steingrimsson [148] give a combinatorial interpretation for the mixed volumes of two adjacent slices from the unit cube in terms of a refinement of the Eulerian numbers. M. Dash, L. Samantaray and R. Panda 568


[127] study the interpolation of band limited signals using Eulerian filters, and establish a relation of different derivatives of a sigmoid function to the standard Eulerian numbers. There exist many identities involving Eulerian numbers. The following show a connection with the Stirling numbers of the second kind, and with Bernoulli numbers. The identity n n j−1 2 A(n, j) = j!S(n, j), (205) j=1

j=1

has been proposed in [483], and generalized by R. Tauraso (see [483]) to: n j=1

A(n, j)

n ∞ x n+1− j xj = j!S(n, j) = jnx j j+1 (1 − x)n+1 (1 − x) j=1 j=1

(206)

∞ 1 for |x| < 1. For x = , (206) gives (205) with a common value equal to j n /2 j . 2 j=1 The identity n 2n+1 (2n+1 − 1)Bn+1 (−1) j a(n, j) = n+1 j=1

(n ≥ 1)

(207)

is well known. For a proof, see J. Stopple [429] (who states that (207) may have been known to Euler). Since ζ (−n) = −Bn+1 /(n + 1), (207) can be written also in terms of ζ (−n). There are a lot of generalizations or extensions of the Eulerian numbers. For example, in 1954 L. Carlitz [82] defined the q-Eulerian numbers Bn,k (q) and polynomials Bn (x) by Bn,k (q) = [k + 1]Bn−1,k (q) + q k [n − k]q Bn−1,k−1 (q),

(208)

with B0,k (q) = 1 if k = 0; 0, otherwise, and Bn (x) =

n

Bn,k (q)x k

k=0

Here q ≥ 1 and [k + 1] = [k + 1]q is the standard q-notation. For combinatorial and statistical properties, see e.g. L. Carlitz [81] and M. Skandera [404]. Another q-Eulerian polynomial An (x, q) has been introduced in 1971 by R. P. Stanley [417] (see also [418]). As usual, the q-ascending factorial is defined by (u, q)0 = 1, (u, q)n = (1 − u)(1 − uq) . . . (1 − uq n−1 ) (n ≥ 1). Let (u, q)∞ = 569

CHAPTER 5

∞

(1−uq n ), and put e(u, q) =

n=0

u n /(q, q)n = (u, q)−1 ∞ . Let desπ denote the num-

n≥0

ber of descents of π of the permutation group Sn (i.e. the number of i ∈ {1, . . . , n−1} with π(i) > π(i + 1)), and invπ the number of inversions of π (i.e. the number of pairs (i, j) with 1 ≤ i < j ≤ n such that π(i) > π( j)). Then An (x, q) is defined by x 1+desπ q invπ An (x, q) = π ∈Sn

Then the generating functions of these polynomials are given by (see [418]) tn 1−x , (208 ) An (x, q) = (q, q) 1 − xe((1 − x)t, q) n n≥0 so that this is equivalent to the recurrence relation An (x, q) = x(1 − x)

n−1

+

n−1 n i=1

i

Ai (x, q)x(1 − x)n−1−i

We note that for q = 1, An (x, q) = An (x) =

x 1+desπ , so we get the recur-

π ∈Sn

rence from (204) in this case. For q = −1 one obtains the signed Eulerian polynomial A− n (x) = An (x, −1), introduced by J. L. Loday [289] in connection with his study of the cyclic homology of commutative algebras. Loday conjectured that − A− 2n (x) = (1 − x)A2n−1 (x),

− − A− 2n+1 (x) = (2n + 1)x A2n (x) + x(1 − x)(A2n ) (x)

or equivalently n A− 2n (x) = (1 − x) An (x),

n A− 2n+1 (x) = (1 − x) An+1 (x),

and this has been proved by J. Désarménien and D. Foata [135]. The q-Eulerian polynomials Am,n (x, q) (m, n ≥ 0) with two indices were introduced by J. Désarménien [134] via their generating function tn sm 1−t Am,n (x, q) · = (q, q)n m! 1 − xe((1 − x)t, q)e(1−t)s m≥0,n≥0 Then A0,n (x, q) = An (x, q), Am,0 (x, q) = Am (x). He proved the following congruence property (see also [135] for a detailed proof): Let n and k be two positive integers and let n = ka + b (0 ≤ b ≤ k − 1) be the Euclidean division of n by k. Then Am,ka+b (x, q) ≡ (1 − x)(k−1)a Am+a,b (x, q) (mod k (q)), 570

(208 )


where k is the kth cyclotomic polynomial. For k = 1 we then have Aa,1 (x, q) = Aa+1,0 (x, q) = Aa+1 (x); for k = 2, b = 0, 1 one has A2a+b (x, q) = A0,2a+b ≡ (1 − x)a Aa,b (x, q)

(mod (q + 1)) ≡

≡ (1 − x)a Aa+b (x) (mod (q + 1)), − so Loday’s conjecture on A− 2n and A2n+1 is a particular case of (208 ). For an involution for signed Eulerian numbers, see M. Wachs [477]. Recall that these numbers A− (n, k) satisfy

A− (2n, k) = A− (2n − 1, k) − A− (2n − 1, k − 1), A− (2n + 1, k) = k A− (2n, k) + (2n − k + 2)A− (2n, k − 1), implying analogs of the Worpitzky formulas 2n − 1 + i 2n + i − n A (2n, k − i) = k , A− (2n − 1, k − i) = k n i i i i F. Chung, P. Diaconis and R. Graham [108] have considered the generalized Eulerian numbers a(n; k, l) defined by a(n; k, l) = (l + 1)a(n − 1; k, l) + (l + 1)a(n − 1; k − 1, l + 1)+ +(n − k − l)a(n − 1; k − 1, l) + (k − l + 1)a(n − 1; k, l − 1)

(209)

where a(0; 0, 0) = 1 and a(m; n, p) = 0 if m, n or p < 0. P. L. Butzer and M. Hauss [71] have introduced the Eulerian functions a(α, k), α ∈ R, which for α = n ∈ N are given by (199). The a(α, k) satisfy recursion formulae, they are monotone in k, and as functions of α, are arbitrarily often differentiable. A counterpart of the Worpitzky formula (203) is given, as well as connections to the fractional Stirling numbers S(α, k) are pointed out (see relation (98) of 5.2.). For Eulerian numbers of higher order, see J. F. Dillon and D. P. Roselle [145]. For ”Pseudo-Eulerian” numbers, see [100]. In [227] Hsu and Shiue, by using the Dickson-Stirling numbers S(n, k, α) (see (116) of 5.2.) have defined the Dickson-Eulerian polynomial by An (x, α) =

n

k!S(n, k, α)x k (1 − x)n−k ,

k=0

and the Dickson-Eulerian numbers by An (x, α) =

n k=0

571

A(n, k, α)x k

CHAPTER 5

The numbers A(n, k, α) have many properties, e.g. n k−i n − i S(n, i, α) i!(−1) A(n, k, α) = n−k i=0 They also have introduced the degenerate Eulerian numbers A(n, k, λ|θ ), which satisfy e.g. Worpitzky type formulas. m ˇ Starting from the identity (202), Z. Sami [381] has introduced the numbers ak,n where n ≥ 1, j ≥ 0, m ∈ {0, 1, . . . , n − 1}, by defining k n m (k + 1 − j)n−m−1 (k − j)m ak,n = (−1) j (210) j j=0 0 = A(n−1, k +1) and An−1 with the convention 00 = 1. Therefore ak,n k,n = A(n−1, k), m so the numbers ak,n can be considered as generalization of the Eulerian numbers A(n, k). m These numbers ak,n satisfy the recurrences m m m ak,n = (k + 1)ak,n−1 + (n − k − 1)ak−1,n−1 (0 ≤ m ≤ n − 2) m−1 m−1 m−1 m ak,n = ak,n − ak,n−1 + ak−1,n−1 (1 ≤ m ≤ n − 1),

where k ≥ 1 and n ≥ 2. m Further, if k ≥ n, then ak,n = 0 and 0, if 0 ≤ m ≤ n − 2 m an−1,n = 1, if m = n − 1

(211)

(212)

and have the symmetric property n−m−1 m ak,n = an−k−1,n for all n ≥ 1; m, k ∈ {0, . . . , n − 1}

(213)

The following identities are true: n−1

m ak,n = A(n, k + 1) (k ≥ 0, n ≥ 1),

m=0 n−1

m ak,n = (n − 1)! (n ≥ 1, 0 ≤ m ≤ n − 1),

k=0

n−i m n−1 −1 k m n i m 2 (−1) ak,n = 2 (−1) Bn−i i n−i k=0 i=0 (n ≥ 3, 1 ≤ m ≤ n − 2) 572

(214)


Let Sk,n =

n−1

(n ≥ 1, k ≥ 0)

i ak+i,n

i=0

Then Sk,1 = 0 if k ≥ 1; = 1 if k = 0, and Sk,n = Sk,1 +!n −

n−1 k

A(r, j)

(215)

r =0 j=0

with !n =

n−1

k! denoting the left-factorial function of Kurepa [266]. Applying (215)

k=0

for k = 0 and k = 1, one gets n−1

i ai,n =!n,

i=0

n−2

i ai+1,n =!n − n

(216)

i=0

From (216) it follows that for p ≥ 3 prime, !p ≡

p−1

(i + 1) p−i−1 i i

(mod p),

i=0

!p =

p−2

(217) (i + 1) p−i i i−1

(mod p)

i=1

Then Kurepa’s conjecture that ! p ≡ 0 (mod p) ∀ p ≥ 3 is equivalent to the following: p−2 (i + 1) p−i i i−1 ≡ 0 (mod p) ∀ p ≥ 3 (218) i=1

An identity as the second one of (214) is valid for the classical Eulerian numbers, too (due to Worpitzky [487]) n

A(n, k) = n!

(219)

k=1

Now, N. Robbins [368] proved the followinf congruence for A(n, k): If p is prime and m ≥ 1, 1 ≤ k ≤ p m − 1, then 0 (mod p), if k ≡ 0 (mod p) m A( p − 1, k) ≡ (220) 1 (mod p), if k ≡ 0 (mod p) 573

CHAPTER 5

p−1

So A( p − 1, k) ≡ 1 (mod p) for 1 ≤ k ≤ p − 1, and by (219), ( p − 1)! = A( p − 1, k) ≡ p − 1 ≡ −1 (mod p). Therefore (220) and (219) imply the

k=1

Wilson theorem: ( p − 1)! ≡ −1 (mod p). For other arithmetic properties of Eulerian numbers, see e.g. L. Carlitz and J. Riordan [98], R. A. Sáenz Casa and J. E. Nymann [374], or K. Knopfmacher and N. Robbins [256]. For example, in [374] one can find that for all primes p and all 1 ≤ k ≤ p one has A( p, k) ≡ 1 (mod p) (220 ) Let P(n, k) = k!S(n, k) (see Part D. of section 4 of 5.2., e.g. relation (194)). Then (220’) is equivalent to the following: P( p, k) ≡

1 (mod p) if k = 1, 0 (mod p) if 2 ≤ k ≤ p

(220 )

These congruences follow in fact from the inversion formulas P(n, k) =

k−1 n−k +i i

i=0

A(n, k) =

k−1 n−k +i P(n, k − i) (−1)i i i=0

combined with the known relation (−1)

4

A(nk − i),

k−1

p−1 ≡ 1 (mod p) for 1 ≤ k ≤ p. k−1

Estimates and inequalities

Estimates and inequalities for Bernoulli or Euler (and Eulerian) numbers have a central importance in many areas connected with related fields. ∞ 1 via B2n . A A. The important property (7) gives the values of ζ (2n) = n 2k k=1 similar property for the Euler numbers is ∞ k=0

(−1)k π 2n+1 n = (−1) E 2n (2k + 1)2n+1 (2n)!22n+2

574

(221)


Relations (7) and (221) yield various inequalities for the Bernoulli or Euler numbers. For example, Ch. Jordan [237] showed that

and

2(2n)! 2(2n)! π 2 < |B | ≤ · 2n (2π )2n (2π )2n 6

(222)

24(2n + 1)(2n + 2) B2n+2 (2n + 1)(2n + 2)

Handbook of number theory

Handbook Of Number Theory

Handbook of number theory