Question

EXERCISE
1.1
Use Euclid's division algorithm to find the HCF of
(i) 900 and 270
(ii) 196 and 38220 (m) 1651 and 2032
Use Euclid division lemma to show that any positive odd integer is of the form 6
69 +3 or 6q+5, where q is some integer.
Use Euclid's division lemma to show that the square of any positive integer is of
3p, 3p + 1.
Use Euclid's division lemma to show that the cube ofany positive integer is of
9 m, 9m + 1 or 9m +8.
Show that one and only one out of n, n+2 or n + 4 is divisible by 3, wher
positive integer.
istribution by T.S. Government 2017-18​

Answer 1

Answer:

very simple and easy