The smallest number which when divided by , , or leaves a remainder of in each case, is:
- A454
- B564
- C544
- D464
Solution & Step-by-step Explanation
The required smallest number is of the form .
First, let's find the Prime Factorization of each number:
Now, find the LCM by taking the highest power of each prime factor involved:
Adding the required remainder of :
First, let's find the Prime Factorization of each number:
Now, find the LCM by taking the highest power of each prime factor involved:
Adding the required remainder of :