What is the smallest number which when divided by and gives the remainder in each case ?
Given , the numbers are and
For finding the smallest number finding LCM of the given number .
So , Prime factors of the given number are
LCM of the numbers are
LCM of the numbers are
The smallest number gives remainder in each case is
Hence, the required smallest number is .