A course in computational algebraic number theory
3rd, corr. print.
Our rough guess is there are 136,250 words in this book.
At a pace averaging 250 words per minute, this book will take 9 hours and 5 minutes to read. With a half hour per day, this will take 18 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Word Count
136,250 words, Guess
Page Count
545 pages
Identifiers
- Open LibraryOL1004987M
- ISBN-103540556400
- OCLC Control Number27810276
- OCLC Control Numbercoursecomputatio00cohe_507
- Library of Congress Control Number96044745
and 3 more
- LibraryThing75765
- WikidataQ27095334
- Goodreads682000
Classifications
- DDC512/.74/028551
- LCCQA247 .C55 1996
Description
Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate.
Subjects
Topics
Series Statement
- Graduate texts in mathematics,
Other Editions
- A course in computational algebraic number theory
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!