Question

Use Euclid's division algorithm to find HCF of 250 and 336​

Answer 1

Answer:

your answer is above

Step-by-step explanation:

please follow

Answer 2

Answer:

HCF ( 250 , 336 ) = 2

Step-by-step explanation:

Given :- 250 and 336 .

To find :- HCF using Euclid's division algorithm .

Solution :-

Principle used is :- Euclid’s Division Lemma is based on the Euclidean division algorithm. The Highest Common Factor (HCF) of two positive integers (a and b) is calculated using Euclid’s Division Algorithm. HCF is obtained by dividing two integers ‘a’ and ‘b’ and the remainder we get is zero.

Follow the image solution .

HCF ( 250 , 336 ) = 2

#SPJ3