Question

Use ecluid algorithm to find the hcf of 1320 and 935

Answer 1

Euclid's division Lemma :-

Given positive integers a and b , there exist a unique pair of integers q and r satisfying a = bq +r

where 0 is less than or equal to r ,and r is less than b

Here given a = 1320 ; b = 935

substituting these values in the equation, we get

1320 = 935×1 + 385

935 = 385×2 + 165

385 = 165×2 + 55

165 = 55×3 + 0

So, the HCF of 1320 and 935 is "55"

• If my answer is correct and if you like it, then....
• Mark it as a brainliest answer and thank me....

Answer 2

Step-by-step explanation:

hope it will help u

55 is HCF