Find the least number which when divided by 24,32 and 36 leaves the remainder 19,27,31 respectively.
can it be done using Euclid's division lemma. If yes then how?
-
UP 0 DOWN 0 0 1
1 Answers
62the number is of the form 24k+19, 32m+27 or 36n+31
you could even rewrite this as 24k-5, 32m-5 and 36n-5 (obviously k, m and n wud have increased by 1 each)
thus it is a number which is less than a multiple of 32, 24 and 36 by 5
if we assume a positive such number then we will take the lcm of 24, 32 and 36 and subtract 5 from it....
32x9-5 = 283
