Question

using euclid's division algorithm find the hcf of 612 and 1314​

Answer 1

Answer:

We know that according to Euclid division lemma, where.

Step:

Step:

Step:

Step:

Now remainder is zero and therefore step is the final step and so H.C.F of & is

Hence, H.C.F of and is .