Question

using Euclid division algorithm find hcf of 616 and 693. Also check whether numbers are co prime or not .
wrong answer will be reported.​

Answer 1

➤ Answer

• H.C.F. of 616 and 693 = 77.
• No, the number are not co prime.

➤ To Do

• To find the H.C.F. of 616 and 693 using Euclid division algorithm and to check whether the numbers are co prime or not.

➤ Step By Step Explanation

Euclid's division algorithm

• Step 1.

On dividing a by b we get the quotient q and remainder r such that a = bq + r, where 0 ≤ r < b.

• Step 2.

If r = 0 then H.C.F. ( a, b ) = b.

If r ≠ 0 then apply the division lemma to b and r.

• Step 3.

Continue the process till the remainder is 0.

The last divisor will be required H.C.F.

By applying algorithm

➠ 693 = 616 × 1 + 77

➠ 616 = 77 × 8 + 0

➵ Therefore, H.C.F. of 693 and 616 = 77.

We know that if the H.C.F. of two numbers is 1 then they are co. prime but here H.C.F. is 77.

➵ Therefore, the number are not co prime.

_____________________