Question

1651 and 2032 use Euclid division lemma​

Answer 1

Step-by-step explanation:

Use euclid's division algorithm to find ... 2032 = 1651 × 1 + 381 . 381 = 127 × 3 + 0. Since the remainder becomes 0 here, so HCF of 1651 and 2032 is 127.

Answer 2

Answer:

it's kinda hard..use hcf