Question

for any integer m every positive form is?​

Answer 1

We know that, even integers are 2,4,6… So, it can be written in the form of 2m. Where m=integer=Z [since, integer is represented by Z] <br> or m=…,1,0,1,2,3…

2m=…,2,0,2,4,6 Altenated Method <br> Let 'a' be a positive integer. On dividing 'a' by 2, let m be the quotient and r be the remaintder. Then, by Euclid's division algorithm, we have a=2m+r, where

i.e. r=0 and r=1 <br>

a=2m or a=2m+1 <br> When, a=2m for some integer m, then clearly a is given