Let p and a be positive integers and suppose that p|a2.
a) Show that p|(ra + sp)2 for all integers r; s.
b) Use part a), the definition of prime integer, and Theorem 15.1.1 to
construct a proof by induction that p|a. [Hint: If a (< or =) p consider
p = qa + r, where 0 (< or =) r < a. If p < a consider a = qp + r, where
0 (< or =) r < p.]
The division theorem
Let a and b be integers with b> 0. Then there are unique integers q and r such that a= bq+r and 0(< or =) r < b.
The Division Theorem is investigated. The solution is detailed and well presented.