Consider the given integer 2q,2q+1
By Euclid's lemma,
a=bq+r,0≤r<b,a,b,q are integers.
Let b=2
Applying Euclid’s algorithm, we have:
a=2q+r, for some integer q≥ 0 and 0≤r<2 .
a=2q or 2q+1
If a=2q then a is an even integer.
Now, a positive integer can either be even or odd.
Thus, any positive odd integer.
Is of the form 2q+1.