Question

find hch of 4641,4095 using eucilds division algorithm​

Answer 1

we get 4641 = 4095 × 1 + 546 Since the remainder 546 ≠ 0 . So , we apply the division lemma to the divisor 4095 and remainder 546 to get 4095 = 546 × 7 + 273 Now , we apply division lemma to the new divisor 546 and new remainder 273 to get 546 = 273 × 2 + 0 The remainder at this is zero .