Euclid's Division Lemma

State Euclid Division lemma

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m ,\ 9m+1 or, 9m+8 for some integer m .

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m ,\ 9m+1 or, 9m+8 for some integer m .

State Euclid Division lemma.

Use Euclid's division algorithm , to find the H.C.F. of the following : (i) 70 and 40 " " (ii) 18 and 45

Use Euclid's division algorithm to find the HCF of (i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255

Using Euclid's division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3, respectively.

Use Euclid’s division algorithm to find the HCF of 4052 and 12576.

Use Euclid’s division algorithm to find the HCF of 210 and 55 .

Use Euclid division algorithm to find the HCF of 441, 567 and 693.