Find the least number which when divided by and leave remainder in each case.
Solve for the required number
Given numbers are: and .
Prime factorisation of given numbers is
The number that is more than their will leave a remainder of when divided by the given numbers. Thus, the required number is,
.
Therefore, when the number when divided by and , will leave a remainder of .