use euclids division algorithim find hcf of 135 and 225
Answers
Answered by
7
Answer:
★ HCF = 90 ★
Step-by-step explanation:
Given:
- Numbers are 135 and 225
To Find:
- HCF of 135 and 225 by Euclid's division algorithm
Solution:
★ a = bq + r, 0 ≤ r < b ★
Here, 225 > 135
225 = 135 x 1 + 90
135 = 90 x 1 + 45
90 = 45 x 2 + 0
Hence, HCF of 135 and 225 is 90
Answered by
74
According to Euclid's division algorithm
- a = Dividend
- b = Divisor
- q = Quotient
- r = Remainder
∴ HCF of 135, 225 = 45
━━━━━━━━━━━━━━━━━━━
By Prime factorisation method
★ 135
★ 225
135 = 3 × 3 × 3 × 5 × 1
225 = 3 × 3 × 5 × 5 × 1
HCF = 3 × 3 × 5 × 1
HCF = 45
Similar questions