Question

find the h. c. f. of 35 and 60 by using Euclid's algorithm​

Answer 1

Step-by-step explanation:

HCF of 35, 60 is 5 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.

Consider we have numbers 35, 60 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b

Highest common factor (HCF) of 35, 60 is 5.

HCF(35, 60) = 5

Answer 2

Answer:

hcf is 5

please mark me brainliest...