Example 19 - Mathematical Reasoning
Last updated at April 16, 2024 by Teachoo
Examples
Example 1 (ii) Important
Example 1 (iii)
Example 1 (iv) Important
Example 1 (v)
Example 1 (vi)
Example 2 (i) Important
Example 2 (ii)
Example 3 (i)
Example 3 (ii) Important
Example 3 (iii)
Example 3 (iv)
Example 4 (i)
Example 4 (ii)
Example 4 (iii) Important
Example 4 (iv) Important
Example 5 (i)
Example 5 (ii) Important
Example 5 (iii)
Example 5 (iv) Important
Example 5 (v)
Example 5 (vi) Important
Example 6 (i)
Example 6 (ii) Important
Example 6 (iii)
Example 7 (i)
Example 7 (ii) Important
Example 7 (iii)
Example 7 (iv) Important
Example 8 (i)
Example 8 (ii) Important
Example 8 (iii)
Example 9
Example 10 Important
Example 11 (i)
Example 11 (ii) Important
Example 12 (i)
Example 12 (ii)
Example 13 Important
Example 14 Important
Example 15 Important
Example 16
Example 17
Example 18 (i)
Example 18 (ii) Important
Example 18 (iii)
Example 18 (iv)
Example 19 Important You are here
Example 20 Important
Last updated at April 16, 2024 by Teachoo
Example 19 Using the words necessary and sufficient rewrite the statement The integer n is odd if and only if n2 is odd . Also check whether the statement is true. The necessary and sufficient condition that the integer n be odd is n2 must be odd. Let p and q denote the statements p : the integer n is odd. q : n2 is odd. Now checking whether statement be true Care l :- Direct method If p then q i.e. p q It integer n is odd. Then prove that n2 is odd let n = 2k + 1 k Z squaring both side. n2 = (2k + 1 ) n2 = (2k)2 + (1)2 + 2k + 1 = 4k2 + 1 + 4k = 4k2 + 4k + 1 = 4 ( k2 + 1 ) + 1 n2 is odd Hence p = q Case 2 :- Contraption If n2 is odd to prove n is odd we check this by Contrapositive method let n is not odd prove that n2 is not odd i.e. prove that n2 is even i.e. prove that n2 is even Now let n is not odd i.e. n is even i.e. n = 2k Squaring both side n2 = (2k)2 n2 = 4k2 This show n2 is even Hence n2 is not odd