Question

use eculids division algorithm to fund the largest number which divides 957 and 1280 leaving the remainder 5 in each case...

Answer 1

Answer:

first subtract 5 from 957 and 1280

957 – 5 = 952

1280 – 5 = 1275

Now using Euclid's Division Algorithm we will find the HCF of 952 and 1275

1275 = 952 ×1+323

952 = 323 × 2 + 306

323 = 306 × 1+ 17

306 = 17 × 18 + 0

The largest no. that divides 957 and 1280 leaving a reminder 5 is 17

Read more on Brainly.in - https://brainly.in/question/3646315#readmore

Answer 2

Step-by-step explanation:

firstly you minus the 957 - 5 = 952

when you also minus 1280 - 5 = 1275

then lcm and hcf of 952 and 1275 and multiply it

then yours answer was solved