Thoroughly Revised And Updated, The New Second Edition Of Neville Robbins’ Beginning Number Theory Includes All Of The Major Topics Covered In A Classic Number Theory Course And Blends In Numerous Applications And Specialized Treatments Of Number Theory, Including Cryptology, Fibonacci Numbers, And Computational Number Theory. The Text Strikes A Balance Between Traditional And Algorithmic Approaches To Elementary Number Theory And Is Supported With Numerous Exercises, Applications, And Case Studies Throughout. Computer Exercises For CAS Systems Are Also Included.
FREE Two-Day Shipping for Students. Learn more |
| ||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
1 of 1 people found the following review helpful:
5.0 out of 5 stars
Beginning Number Theory Review,
By
Amazon Verified Purchase(What's this?)
This review is from: Beginning Number Theory (Hardcover)
Excellent introductory text on number theory. Well written, complete with many examples and explanations of the use of such theory. I used it as a reference and to study material that was new to me . I found it quite comprehensible, and covered all the topics in number theory that interested me at the time.
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
Most of us begin our mathematical education by learning how to count. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
literal plaintext, numerical plaintext, numerical ciphertext, linear cipher, positive nonsquare integer, least positive residues, positive irrational number, quadratic sieve method, exhaustive cryptanalysis, canonical factorization, quadratic congruences, been enciphered, polynomial congruences, primitive root, continued fraction representation, computational number theory, continued fraction method, quadratic nonresidue, odd perfect number, continued fraction expansion, nontrivial divisor, integer terms, linear congruences, summation function, following congruences Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Exercises, Prove Theorem, Review Exercises, Euler's Theorem, Therefore Theorem, Fermat's Last Theorem, Sophie Germain, Euclid's Lemma, Euclid's Algorithm, Law of Quadratic Reciprocity, Dirichlet's Theorem, Well-Ordering Principle, Key Step, Every Carmichael, Fermat's Little Theorem, Using Table, Euler's Criterion, John Wallis, Principle of Mathematical Induction, World War, Use Theorems, Remarks Note, Pierre de Fermat, John Pell, King Frederick Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Most of us begin our mathematical education by learning how to count. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
literal plaintext, numerical plaintext, numerical ciphertext, linear cipher, positive nonsquare integer, least positive residues, positive irrational number, quadratic sieve method, exhaustive cryptanalysis, canonical factorization, quadratic congruences, been enciphered, polynomial congruences, primitive root, continued fraction representation, computational number theory, continued fraction method, quadratic nonresidue, odd perfect number, continued fraction expansion, nontrivial divisor, integer terms, linear congruences, summation function, following congruences Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Exercises, Prove Theorem, Review Exercises, Euler's Theorem, Therefore Theorem, Fermat's Last Theorem, Sophie Germain, Euclid's Lemma, Euclid's Algorithm, Law of Quadratic Reciprocity, Dirichlet's Theorem, Well-Ordering Principle, Key Step, Every Carmichael, Fermat's Little Theorem, Using Table, Euler's Criterion, John Wallis, Principle of Mathematical Induction, World War, Use Theorems, Remarks Note, Pierre de Fermat, John Pell, King Frederick Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
2
books
cite this book:
- Elementary Number Theory in Nine Chapters by James J. Tattersall in Back Matter
- Cryptanalysis of Number Theoretic Ciphers (Computational Mathematics) by Samuel S. Wagstaff Jr. in Back Matter
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
