This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n . (Hint: For consecutive integers m and m + 1, what does the theorem say about the possible forms of m (and hence m + 1)?) 8. Prove that if m n ( modd ) and n p ( modd ) then m p ( modd ). 9. Prove the following statement: for all integers n,d with d 6 = 0 d | n i n = b n/d c d 10. Prove the following statement by contradiction: There is no least rational number. 11. Prove the following statement by contraposition If the average of two numbers is greater than or equal to one of the numbers. 12. Prove that 3 2 is irrational. (Hint: Problem 6 might be useful.)...
View Full Document
This note was uploaded on 10/04/2009 for the course CMPSC 360 taught by Professor Haullgren during the Fall '08 term at Pennsylvania State University, University Park.
- Fall '08