Show that every even integer is of form 2q and every odd integer os of form 2q +1 where q is some integer
Answers
Answered by
3
Answer:
Step-by-step explanation:
euclid division lemma
a = bq + r
when any number divided by 2 it will give remainder
2q+0 , 2q+1
2q divides all even integer because it is the first even number
similarly 2q +1 divides all odd integer
Similar questions