Synopsis:
This edition has been updated to include advances in computational prime number theory and in factorization, as well as re-computed and enlarged tables, accompanied by new tables reflecting research by both the author and his co-workers, and by independent researchers. The book treats four fundamental problems: the number of primes below a given limit; the approximation of primes; the recognition of primes; and the factorization of large numbers. The author provides explicit algorithms and computer programs, which are written in PASCAL in order to allow the reader to translate the programs into the language of their own computers.
Review:
"Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfully passes a critical milestone not allowed to many books, viz., a second edition. Many good things have happened to computational number theory during the ten years since the first edition appeared and the author includes their highlights in great depth. Several major sections have been rewritten and totally new sections have been added. The new material includes advances on applications of the elliptic curve method, uses of the number field sieve, and two new appendices on the basics of higher algebraic number fields and elliptic curves. Further, the table of prime factors of Fermat numbers has been significantly up-dated. ...Several other tables have been added so as to provide data to look for large prime factors of certain 'generalized' Fermat numbers, while several other tables on special numbers were simply deleted in the second edition. Still one can make several perplexing assertions or challenges: (1) prove that F\sb 5, F\sb 6, F\sb 7, F\sb 8 are the only four consecutive Fermat numbers which are bi-composite; (2) Show that F\sb{14} is bi- composite. (This accounts for the difficulty in finding a prime factor for it.) (3) What is the smallest Fermat quadri-composite?; and (4) Does there exist a Fermat number with an arbitrarily prescribed number of prime factors? All in all, this handy volume continues to be an attractive combination of number-theoretic precision, practicality, and theory with a rich blend of computer science." –Zentralblatt Math
"About this title" may belong to another edition of this title.
