Contents Preface to the Third Edition v Preface to the Second Edition vii Preface to the First Edition ix Glossary of Symbols xi Introduction 1 A. Prime Numbers 3 A1. Prime values of quadratic functions. 7 A2. Primes connected with factorials. 10 A3. Mersenne primes. Repunits. Fermat numbers. Primes of shape k . 2n + 1. 13 A4. The prime number race. 22 A5. Arithmetic progressions of primes. 25 A6. Consecutive primes in A.P.28 A7. Cunningham chains. 30 A8. Gaps between primes. Twin primes. 31 A9. Patterns of primes. 40 A10. Gilbreath's conjecture. 42 A11. Increasing and decreasing gaps. 43 A12. Pseudoprimes. Euler pseudoprimes. Strong pseudoprimes. 44 A13. Carmichael numbers. 50 A14. "Good" primes and the prime number graph. 54 A15. Congruent products of consecutive numbers. 54 A16. Gaussian and Eisenstein-Jacobi primes. 55 A17. Formulas for primes. 58 A18. The Erd？s-Selfridge classification of primes. 66 A19. Values of n making n - 2k prime. Odd numbers not of the form ±pα±2b . 67 A20. Symmetric and asymmetric primes. 69 B. Divisibility 71 B1. Perfect numbers. 71 B2. Almost perfect, quasi-perfect, pseudoperfect, harmonic, weird, multiperfect and hyperperfect numbers. 74 B3. Unitary perfect numbers. 84 B4. Amicable numbers. 86 B5. Quasi-amicable or betrothed numbers. 91 B6. Aliquot sequences. 92 B7. Aliquot cycles. Sociable numbers. 95 B8. Unitary aliquot sequences. 97 B9. Superperfect numbers. 99 B10. Untouchable numbers. 100 B11. Solutions of mσ (m) = nσ(n). 101 B12. Analogs with d(n) σk(n). 102 B13. Solutions of σ (n) = σ (n + 1). 103 B14. Some irrational series. 104 B15. Solutions of σ (q) + σ (r) = σ (q + r). 105 B16. Powerful numbers. Squarefree numbers. 105 B17. Exponential-perfect numbers 110 B18. Solutions of d(n) = d(n+1).111 B19. (m,n+1) and (m+1,n) with same set of prime factors. The abc-conjecture. 113 B20. Cullen and Woodall numbers. 119 B21. k . 2π+ 1 composite for all n. 119 B22. Factorial n as the product of n large factors. 122 B23. Equal products of factorials. 123 B24. The largest set with no member dividing two others. 124 B25. Equal sums of geometric progressions with prime ratios. 124 B26. Densest set with no l pairwise coprime. 125 B27. The number of prime factors of n + k which don't divide n + i, 0≤i < k. 126 B28. Consecutive numbers with distinct prime factors. 126 B29. 1s x determined by the prime divisors of x + 1, x + 2, ..., x + k? 127 B30. A small set whose product is square. 128 B31. Binomial coefficients. 129 B32. Grimm's conjecture. 133 B33. Largest divisor of a binomial coefficient. 134 B34. If there's an I such that n - i divides (nk). 137 B35. Products of consecutive numbers with the same prime factors. 137 B36. Euler's totient function. 138 B37. Does 4>(n) properly divide n - 1? 142 B38. Solutions of *(m) = σ (n). 144 B39. Carmichael's conjecture. 144 B40. Gaps between totatives. 146 B41. 1terations of 4> and σ.147 B42. Behavior of *(σ (n)) and σ(4) (n)). 150 B43. Alternating sums of factorials . 152 B44. Sums of factorials. 153 B45. Euler numbers. 154 B46. The largest prime factor of n. 154 B47. When does 2a - 2b divide nα-η b? 155 B48. Products taken over primes. 155 B49. Smith numbers. 156 B50. Ruth-Aaron numbers. 157 C. Additive Number Theory 159 C1. Goldbach's conjecture. 159 C2. Sums of consecutive primes. 164 C3. Lucky numbers. 164 C4. Ulam numbers. 166 C5. Sums determining members of a set. 167 C6. Addition chains. Brauer chains. Hansen chains. 169 C7. The money-changing problem. 171 C8. Sets with distinct sums of subsets. 174 C9. Packing sums of pairs. 175 C10. Modular difference sets and error correcting codes. 181 C11. Three-subsets with distinct sums. 184 C12. The postage stamp problem. 185 C13. The corresponding modular covering problem. Harmonious labelling of graphs. 190 C14. Maximal sum-free sets. 191 C15. Maximal zerφsum-free sets. 193 C16. Nonaveraging sets. Nondividing sets. 198 C17. The minimum overlap problem. 199 C18. The n queens problem. 200 C19. 1s a weakly indedendent sequence the finite union of strongly independent ones? 203 C20. Sums of squares. 204 C21. Sums of higher powers. 207 D. Diophantine Equations 209 D 1. Sums of like powers. Euler's conjecture. 209 D2. The Fermat problem. 218 D3. Figurate numbers. 222 D4. Waring's problem. Sums of l kth Powers. 229 D5. Sum of four cubes. 231 D6. An elementary solution of x2 = 2y4- 1. 234 D7. Sum of consecutive powers made a power. 235 D8. A pyramidal diophantine equation. 237 D9. Catalan conjecture. Difference of two powers. 238 DI0. Exponential diophantine equations. 242 D11. Egyptian fractions. 252 D12. Markoff numbers. 263 D13. The equation xxyy= zz. 265 D14. ai+ bj made squares. 266 D15. Numbers whose sums in pairs make squares. 268 D16.τ'riples with the same sum and same product. 271 D17. Product of blocks of consecutive integers not a power. 272 D18. Is there a perfect cuboid? Four squares whose sums in pairs are square. Four squares whose differences are square. 275 D19. Rational distances from the corners of a square. 283 D20. Six general points at rational distances. 287 D21. Triangles with integer edges, medians and area. 290 D22. Simplexes with rational contents. 293 D23. Some quartic equations. 296 D24. Sum equals product. 299 D25. Equations involving factorial n . 301 D26. Fibonacci numbers of various shapes. 302 D27. Congruent numbers. 306 D28. A reciprocal diophantine equation. 309 D29. Diophantine m-tuples. 310 E. Sequences of 1ntegers 311 E1. A thin sequence with all numbers equal to a member plus a prime. 311 E2. Density of a sequence with l.c.m. of each pair less than x. 312 E3. Density of integers with two comparable divisors. 313 E4. Sequence with no member dividing the product of r others. 314 E5. Sequence with members divisible by at least one of a given set. 315 E6. Sequence with sums of pairs not members of a given sequence. 315 E7. A series and a sequence involving primes. 316 E8. Sequence with no sum of a pair a square. 316 E9. Partitioning the integers into classes with numerous sums of pairs. 316 EI0. Theorem of van der Waerden. Szemerédi's theorem. Partitioning the integers into classes; at least one contains an A.P. 317 E11. Schur's problem. Partitioning integers into sum-free classes. 323 E12. The modular version of Schur's problem. 325 E13. Partitioning into strongly sum-free classes. 327 E14. Rado's generalizations of van der Waerden's and Schur's problems. 327 E15. A recursion of Gobel. 329 E16. The 3x + 1 problem. 330 E17. Permutation sequences. 336 E18. Mahler’s、Z-numbers. 337 E19. Are the integer parts of the powers of a fraction infinitely often prime? 338 E20. Davenport-Schinzel sequences. 338 E21. Thue-Morse sequences. 340 E22. Cycles and sequences containing all permutations as subsequences. 345 E23. Covering the integers with A.P.s. 345 E24. lrrationality sequences. 346 E25. Golomb's self-histogramming sequence. 347 E26. Epstein's Put-or-Take-a-Square game.349 E27. Max and mex sequences. 349 E28. Bγsequences . Mian-Chowla sequences. 350 E29. Sequence with sums and products all in one of two classes. 352 E30. MacMahon's prime numbers of measurement. 352 E31. Three sequences of Hofstadter. 353 E32. B 2-sequences 企om the greedy algorithm. 355 E33. Sequences containing no monotone A.P.s. 357 E34. Happy numbers. 357 E35. The Kimberling shuffie. 359 E36. Klarner-Rado sequences. 361 E37. Mousetrap. 361 E38. Odd sequences 362 F. None of the Above 365 F 1. Gau？'s lattice point problem. 365 F2. Lattice points with distinct distances. 367 F3. Lattice points, no four on a circle. 368 F4. The no-three-in-line problem. 368 F5. Quadratic residues. Schur's conjecture. 372 F6. Patterns of quadratic residues. 374 F7. A cubic analog of a Bhaskara equation. 376 F8. Quadratic residues whose differences are quadratic residues. 377 F9. Primitive roots 377 FI0. Residues of powers of two. 380 F11. Distribution of residues of factorials. 381 F12. How often are a number and its inverse of opposite parity? 381 F13. Covering systems of congruences. 383 F14. Exact covering systems. 386 F15. A problem of R. L. Graham. 390 F16. Products of small prime powers dividing n. 391 F17. Series associated with the 中function. 391 F18. Size of the set of sums and products of a set. 393 F19. Partitions into distinct primes with maximum product. 394 F20. Continued 企actions. 395 F21. All partial quotients one or two. 395 F22. Algebraic numbers with unbounded partial quotients. 396 F23. Small differences between powers of 2 and 3. 396 F24. Some decimal digital problems. 398 F25. The persistence of a number. 398 F26. Expressing numbers using just ones. 399 F27. Mahler's generalization of Farey series. 400 F28. A determinant of value one. 401 F29. Two congruences, one of which is always solvable. 402 F30. A polynomial whose sums of pairs of values are all distinct. 403 F31. Miscellaneous digital problems. 403 F32. Conway's RATS and palindromes. 404 lndex of Authors Cited 405 General lndex 429
京公网安备 11010102004214号