Use Euclid division algorithm to find HCF of 135 and 225
Share
Use Euclid division algorithm to find HCF of 135 and 225
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Step-by-step explanation:
Since 225 > 135, we apply the division lemma to 225 and 135 to obtain 225 = 135 × 1 + 90 Since remainder 90 ≠ 0, we apply the division lemma to 135 and 90 to obtain 135 = 90 × 1 + 45 We consider the new divisor 90 and new remainder 45, and apply the division lemma to obtain 90 = 2 × 45 + 0 Since the remainder is zero, the process stops. Since the divisor at this stage is 45, Therefore, the HCF of 135 and 225 is 45
Verified answer
Answer:
45
Step-by-step explanation:
Since, 225>135
Therefore, 225=135×1+90
135=90×1+45
90=45×2+0
So therefore by Euclid's division algorithm , HCF is 45
HOPE IT HELPS!
PLEASE MARK ME BRAINLIEST!