Find the smallest number which when divided by , , , and leaves the remainder in each case.
- A
- B
- C
- D
Solution & Step-by-step Explanation
To find the smallest number which leaves a remainder of when divided by , , , , and , we first need to find the Least Common Multiple () of these numbers and then add the remainder to it.
**Step 1: Find the of **
* Prime factorization of the numbers:
* Taking the highest power of each prime factor involved:
Step 2: Add the required remainder
* Required Number
* Required Number
Therefore, the smallest number is .
**Step 1: Find the of **
* Prime factorization of the numbers:
* Taking the highest power of each prime factor involved:
Step 2: Add the required remainder
* Required Number
* Required Number
Therefore, the smallest number is .