Find the smallest number which when divided by and , respectively, leaves a remainder , in each case
Step 1: Find the LCM
Given numbers are and
Prime factors of are
Prime factors of are
LCM of and is
LCM
Step 2: Find the smallest number which gives remainder.
To get the smallest number, when divided by and , gives a remainder , we have to add to LCM of and .
Hence, the number is .