Professional Documents
Culture Documents
Test Flight Problem Set Q3 PDF
Test Flight Problem Set Q3 PDF
3. Say whether the following is true or false and support your answer by a
proof: For any integer n, the number n2 n 1 is odd.
Answer:
Let its odd. We can show any odd number in the form of 2k 1 that k is integer . So
n 2 n 1 (2k 1)2 2k 1 1 4k 2 4k 1 2k 1 1
4k 2 6k 2 1 2(2k 2 3k 1) 1
n2 n 1 2k 1
Now, let its even. We can show any even number in the form of 2k . So
n 2 n 1 (2k ) 2 2k 1 4k 2 2k 1
4k 2 2k 1 2(2k 2 k ) 1
n2 n 1 2k 1
Hence either the integer is even or odd, we can show n n 1 in the form of an odd
2
number ( 2k 1 ). Done