Elementary Introduction to Number Theory |
Contents
Preliminary Considerations | 1 |
Divisibility Properties of Integers | 21 |
Prime Numbers | 40 |
Copyright | |
5 other sections not shown
Other editions - View all
Common terms and phrases
algorithm canonical representation Chinese remainder theorem complete residue system completely multiplicative congruent modulo Corollary Definition divided divisible equation example exist integers exponent factor Fermat's theorem Find following theorem follows from Theorem form 4k formula Gauss given congruence greatest common divisor Hint implies incongruent solutions modulo infinitely many primes integers not exceeding integers q integral coefficients least element least positive log Pn mathematical induction Möbius inversion formula mod pª mth power residues notation number of positive number-theoretic function obtain odd prime Pn+1 positive divisors positive integers preceding theorem prime number primitive Pythagorean triplet primitive root modulo proof is complete prove Pythagorean triplet quadratic character quadratic residue modulo real number reduced residue system relatively prime residue system modulo result of Exercise Section solution of f(x solvable solving Suppose Theorem 2.1 true values well-ordering principle Wilson's theorem zero Σμ(α