Question

the largest number which when divided by 1029 and 245 leaves the remainder 5 in each case is

Answer 1

When 245 and 1029 are divided by the required number then there is left 5 as remainder. It means that 245 - 5 = 240 and 1029 - 5 = 1024 will be completely divisible by the required number. Now we determine the HCF of 240 and 1024 by Euclid's Algorithm. 1024 = 240 x 4 + 64.