What people are saying - Write a review
We haven't found any reviews in the usual places.
Chapter J AN INTRODUCTION TO NUMBER THEORY
THE EUCLIDEAN ALGORITHM AND UNIQUE
7 other sections not shown
associate b(mod c(mod casting out nines cell Chapter column complete residue system complex numbers congruence x2 congruent mod conjecture continued fraction expansion decimal expansion definition degree mod Diophantine equations divides divisible entries equal equation x2 Euclidean algorithm Euler exactly example fact Fermat Fermat-Pell equation Fermat's last theorem Figure Find all solutions finite follows give given greatest common divisor hence Hint infinitely many solutions integral coefficients integral solutions l(mod last three digits magic square matrix MISCELLANEOUS EXERCISES multiplicative n x n square nonunit nonzero number theory odd prime Pell equation polynomial positive integers prime in Q primitive root pseudoprime quadratic equation quadratic fields rational integers rational number rational prime reader real number reduced residue system relatively prime residue system mod satisfies Section Show side slope solutions mod Solve Suppose Theorem 1.2 triangles uniform step method unique factorization property unique solution unit values vectors zero