Show that any positive odd integer is of the form or or ; where is some integer.
To prove that any positive odd integer is of the form or or ; where is some integer.
Step : Use Euclid's Division lemma
According to Euclid’s Division Lemma if we have two positive integers and , then there exist unique integers and which satisfies the condition
Let be the positive odd integer which when divided by gives as quotient and as remainder.
According to Euclid's division algorithm,
…………………..
where,
Socan be either , , , , and .
Step : Check whether is even or odd for different values of
Case 1: If, then equationbecomes
The above equation is multiple of .It is an even integer.
Case 2:
If, then equationbecomes
The above equation will be always an odd integer.
Case 3:
If , then equation becomes
The above equation is multiple of . so it is an even integer.
Case 4:
If , then the equation becomes
The above equation is multiple of . It is an odd integer.
Case 5: If , the equation becomes
The above equation is multiple of . It is an even integer.
Case 6: If , then equation becomes
The above equation is not multiple of . so, it is an odd integer.
On the basis of all the above cases, It is evident that except the case , and all the cases are true for the given condition.
Thus, any positive odd integer is of the form , and