For some integer m, show that every even integer is of the form 2m
Answers
Answered by
1
let a be any +ve integer and b=2
by euclid division algorithm ,a=bq+r 0<_r<b
a=2q+r 0<_r <2
i.e r =0,1
so r=0,a=2q+0 = a=2q i.e in d form a=2m
& if u want to proof dt every +ve odd integer is of form 2m+1, we will put ,r=1,a=2q+1
hope u will like my efforts
by euclid division algorithm ,a=bq+r 0<_r<b
a=2q+r 0<_r <2
i.e r =0,1
so r=0,a=2q+0 = a=2q i.e in d form a=2m
& if u want to proof dt every +ve odd integer is of form 2m+1, we will put ,r=1,a=2q+1
hope u will like my efforts
Answered by
0
Yes. all even positive integers are of the form 2m. where m = integer.
all odd integers are of the form 2m+1
Similar questions
Computer Science,
7 months ago
English,
7 months ago
English,
1 year ago
Math,
1 year ago
Math,
1 year ago