Question

EXERCISE - 1.1
Use Euclid's division algorithm to find the HCF of
900 and 270
(1) 196 and 38220 (ii) 1651 and 2032

Use Euclid division lenma to show that any positive odd integer is of the form 69
69 + 3 or 60 + 5, where q is some integer.
Use Euclid's division lemma to show that the square of any positive integer is of the
30. 30+ 1.
Use Euclid's division lemma to show that the cube of any positive integer is ofth
9mm + 1 or 9m + 8.
Show that one and only one out of n, n + 2 or n +4 is divisible by 3, where
positive integer
Distribution by T.S. Government 2017-18​

Answer 1

Answer:

please mark my answer brainlist

Answer 2

Answer:

900/270.

rem-90.

270/90.

rem-0. thus HCF-90.