Find the smallest number which when divided by and , respectively, leaves a remainder, and respectively.
Step 1: Find the LCM
Given,
and are divisible by the required numbers.
Therefore, the required number will be less than the LCM of and
Prime factors of are
Prime factors of are
LCM of and is
LCM
Step 2: Find the smallest no which gives remainder
To get the smallest number, which gives remainder and when divided by and , we have to subtract from the LCM of and
The required the smallest number
Hence, the number is .