Unsolved Problems In Number Theory by Richard GuyUnsolved Problems In Number Theory by Richard Guy

Unsolved Problems In Number Theory

byRichard Guy

Hardcover | July 13, 2004

Pricing and Purchase Info

$81.89 online 
$127.95 list price save 35%
Earn 409 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


Mathematics is kept alive by the appearance of new unsolved problems, problems posed from within mathematics itself, and also from the increasing number of disciplines where mathematics is applied. This book provides a steady supply of easily understood, if not easily solved, problems which can be considered in varying depths by mathematicians at all levels of mathematical maturity.

For this new edition, the author has included new problems on symmetric and asymmetric primes, sums of higher powers, Diophantine m-tuples, and Conway's RATS and palindromes. The author has also included a useful new feature at the end of several of the sections: lists of references to OEIS, Neil Sloane's Online Encyclopedia of Integer Sequences.

About the first Edition:

"...many talented young mathematicians will write their first papers starting out from problems found in this book."András Sárközi, MathSciNet

Title:Unsolved Problems In Number TheoryFormat:HardcoverDimensions:438 pagesPublished:July 13, 2004Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0387208607

ISBN - 13:9780387208602


Table of Contents

Preface to the First Edition Preface to the Second Edition Preface to the Third Edition Glossary of Symbols A. Prime Numbers. A1. Prime values of quadratic functions. A2. Primes connected with factorials. A3. Mersenne primes. Repunits. Fermat numbers. Primes of shape k - 2n + 1. A4. The prime number race. A5. Arithmetic progressions of primes. A6. Consecutive primes in A.P. A7. Cunningham chains. A8. Gaps between primes. Twin primes. A9. Patterns of primes. A10. Gilbreath's conjecture. A11. Increasing and decreasing gaps. A12. Pseudoprimes. Euler pseudoprimes. Strong pseudoprimes. A13. Carmichael numbers. A14. 'Good' primes and the prime number graph. A15. Congruent products of consecutive numbers. A16. Gaussian primes. Eisenstein-Jacobi primes. A17. Formulas for primes. A18. The Erd½os-Selfridge classi.cation of primes. A19. Values of n making n - 2k prime. Odd numbers not of the form ±pa ± 2b. A20. Symmetric and asymmetric primes. B. Divisibility B1. Perfect numbers. B2. Almost perfect, quasi-perfect, pseudoperfect, harmonic, weird, multiperfect and hyperperfect numbers. B3. Unitary perfect numbers. B4. Amicable numbers. B5. Quasi-amicable or betrothed numbers. B6. Aliquot sequences. B7. Aliquot cycles. Sociable numbers. B8. Unitary aliquot sequences. B9. Superperfect numbers. B10. Untouchable numbers. B11. Solutions of mó(m) = nó(n). B12. Analogs with d(n), ók(n). B13. Solutions of ó(n) = ó(n + 1). B14. Some irrational series. B15. Solutions of ó(q) + ó(r) = ó(q + r). B16. Powerful numbers. Squarefree numbers. B17. Exponential-perfect numbers B18. Solutions of d(n) = d(n + 1). B19. (m, n + 1) and (m+1, n) with same set of prime factors. The abc-conjecture. B20. Cullen and Woodallnumbers. B21. k - 2n + 1 composite for all n. B22. Factorial n as the product of n large factors. B23. Equal products of factorials. B24. The largest set with no member dividing two others. B25. Equal sums of geometric progressions with prime ratios. B26. Densest set with no l pairwise coprime. B27. The number of prime factors of n + k which don't divide n + i, 0 ¡Ü i <_20_k.20_b28.20_consecutive20_numbers20_with20_distinct20_prime20_factors.20_b29.20_is20_x20_determined20_by20_the20_prime20_divisors20_of20_x20_2b_20_12c_20_x20_2b_20_22c_.20_.20_.2c_20_x20_2b_20_k3f_20_b30.20_a20_small20_set20_whose20_product20_is20_square.20_b31.20_binomial20_coeffcients.20_b32.20_grimm27_27_s20_conjecture.20_b33.20_largest20_divisor20_of20_a20_binomial20_coeffcient.20_b34.20_if20_there27_27_s20_an20_i20_such20_that20_n20_-20_i20_divides20__nk_.20_b35.20_products20_of20_consecutive20_numbers20_with20_the20_same20_prime20_factors.20_b36.20_euler27_27_s20_totient20_function.20_b37.20_does20_c3b6_28_n29_20_properly20_divide20_n20_-20_13f_20_b38.20_solutions20_of20_c3b6_28_m29_20_3d_20_c3b3_28_n29_.20_b39.20_carmichael27_27_s20_conjecture.20_b40.20_gaps20_between20_totatives.20_b41.20_iterations20_of20_c3b6_20_and20_c3b3_.20_b42.20_behavior20_of20_c3b6_28_c3b3_28_n29_29_20_and20_c3b3_28_c3b6_28_n29_29_.20_b43.20_alternating20_sums20_of20_factorials.20_b44.20_sums20_of20_factorials.20_b45.20_euler20_numbers.20_b46.20_the20_largest20_prime20_factor20_of20_n.20_b47.20_when20_does20_2a20_-2b20_divide20_na20_-20_nb3f_20_b48.20_products20_taken20_over20_primes.20_b49.20_smith20_numbers.20_c.20_additive20_number20_theory20_c1.20_goldbach27_27_s20_conjecture.20_c2.20_sums20_of20_consecutive20_primes.20_c3.20_lucky20_numbers.20_c4.20_ulam20_numbers.20_c5.20_sums20_determining20_members20_of20_a20_set.20_c6.20_addition20_chains.20_brauer20_chains.20_hansen20_chains.20_c7.20_the20_money-changing20_problem.20_c8.20_sets20_with20_distinct20_sums20_of20_subsets.20_c9.20_packing20_sums20_of20_pairs.20_c10.20_modular20_di.erence20_sets20_and20_error20_correcting20_codes.20_c11.20_three-subsets20_with20_distinct20_sums.20_c12.20_the20_postage20_stamp20_problem.20_c13.20_the20_corresponding20_modular20_covering20_problem.20_harmonious20_labelling20_of20_graphs.20_c14. k.="" b28.="" consecutive="" numbers="" with="" distinct="" prime="" factors.="" b29.="" is="" x="" determined="" by="" the="" divisors="" of="" _2b_="" _12c_="" _22c_.="" .="" _.2c_="" _k3f_="" b30.="" a="" small="" set="" whose="" product="" square.="" b31.="" binomial="" coeffcients.="" b32.="" _grimm27_27_s="" conjecture.="" b33.="" largest="" divisor="" coeffcient.="" b34.="" if="" _there27_27_s="" an="" i="" such="" that="" n="" -="" divides="" _nk_.="" b35.="" products="" same="" b36.="" _euler27_27_s="" totient="" function.="" b37.="" does="" _c3b6_28_n29_="" properly="" divide="" _13f_="" b38.="" solutions="" _c3b6_28_m29_="%c3%b3(n)." b39.="" _carmichael27_27_s="" b40.="" gaps="" between="" totatives.="" b41.="" iterations="" _c3b6_="" and="" _c3b3_.="" b42.="" behavior="" _c3b6_28_c3b3_28_n29_29_="" _c3b3_28_c3b6_28_n29_29_.="" b43.="" alternating="" sums="" factorials.="" b44.="" b45.="" euler="" numbers.="" b46.="" factor="" n.="" b47.="" when="" 2a="" -2b="" na="" _nb3f_="" b48.="" taken="" over="" primes.="" b49.="" smith="" c.="" additive="" number="" theory="" c1.="" _goldbach27_27_s="" c2.="" c3.="" lucky="" c4.="" ulam="" c5.="" determining="" members="" set.="" c6.="" addition="" chains.="" brauer="" hansen="" c7.="" money-changing="" problem.="" c8.="" sets="" subsets.="" c9.="" packing="" pairs.="" c10.="" modular="" di.erence="" error="" correcting="" codes.="" c11.="" three-subsets="" sums.="" c12.="" postage="" stamp="" c13.="" corresponding="" covering="" harmonious="" labelling="" graphs.="">

Editorial Reviews

From the reviews of the third edition: "This is the third edition of Richard Guy's well-known problem book on number theory . . The earlier editions have served well in providing beginners as well as seasoned researchers in number theory with a good supply of problems. . many of the problems from earlier editions have been expanded with more up-to-date comments and remarks. . There is little doubt that a new generation of talented young mathematicians will make very good use of this book . ." (P. Shiu, The Mathematical Gazette, Vol. 89 (516), 2005)"The earlier editions of this book are among the most-opened books on the shelves of many practicing number theorists. The descriptions of state-of-the-art results on every topic and the extensive bibliographies in each section provide valuable ports of entry to the vast literature. A new and promising addition to this third edition is the inclusion of frequent references to entries in the Online encyclopedia of integer sequences at the end of each topic." (Greg Martin, Mathematical Reviews, Issue 2005 h)