use euclid's division algorithm to find the HCF of 968 and 436
Answers
Answered by
83
- Numbers 968 and 436
- HCF of the given numbers using Euclid's division algorithm.
We know that,
- Euclid's division algorithm =
a = bq + r where 0 ≤ r < b
Now,
- 968 = 436 * 2 + 96
- 436 = 96 * 4 + 52
- 96 = 52 * 1 + 44
- 52 = 44 * 1 + 8
- 44 = 8 * 5 + 4
- 8 = 4 * 2 + 0
Therefore,
- HCF of 968 and 436 = 4.
- Euclid's division algorithm or Division algorithm both mean the same.
a = bq + r where 0 ≤ r < b
- where,
- a is the number greater given among the 2 numbers.
- b is the number smaller given among the 2 numbers.
- q is the quotient
- r is the remainder
Answered by
18
Here is your answer,
H.C.F of 960 and 432
960 > 432 Here we need to use euclid division Lemma.
→ 960 = 432 × 2 + 96
→ 432 = 96 × 4 + 48
→ 96 = 48 × 2 + 0
H.C.F = 48
Hope it helps you !
Similar questions