What would be the smallest natural number which when divided either by or by or by leaves a remainder of in each case?
View worked solution
Answer: C
Let the required smallest natural number be .
According to the problem, when is divided by , , or , it leaves a remainder of in each case. This can be expressed as:
For the smallest such natural number, we set :
To find the , we find their prime factorizations:
Taking the highest power of each prime factor:
Therefore, the required number is:
Hence, the correct option is C.
Free practice · Your answers on this page are not saved.
