You are on page 1of 2

1. The product of any two odd integers is odd.

Proof:

Suppose a and b are any odd integers. (we must show that (a x b) is odd)

By the definition of odd numbers, we have a=2x + 1(for some integer x) and b=2y+1(for some
integer y). then, by substitution, we have

a x b= (2x+1)(2y+1)

=4xy+2x+2y+1

=2(2xy+x+y)+1

Now, (2xy+x+y) is an integer because the products and sums of integers are integers and 2, x
and y are all integers.

Therefore, by definition off odd number, (a x b) is odd.

2. If n2 is odd, then n is odd.

Proof:

Suppose not. (we take the negation of the given statement and suppose it to be true).

Assume, to the contrary that Ǝ an integer n such that n2 is odd and n is even. (we must deduce
the contradiction). By definition of even, we have

n= 2k for some integer k.

so, by substitution we have

n x n=(2k) x (2k)=2(2 x k x k)

Now, (2 x k x k) is an integer because products of integers are integer; and 2 and k are integers. Hence,

n x n =2. (some integer) or n2=2 (some integer)

and so with the definition of n2 even, is even.

So the conclusion is since n is even, n2, which is the product of n with itself, is also even. This contradicts
the supposition that n2 is odd. (Hence, the supposition is false and the proposition is true)

3. Proof by mathematical induction

n( n  1)
1  2  3  ...  n 
2
Step 1: let P(n) : the given statement)

n(n+1)
Let P(n):1+2+3+…………n=
2
Step 2: Prove for n=1

For n=1

L.H.S=1

R.H.S=1

n(n+1) 1(1+ 1) 1 x 2
R.H.S= = = =1
2 2 2
L.H.S=R.H.S

Therefore, P(n) is true for n=1

Step 3: assume P(k) to be true and then prove P(k+1) is true

k (k+ 1)
Let P(k): 1+2+3+………..+k= be true
2
We will prove P(k+1) is true
¿
1+2+3+………..+k=( k +1 )( k +1 ) +1 ¿ 2 (1)

( k +1 ) ( k +2 )
1+2+3+………..+k= (2)
2
We will prove 2 to 1

From 1:
¿
1+2+3+………..+k=( k +1 )( k +1 ) +1 ¿ 2

Adding k+1 to both sides


¿
1+2+3+………..+k+(k+1)=k ( k + 1 )+1 ¿ 2 + (k+1)

k ( k +1 ) +2(k+ 1)
1+2+3+………..+k+(k+1)=
2
( k +1 ) +( k +2)
1+2+3+………..+k+(k+1)=
2
Which is same as P(k+1)

Therefore, P(k+1) is true when P(k) is true

You might also like