Using Euclid’s division algorithm, find the HCF of 560, 960 and 432.
Answers
Answered by
0
Answer:
7282-3732
Step-by-step explanation:
2(27363736383636£
Answered by
2
Answer:
Step-by-step explanation:
Hi ,
******************************************
Euclid's division lemma:
Let a and b are two positive
integers . Then there exists two
unique whole numbers q and r
such that
a = bq + r ,
0 ≤ r < 0
*†**************************************
Now ,
Start with the larger integer , that
is 960 , Apply the division lemma
to 960 and 432 , to get
960 = 432 × 2 + 96
432 = 96 × 4 + 48
96 = 48 × 2 + 0
The remainder has now become
zero , so our procedure stops.
Since , the divisor at this stage is
48 ,
Therefore ,
HCF ( 960 , 432 ) = 48
I hope this helps you.
: )
Similar questions
English,
5 months ago
Math,
5 months ago
Math,
5 months ago
Political Science,
11 months ago
English,
11 months ago
Computer Science,
1 year ago