Use Euclid's division algorithm to the HCF of 155 and 1385
Answer (1)
17th May, 2025
HELLO,
Given :
-
a=155
-
b=1385
Since 155<1385 we start with:
1385=155.q+r
Step 2: Perform the Division
1385/155=8 remainder 145
1385=155.8+145
Step 3: Next step with 155 and 145
155+145.1+10
Step 4: Next step with 145 and 10
145=10.14+5
Step 5: Next step with 10 and 5
10=5.2+0
Final Step:
Since the remainder is now 0 the divisor at this step is:
HCF=5
Comments (0)
Related Questions
What is Euclids Division Lemma?
13 Views
what is restoring division algorithm
2965 Views
Trending Articles/News
