Numbers are part of our everyday experience and their properties have fascinated mankind since ancient times. Deciding whether a number is prime and if not, what its factors are, are both fundamental problems. In recent years analysis and solution of these problems have assumed commercial significance since large primes are an essential feature of secure methods of information transmission. The purely mathematical fascination that led to the development of methods for primality testing has been supplemented by the need to test within reasonable timescales, and computational methods have entered at all levels of number theory. In this book, Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of the book is the large number of computer programs (written in Pascal) and a wealth of computational exercises and projects (in addition to more usual theory exercises). The theoretical development includes continued fractions and quadratic residues, directed always towards the two fundamental problems of primality testing and factorization. There is time, all the same, to include a number of topics and projects of a purely 'recreational' nature.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
"An interesting, sophisticated introduction to number theory..." American Mathematical Monthly
"Of the many volumes I have seen about `number theory and computing', this delightful, if unorthodox, introductory text is probably the finest...a great strength of this book is its emphasis on computing and on computing examples. There are several programs included in the text, often different algorithms for achieving the same computational result, and both theoretical and practical reasons for preferring one method over another are discussed. The programming language is Pascal, which is perfectly appropriate...[and] there are a great many numerial exercises and examples...only the deadest of students could possibly consider this dry; the author has brought life and energy to the subject by his presentation." Duncan Buell, Mathematical Reviews
In this introductory book, Peter Giblin describes some of the more elementary methods that do not require detailed knowledge of other areas of mathematics. He supplies a number of programs written in Pascal that are implementations of some of the mathematical arguments.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
(nessuna copia disponibile)
Cerca: Inserisci un desiderataNon riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!
Inserisci un desiderata