Question

For some integer q, every odd integer is of the form..? With solution

Answer 1

Answer:

Let 'a'be the given positive integer .On dividing 'a'by 2 let q be the quotient and r be the remainder . Then by Euclid's division algorithm we have.,

a= 2q+r , where 0<r<2

a=2q +r where r=0 or r=1

a=2q or 2q+1

Step-by-step explanation:

when a= 2q+1for some integer q then clearly a is odd...

mark as brainliest