Ask a Teacher

Search



Find the largest no: wich divides 245 & 1029 leaving the reminder 5 in each case.
 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
                         240 = 64 x 3 + 48
                           64 = 48 x 1 + 16
                           48 = 16 x 3 + 0

 Since remainder comes zero with last divisor 16,
 required number = 16


comments powered by Disqus