This preview shows page 1. Sign up to view the full content.
Unformatted text preview: A3. (a) Let q be an integer. Prove that if 3 divides q 2 , then 3 divides q . (Do not use unique factorization of integers into prime powers.) Hint: If 3 does not divide q , then q = 3 k + r , with r = 1 or r = 2. (b) Prove that there is no rational number r for which r 2 = 3. 1...
View
Full
Document
This note was uploaded on 09/30/2011 for the course MATH 140a taught by Professor Staff during the Fall '08 term at UCSD.
 Fall '08
 staff
 Sets

Click to edit the document details