Teacher Name: Dr. Shehraz Akhtar Class: BS(Math) Semester: 1st
Course Title: Elements of set theory & Mathematical logic Course code: Math-1103
1. Use the method of direct proof to prove that:
(a) The product of two odd integers is an odd integer. (b) The sum of two even integers is an even integer. (c) If n is an odd integer, then 5n2 11 is an even integer. (d) If n is an even integer, then 3n2 4n 5 is an odd integer. (e) If n is an even integer, then 5n 3 is an even integer. (f) If n and 7n 3 is odd, then n is even. 2. Find the mistake in the “proof” of the following result, and provide a correct proof. Result. If m is an even integer and n is an odd integer, then 2m + 3n is an odd integer. Proof. Since m is an even integer and n is an odd integer, m = 2k and n = 2k + 1 for some integer k. Therefore, 2m + 3n = 2(2k) + 3(2k + 1) = 10k + 3 = 2(5k + 1) + 1 = 2l + 1; where l = 5k + 1. Since k , l . Hence, 2m + 3n = 2l + 1 for some integer l, whence 2m + 3n is an odd integer. 3. Find the mistake in the “proof ” of the following result, and provide a correct proof. Result. For all integers n 1, n 2 2n 1 is composite. Proof. Let n = 4. Then, n 2 2n 1 42 2 4 1 25 and 25 is composite. 4. Let n . Prove that if 5n + 3 is odd, then n is even. 5. Let x . Prove that if 11x- 3 is even, then x is odd. 6. Let n . Prove that if 5n + 3 is odd, then 7n + 4 is even. 7. Let n . Prove that if 7n + 4 is even, then 3n -5 is odd. 8. Prove that the product of two consecutive integers is an even integer. 9. Prove that the square of any integer has the form 3k or 3k + 1 for some integer k. 10. Prove that the square of any integer has the form 4k or 4k + 1 for some integer k. 11. Prove that every prime number greater than 3 has the form 6k +1 or 6k +5 for some integer k. 12. Prove that the product of an irrational number and a nonzero rational number is irrational. 13. Prove that 2 3 is irrational. 14. Find a counterexample to the statement that for every rational number r and every irrational number s, we have that r/s is irrational. n(n 1) 2
15. Prove that for all integers n 1, 1 2 n
3 3 3 . 2 . n(n 1)(n 2) 16. Prove that for all integers n 1, 1 2 2 3 n n 1 . 3 1 1 1 n 17. Prove that for all integers n 1, . 12 23 n n 1 n 1 . 18. Prove that for all integers n 0 , 5n + 3 is divisible by 4. 19. Prove that for all integers n 0 , 43n 1 is divisible by 9. 20. Prove that for all integers n 0 , n3 7n 3 is divisible by 3. 21. Prove that for all integers n 5 , 2n n 2 . 22. Prove that for all integers n 2 , n 3 2n 1 .