Question

EXERCISE - 1.1
Use Euclid's division algorithm to find the HCF of
(1 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 6q+1. or
69 + 3 or 69 + 5, where is some integers.
Use Euclid's division lemma to show that the square of any positive integer is of the form
3p, 3p + 1 or 3p+2.
Use Euclid's division lemma to show that the cube of any positive integer is of the form
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, where n is any
positive integer
THE FUNDAMENTAL THEOREM OF ARITHMETIC​

Answer 1

Step-by-step explanation:

HOPE this helps you

pls mark as brainiest answer