Imagen 1 de 5
Galería
Imagen 1 de 5
¿Quieres vender uno?
Prime Numbers: A Computational Perspective by Crandall EUC
USD64,50
Aproximadamente55,32 EUR
o Mejor oferta
Estado:
Como nuevo
Libro en perfecto estado y poco leído. La tapa no tiene desperfectos y si procede, con sobrecubierta para las tapas duras. Incluye todas las páginas sin arrugas ni roturas. El texto no está subrayado ni resaltado de forma alguna, y no hay anotaciones en los márgenes. Puede presentar marcas de identificación mínimas en la contraportada o las guardas. Muy poco usado. Consulta el anuncio del vendedor para obtener más información y la descripción de cualquier posible imperfección.
- ¡Cómpralo ya!Prime Numbers: A Computational Perspective by Crandall EUC
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Envío:
USD6,72 (aprox. 5,76 EUR) USPS Media MailTM.
Ubicado en: Springfield, Oregon, Estados Unidos
Entrega:
Entrega prevista entre el sáb. 9 ago. y el mar. 12 ago. a 94104
Devoluciones:
No se aceptan devoluciones.
Pagos:
Compra con confianza
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:226841875661
Características del artículo
- Estado
- ISBN
- 9780387252827
Acerca de este producto
Product Identifiers
Publisher
Springer New York
ISBN-10
0387252827
ISBN-13
9780387252827
eBay Product ID (ePID)
127422220
Product Key Features
Number of Pages
Xv, 597 Pages
Language
English
Publication Name
Prime Numbers : a Computational Perspective
Subject
Number Theory
Publication Year
2005
Features
Revised
Type
Textbook
Subject Area
Mathematics
Format
Hardcover
Dimensions
Item Weight
80.4 Oz
Item Length
9.3 in
Item Width
6.1 in
Additional Product Features
Edition Number
2
Intended Audience
Scholarly & Professional
LCCN
2005-923504
Dewey Edition
22
Reviews
From the reviews:MATHEMATICAL REVIEWS"There are many books about the theory of prime numbers and a few about computations concerning primes. This book bridges the gap between theoretical and computational aspects of prime numbers. It considers such matters as how to recognize primes, how to compute them, how to count them, and how to test conjectures about them¿The book is clearly written and is a pleasure to read. It is largely self-contained. A first course in number theory and some knowledge of computer algorithms should be sufficient background for reading it…Each chapter concludes with a long list of interesting exercises and research problems." BULLETIN OF THE AMS"The book is an excellent resource for anyone who wants to understand these algorithms, learn how to implement them, and make them go fast. It's also a lot of fun to read! It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book."AMERICAN SCIENTIST"…a welcome addition to the literature of number theory comprehensive, up-to-date and written with style. It will be useful to anyone interested in algorithms dealing with the arithmetic of the integers and related computational issues."SIAM REVIEW"Overall, this book by Crandall and Pomerance fills a unique niche a deserves a place on the bookshelf of anyone with more than a passing interest in prime numbers. It would provide a gold mine of information and problems for a graduate class on computationl number theory."From the reviews of the second edition:"This book is a very successful attempt of the authors to describe the current state-of-the-art of computational number theory … . One of the many attractive features of this book is the rich and beautiful set of exercises and research problems … . the authors have managed to lay down their broad and deep insight in primes into this book in a very lucid and vivid way. … The book provides excellent material for graduate and undergraduate courses on computational theory. Warmly recommended … ." (H.J.J. te Riele, Nieuw Archief voor Wiskunde, Vol. 7 (3), 2006)"An absolutely wonderful book! Written in a readable and enthusiastic style the authors try to share the elegance of the prime numbers with the readers … . Weaving together a wealth of ideas and experience from theory and practice they enable the reader to have more than a glimpse into the current state of the knowledge … . any chapter or section can be singled out for high praise. … Indeed it is destined to become a definitive text on … prime numbers and factoring." (Peter Shiu, Zentralblatt MATH, Vol. 1088 (14), 2006)"This impressive book represents a comprehensive collection of the properties of prime numbers. … in the exercises at the end of each chapter valuable hints are given how the theorems have been attained. The chapters end with research exercises. The book is up to date and carefully written. … The volume is very vividly and even entertainingly written and is best suited for students and for teachers as well." (J. Schoissengeier, Monatshefte für Mathematik, Vol. 150 (1), 2007)"The aim of this book is to bridge the gap between prime-number theory covered in many books and the relatively new area of computer experimentation and algorithms. The aim is admirably met. … There is a comprehensive and useful list of almost 500 references including many to websites. … This is an interesting, well-written and informative book neatly covering both the theoretical as well as the practical computational implementation of prime numbers and many related topics at first-year undergraduate level." (Ron Knott, The Mathematical Gazette, Vol. 92 (523), 2008), From the reviews: MATHEMATICAL REVIEWS "There are many books about the theory of prime numbers and a few about computations concerning primes. This book bridges the gap between theoretical and computational aspects of prime numbers. It considers such matters as how to recognize primes, how to compute them, how to count them, and how to test conjectures about themThe book is clearly written and is a pleasure to read. It is largely self-contained. A first course in number theory and some knowledge of computer algorithms should be sufficient background for reading it...Each chapter concludes with a long list of interesting exercises and research problems." BULLETIN OF THE AMS "The book is an excellent resource for anyone who wants to understand these algorithms, learn how to implement them, and make them go fast. It's also a lot of fun to read! It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book." AMERICAN SCIENTIST "...a welcome addition to the literature of number theory - comprehensive, up-to-date and written with style. It will be useful to anyone interested in algorithms dealing with the arithmetic of the integers and related computational issues." SIAM REVIEW "Overall, this book by Crandall and Pomerance fills a unique niche a deserves a place on the bookshelf of anyone with more than a passing interest in prime numbers. It would provide a gold mine of information and problems for a graduate class on computationl number theory." From the reviews of the second edition: "This book is a very successful attempt of the authors to describe the current state-of-the-art of computational number theory ... . One of the many attractive features of this book is the rich and beautiful set of exercises and research problems ... . the authors have managed to lay down their broad and deep insight in primes into this book in a very lucid and vivid way. ... The book provides excellent material for graduate and undergraduate courses on computational theory. Warmly recommended ... ." (H.J.J. te Riele, Nieuw Archief voor Wiskunde, Vol. 7 (3), 2006) "An absolutely wonderful book! Written in a readable and enthusiastic style the authors try to share the elegance of the prime numbers with the readers ... . Weaving together a wealth of ideas and experience from theory and practice they enable the reader to have more than a glimpse into the current state of the knowledge ... . any chapter or section can be singled out for high praise. ... Indeed it is destined to become a definitive text on ... prime numbers and factoring." (Peter Shiu, Zentralblatt MATH, Vol. 1088 (14), 2006) "This impressive book represents a comprehensive collection of the properties of prime numbers. ... in the exercises at the end of each chapter valuable hints are given how the theorems have been attained. The chapters end with research exercises. The book is up to date and carefully written. ... The volume is very vividly and even entertainingly written and is best suited for students and for teachers as well." (J. Schoissengeier, Monatshefte fr Mathematik, Vol. 150 (1), 2007) "The aim of this book is to bridge the gap between prime-number theory covered in many books and the relatively new area of computer experimentation and algorithms. The aim is admirably met. ... There is a comprehensive and useful list of almost 500 references including many to websites. ... This is an interesting, well-written and informative book neatly covering both the theoretical as well as the practical computational implementation of prime numbers and many related topics at first-year undergraduate level." (Ron Knott, The Mathematical Gazette, Vol. 92 (523), 2008), From the reviews: MATHEMATICAL REVIEWS "There are many books about the theory of prime numbers and a few about computations concerning primes. This book bridges the gap between theoretical and computational aspects of prime numbers. It considers such matters as how to recognize primes, how to compute them, how to count them, and how to test conjectures about themA?The book is clearly written and is a pleasure to read. It is largely self-contained. A first course in number theory and some knowledge of computer algorithms should be sufficient background for reading ita? Each chapter concludes with a long list of interesting exercises and research problems." BULLETIN OF THE AMS "The book is an excellent resource for anyone who wants to understand these algorithms, learn how to implement them, and make them go fast. It's also a lot of fun to read! It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book." AMERICAN SCIENTIST "a? a welcome addition to the literature of number theory a? comprehensive, up-to-date and written with style. It will be useful to anyone interested in algorithms dealing with the arithmetic of the integers and related computational issues." SIAM REVIEW "Overall, this book by Crandall and Pomerance fills a unique niche a deserves a place on the bookshelf of anyone with more than a passing interest in prime numbers. It would provide a gold mine of information and problems for a graduate class on computationl number theory.", From the reviews: MATHEMATICAL REVIEWS "There are many books about the theory of prime numbers and a few about computations concerning primes. This book bridges the gap between theoretical and computational aspects of prime numbers. It considers such matters as how to recognize primes, how to compute them, how to count them, and how to test conjectures about them¿The book is clearly written and is a pleasure to read. It is largely self-contained. A first course in number theory and some knowledge of computer algorithms should be sufficient background for reading it...Each chapter concludes with a long list of interesting exercises and research problems." BULLETIN OF THE AMS "The book is an excellent resource for anyone who wants to understand these algorithms, learn how to implement them, and make them go fast. It's also a lot of fun to read! It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book." AMERICAN SCIENTIST "...a welcome addition to the literature of number theory - comprehensive, up-to-date and written with style. It will be useful to anyone interested in algorithms dealing with the arithmetic of the integers and related computational issues." SIAM REVIEW "Overall, this book by Crandall and Pomerance fills a unique niche a deserves a place on the bookshelf of anyone with more than a passing interest in prime numbers. It would provide a gold mine of information and problems for a graduate class on computationl number theory." From the reviews of the second edition: "This book is a very successful attempt of the authors to describe the current state-of-the-art of computational number theory ... . One of the many attractive features of this book is the rich and beautiful set of exercises and research problems ... . the authors have managed to lay down their broad and deep insight in primes into this book in a very lucid and vivid way. ... The book provides excellent material for graduate and undergraduate courses on computational theory. Warmly recommended ... ." (H.J.J. te Riele, Nieuw Archief voor Wiskunde, Vol. 7 (3), 2006) "An absolutely wonderful book! Written in a readable and enthusiastic style the authors try to share the elegance of the prime numbers with the readers ... . Weaving together a wealth of ideas and experience from theory and practice they enable the reader to have more than a glimpse into the current state of the knowledge ... . any chapter or section can be singled out for high praise. ... Indeed it is destined to become a definitive text on ... prime numbers and factoring." (Peter Shiu, Zentralblatt MATH, Vol. 1088 (14), 2006) "This impressive book represents a comprehensive collection of the properties of prime numbers. ... in the exercises at the end of each chapter valuable hints are given how the theorems have been attained. The chapters end with research exercises. The book is up to date and carefully written. ... The volume is very vividly and even entertainingly written and is best suited for students and for teachers as well." (J. Schoissengeier, Monatshefte für Mathematik, Vol. 150 (1), 2007) "The aim of this book is to bridge the gap between prime-number theory covered in many books and the relatively new area of computer experimentation and algorithms. The aim is admirably met. ... There is a comprehensive and useful list of almost 500 references including many to websites. ... This is an interesting, well-written and informative book neatly covering both the theoretical as well as the practical computational implementation of prime numbers and many related topics at first-year undergraduate level." (Ron Knott, The Mathematical Gazette, Vol. 92 (523), 2008)
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
512.7/23
Edition Description
Revised edition
Table Of Content
Primes!.- Number-Theoretical Tools.- Recognizing Primes and Composites.- Primality Proving.- Exponential Factoring Algorithms.- Subexponential Factoring Algorithms.- Elliptic Curve Arithmetic.- The Ubiquity of Prime Numbers.- Fast Algorithms for Large-Integer Arithmetic.
Synopsis
Prime numbers beckon to the beginner, the basic notion of primality being accessible to a child. Yet, some of the simplest questions about primes have stumped humankind for millennia. In this book, the authors concentrate on the computational aspects of prime numbers, such as recognizing primes and discovering the fundamental prime factors of a given number. Over 100 explicit algorithms cast in detailed pseudocode are included in the book. Applications and theoretical digressions serve to illuminate, justify, and underscore the practical power of these algorithms. The 2nd edition adds new material on primality and algorithms and updates all the numerical records, such as the largest prime, etc. It has been revised throughout. From the reviews of the first edition: ...Prime Numbers is a welcome addition to the literature of number theory - comprehensive, up-to-date and written with style. American Scientist ... Crandall and Pomerance have written a terrific book. Bulletin of the AMS, In the new edition of this highly successful book, Richard Crandall and Carl Pomerance have provided updated material on theoretical, computational, and algorithmic fronts, including the striking new "AKS" test for recognizing prime numbers. Other examples: new computational results on the Riemann hypothesis, a very new and superfast pure-binary algorithm for the greatest common divisor, and new forms of the fast Fourier transform. The authors also list many new computational records and survey new developments in the theory of prime numbers, including the proof that there are arbitrarily long arithmetic progressions of primes and the proof that 8 and 9 are the only consecutive powers. Numerous exercises have also been added. About the first edition: "It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book." - Bulletin of the AMS, Prime numbers beckon to the beginner, the basic notion of primality being accessible to a child. Yet, some of the simplest questions about primes have stumped humankind for millennia. In this book, the authors concentrate on the computational aspects of prime numbers, such as recognizing primes and discovering the fundamental prime factors of a given number. Over 100 explicit algorithms cast in detailed pseudocode are included in the book. Applications and theoretical digressions serve to illuminate, justify, and underscore the practical power of these algorithms. The 2nd edition adds new material on primality and algorithms and updates all the numerical records, such as the largest prime, etc. It has been revised throughout. From the reviews of the first edition: "...The exercises are a gold mine of interesting examples, pointers to the literature and potential research projects. ... Prime Numbers is a welcome addition to the literature of number theory--comprehensive, up-to-date and written with style. It will be useful to anyone interested in algorithms dealing with the arithmetic of the integers and related computational issues." American Scientist "Destined to become a definitive textbook conveying the most modern computational ideas about prime numbers and factoring, this book will stand as an excellent reference for this kind of computation, and thus be of interest to both educators and researchers. It is also a timely book, since primes and factoring have reached a certain vogue, partly because of cryptography. ..." L'Enseignement Mathématique "The book is an excellent resource for anyone who wants to understand these algorithms, learn how to implement them, and make them go fast. It's also a lot of fun to read! It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book." Bulletin of the AMS, In the new edition of this highly successful book, Richard Crandall and Carl Pomerance have provided updated material on theoretical, computational, and algorithmic fronts, including the striking new "AKS" test for recognizing prime numbers. Other examples: new computational results on the Riemann hypothesis, a very new and superfast pure-binary algorithm for the greatest common divisor, and new forms of the fast Fourier transform. The authors also list many new computational records and survey new developments in the theory of prime numbers, including the proof that there are arbitrarily long arithmetic progressions of primes and the proof that 8 and 9 are the only consecutive powers. Numerous exercises have also been added. About the first edition:"It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book."- Bulletin of the AMS, Prime numbers beckon to the beginner, the basic notion of primality being accessible to a child. Yet, some of the simplest questions about primes have stumped humankind for millennia. In this book, the authors concentrate on the computational aspects of prime numbers, such as recognizing primes and discovering the fundamental prime factors of a given number. Over 100 explicit algorithms cast in detailed pseudocode are included in the book. Applications and theoretical digressions serve to illuminate, justify, and underscore the practical power of these algorithms. The 2nd edition adds new material on primality and algorithms and updates all the numerical records, such as the largest prime, etc. It has been revised throughout. From the reviews of the first edition: "...The exercises are a gold mine of interesting examples, pointers to the literature and potential research projects. ... Prime Numbers is a welcome addition to the literature of number theory--comprehensive, up-to-date and written with style. It will be useful to anyone interested in algorithms dealing with the arithmetic of the integers and related computational issues." American Scientist "Destined to become a definitive textbook conveying the most modern computational ideas about prime numbers and factoring, this book will stand as an excellent reference for this kind of computation, and thus be of interest to both educators and researchers. It is also a timely book, since primes and factoring have reached a certain vogue, partly because of cryptography. ..." L'Enseignement Math matique "The book is an excellent resource for anyone who wants to understand these algorithms, learn how to implement them, and make them go fast. It's also a lot of fun to read It's rare to say this of a math book, but open Prime Numbers to a random page and it's hard to put down. Crandall and Pomerance have written a terrific book." Bulletin of the AMS
LC Classification Number
QA241-247.5
Descripción del artículo del vendedor
Acerca de este vendedor
River House Collection
100% de votos positivos•5,1 mil artículos vendidos
Registrado como vendedor particularPor tanto, no se aplican los derechos de los consumidores derivados de las leyes de protección de los consumidores de la UE. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más informaciónMás información
Votos de vendedor (1.639)
- 1***i (912)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaI received my quilt & pillow shams. My items were shipped to protect them and packaged very well. The items were as described and were brand new. I am very pleased with what I purchased. I personally like the vintage look and love light weight bedding. I was pleased to buy with a reasonable price and the shipping was extremely fast. I had good communication with the seller.
- e***l (50)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaExcellent seller! My Bible was perfectly packaged to protect it, and it was exactly as described. It arrived 3 days early. I was very pleased with the price.Holy Bible Giant Print NKJV Red Letter Edition Nelson 223BG 1984 Vintage (#226592056286)
- m***_ (195)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaBeautiful set of dishes in perfect condition just as descibed! The seller is a packaging pro and all pieces arrived safe and sound! Seriously can’t tell you how well they were packed to avoid any breakage. Completely worth the price paid.
River House Collection
100% de votos positivos•5,1 mil artículos vendidos
Registrado como vendedor particularPor tanto, no se aplican los derechos de los consumidores derivados de las leyes de protección de los consumidores de la UE. La Garantía al cliente de eBay sigue aplicando a la mayoría de compras. Más informaciónMás información
Votos de vendedor (1.639)
- 1***i (912)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaI received my quilt & pillow shams. My items were shipped to protect them and packaged very well. The items were as described and were brand new. I am very pleased with what I purchased. I personally like the vintage look and love light weight bedding. I was pleased to buy with a reasonable price and the shipping was extremely fast. I had good communication with the seller.
- e***l (50)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaExcellent seller! My Bible was perfectly packaged to protect it, and it was exactly as described. It arrived 3 days early. I was very pleased with the price.Holy Bible Giant Print NKJV Red Letter Edition Nelson 223BG 1984 Vintage (#226592056286)
- m***_ (195)- Votos emitidos por el comprador.Últimos 6 mesesCompra verificadaBeautiful set of dishes in perfect condition just as descibed! The seller is a packaging pro and all pieces arrived safe and sound! Seriously can’t tell you how well they were packed to avoid any breakage. Completely worth the price paid.