Elementary Introduction to Number TheoryThis accessible Third Edition incorporates especially complete & detailed arguments, illustrating definitions, theorems, & subtleties of proof with explicit numerical examples whenever possible. |
Contents
PRELIMINARY CONSIDERATIONS | 1 |
DIVISIBILITY PROPERTIES OF INTEGERS 39 | 39 |
PRIME NUMBERS | 70 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
a₁ addition algorithm Assume b₁ base called canonical representation ciphertext claimed clear clearly common complete composite congruence consider contains contradiction convergents Corollary course defined DEFINITION denote desired determine digits divided divisible divisors easily element enciphering equal equation equivalent example Exercise exist fact factor Finally follows formula function given gives guess hence hold implies indices induction infinitely least residue less mathematical method Moreover multiplicative notation Note obtain odd prime positive integer possible powers preceding problem Proof prove pseudoprime quadratic residue r₁ reader reduced relation relatively prime remainder represented residue modulo residue system modulo respectively result Similarly simple continued fraction solution solve squares suggests Suppose Theorem theory true unique values Write zero