Question

use Euclid division algorithm to find Hcf of the following. 609,957​

Answer 1

Answer: HCF of 609 and 957 by Long Division

Step 1: Divide 957 (larger number) by 609 (smaller number).

Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (609) by the remainder (348).

Step 3: Repeat this process until the remainder = 0.

Step-by-step explanation:

Answer 2

Answer:

54546+64646-948786*978-848-876-949*978-8488-489*848-548-848-848 =

Step-by-step explanation:

after solving this que you will get to know