Find the least possible 5-digit number which, when divided by each of and , leaves a remainder of .
- A10105
- B10055
- C10085
- D10155
Solution & Step-by-step Explanation
First, find the Least Common Multiple (LCM) of the divisors and :
*
*
*
*
The smallest 5-digit number is . Let's divide it by to find the nearest perfect multiple:
The smallest 5-digit multiple of is:
To ensure a constant remainder of , add to this multiple value:
*
*
*
*
The smallest 5-digit number is . Let's divide it by to find the nearest perfect multiple:
The smallest 5-digit multiple of is:
To ensure a constant remainder of , add to this multiple value: