Question

HCF of 765 & 65 by Euclid's division algorithm​

Answer 1

Answer:

HCF of 765, 65 using Euclid's algorithm

Highest common factor (HCF) of 765, 65 is 5.

Answer 2

$huge\sp\text{Answer}$

Here 765 is greater than 65

Now, consider the largest number as 'a' from the given number ie., 765 and 65 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 765 > 65, we apply the division lemma to 765 and 65, to get

765 = 65 x 11 + 50

Step 2: Since the reminder 65 ≠ 0, we apply division lemma to 50 and 65, to get

65 = 50 x 1 + 15

Step 3: We consider the new divisor 50 and the new remainder 15, and apply the division lemma to get

50 = 15 x 3 + 5

Highest common factor (HCF) of 765, 65 is 5.

HCF(765, 65) = 5

Therefore, HCF of 765,65 using Euclid's division lemma is 5.