Question

.
Solution : Let us start with taking a, where a is a positive odd integer. We apply the
algorithm with a and b=4.
Since 0 <r<4, the possible remainders are 0, 1, 2 and 3.
That is, a can be 4q, or 4q+1, or 4q + 2, or 4q +3, where q is the quotient. H
since a is odd, a cannot be 4q or 4q+2 (since they are both divisible by 2).
Therefore, any odd integer is of the form 4q+1 or 4q+3.
1
EXERCISE - 1.1
Use Euclid's division algorithm to find the HCF of
(i) 900 and 270 (ii) 196 and 38220 (iii) 1651 and 2032
Use Euclid division lemma to show that any positive odd integer is of the form​

Answer 1

1+2+456796767688670j