Challenging, accessible mathematical adventures involving prime numbers, number patterns, irrationals and iterations, calculating prodigies, and more. ". . . splendidly written, well selected and presented collection . . ." โ Martin Gardner.
Computational excursions in analysis and number theory
โ Scribed by Peter Borwein
- Book ID
- 127425887
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 2 MB
- Series
- CMS Books in Mathematics
- Edition
- 1
- Category
- Library
- ISBN-13
- 9780387954448
No coin nor oath required. For personal study only.
โฆ Synopsis
This book is designed for a computationally intensive graduate course based around a collection of classical unsolved extremal problems for polynomials. These problems, all of which lend themselves to extensive computational exploration, live at the interface of analysis, combinatorics and number theory so the techniques involved are diverse.A main computational tool used is the LLL algorithm for finding small vectors in a lattice. Many exercises and open research problems are included. Indeed one aim of the book is to tempt the able reader into the rich possibilities for research in this area.
๐ SIMILAR VOLUMES
A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number