Test Flight Problem Set Q3

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:

Any integer is either even or odd.

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

If we assume k 2k 2 3k 1, then well have:

n2 n 1 2k 1

Thats in the form of an odd number.

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

If we assume k 2k k , then well have:

2

n2 n 1 2k 1

Thats in the form of an odd number.

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