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 |
PRIME NUMBERS | 70 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
a₁ algorithm b₁ c₁ canonical representation Chinese remainder theorem cipher common divisor common multiple complete residue system Computer Exercise Corollary digits divisible enciphering equation Euler's criterion example exist integers factor Fermat's theorem following theorem form 4k formula guess Hint implies incongruent solutions modulo integers modulo integers q integral squares least element m₁ mathematical induction Mersenne primes Miller test nonzero notation Note number of positive Number Theory obtain odd prime p₁ plaintext Pn+1 polynomial positive divisors primitive root modulo prove pseudoprime to base Pythagorean triple quadratic nonresidue quadratic residue modulo r₁ real number reduced residue system relatively prime residue system modulo result is true result of Exercise Section simple continued fraction solvable solve Suppose values well-ordering principle Wilson's theorem Write a computer Write a program zero Σ Σ