This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: m 2n 2 = 88, for which both m and n are positive integers. 6. Prove that if n is an odd positive integer then n 2 â‰¡ 1 (mod 8) . 1 7. Prove that for all integers n we have n 3 = 9 k , or n 3 = 9 k + 1 , or n 3 = 9 k1 , for some integer k . 8. Prove that if a, b, c, d , and m are integers, with m â‰¥ 2, and a â‰¡ b (mod m ) and c â‰¡ d (mod m ) , then ac â‰¡ bd (mod m ) . 9. Prove that if a, b , and m are integers, with m â‰¥ 2, and a â‰¡ b (mod m ), then gcd( a, m ) = gcd( b, m ) . 10. Prove the following by mathematical induction: For all integers n â‰¥ 1, 1 + 6 + 11 + 16 + . . . + (5 n4) = n (5 n3) 2 . 11. Prove by induction: For all integers n â‰¥ 1, 5  (7 n2 n ) . 12. Prove by induction: For all integers n â‰¥ 2, n ! > 2 n2 . 2...
View
Full Document
 Spring '11
 TBA
 Computer Science, Software engineering, Remainder, Integers, Natural number

Click to edit the document details