Find the HCF of 15 , 35 by Euclid's division algorithm .
Answers
Answered by
6
Step-by-step explanation:
Step 1 :- let ,
- a = 35
- b = 15
By Euclid's division algorithm
- a = bq + r
- 35 = ( 15 × 2 ) + 5
Step 2 :- let ,
- a = 15
- b = 5
By Euclid's division algorithm
- a = bq + r
- 15 = ( 5 × 3 ) + 0
Remainder (r) = 0
then,
:. HCF = 5
Attachments:
![](https://hi-static.z-dn.net/files/db1/f28b585600fc212ded272c7ba1311846.jpg)
Answered by
9
Step-by-step explanation:
Step 1 :-
a = 35 and = 15
By Euclid's division algorithm
- a = bq + r
35 = ( 15 × 2 ) + 5
Step 2 :- let ,
a = 15 and b = 5
By Euclid's division algorithm
15 = ( 5 × 3 ) + 0
If Remainder (r) = 0 then HCF is the Quotient.
:. HCF = 5
Attachments:
![](https://hi-static.z-dn.net/files/d4d/1954ca843c07addfb7964a941a6b5f7b.jpg)
![](https://hi-static.z-dn.net/files/d37/5a636cd39d8d57cbea8190f48d42ca0f.jpg)
Similar questions