Find the least number which when divided by and leaves remainder in each case
Find the of the given numbers
Prime factorisation of given numbers is and .
.
So, the number more than the of the given numbers will leave a remainder of
So, the required number is .
Therefore, when is divided by and , remainder is in each case.