Question

using Euclid's division algorithm find the HCF of 85,51​

Answer 1

Step-by-step explanation:

Highest Common Factor of 51,85,153 using Euclid's algorithm

Step 1: Since 85 > 51, we apply the division lemma to 85 and 51, to get. ...

Step 2: Since the reminder 51 ≠ 0, we apply division lemma to 34 and 51, to get. ...

Step 3: We consider the new divisor 34 and the new remainder 17, and apply the division lemma to get.

☃️

Answer 2

$\mathfrak{\bf{\underline{\underline{Refer \: to \: the \: Attachment \: ✔}}}}$