Question 1 Use Euclid's division algorithm to find the HCF of 1)135 and 225 Since 225>135 we apply the division lemma to 225 and 135 to obtain 225= 135×1+90 Since r is not equal to 0 135=90×1+45 Since...
Hello friendsJust read all those stuff and try to remind it and if you have doubts in any of them then go through the book It's beneficial: 1)real number: for finding HCF and LCM by prime factorisation.Euclid...