Question

Find the HCF of 15 , 35 by Euclid's division algorithm .​

Answer 1

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

Answer 2

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