Question

Use eucilds division algorithm to find the largest number which divides 957 and 1280 leaving remainder 5 in each case
Please answer fast and step by step

Answer 1

=> 957-5 = 952.

=> 1280 - 5 = 1275

The longest no . of HCF of 952 and 1280

=> 952 = 2*2*2*7*17

=> 1275 = 3*5*5*17

HCF = 17

Largest no is 17 .