Show that every positive even integer is of the form 2m and that every positive odd integer is of the form 2m 1 where m is some integer
Answers
Answered by
5
let 'a' be any positive integer and b=2
By euclid's division algorithm
a=bq+r 0≤ra=2q+r 0≤r<2
(i.e) r =0,1
r=0 , a=2q+0=> a=2q
r=1, a=2q+1
if a is the form of 2m then 'a' is an even integer and positive odd integer is of the form 2m+1
thank u for giving me this oppournity i hope this helps you
By euclid's division algorithm
a=bq+r 0≤ra=2q+r 0≤r<2
(i.e) r =0,1
r=0 , a=2q+0=> a=2q
r=1, a=2q+1
if a is the form of 2m then 'a' is an even integer and positive odd integer is of the form 2m+1
thank u for giving me this oppournity i hope this helps you
Anonymous:
hi
Answered by
2
a=bq+r
a=2m+0(r can be 0 1)
a=2m as m is multiplied by2 so it is even
again a=2m+1
so a is an odd no.
a=2m+0(r can be 0 1)
a=2m as m is multiplied by2 so it is even
again a=2m+1
so a is an odd no.
Similar questions