The least number which when divided by and leaves a remainder of in each division is
- A
- B
- C
- D
Solution & Step-by-step Explanation
The general structural form for such an integer is:
Let's find the Least Common Multiple () by prime factorization:
*
*
*
*
Taking the maximum power of each prime factor involved:
Now, adding the common remainder constant ():
Let's find the Least Common Multiple () by prime factorization:
*
*
*
*
Taking the maximum power of each prime factor involved:
Now, adding the common remainder constant ():