A man has a certain number of small boxes to pack into parcels. If he packs , , or in a parcel, he is left with one; if he packs in a parcel, none is left over. What is the number of boxes he may have to pack?
- A106
- B301
- C309
- D400
Solution & Step-by-step Explanation
Let the total number of boxes be .
According to the question, when is divided by , , , or , it leaves a remainder of .
Thus, the number can be written in the form:
First, find the LCM of , , , and :
*
*
*
*
So, .
We are also given that is completely divisible by (remainder is when divided by ).
Let us test values of :
* For : (not divisible by )
* For : (not divisible by )
* For : (not divisible by )
* For : (not divisible by )
* For :
Let's check if is divisible by :
Since is perfectly divisible by , the number of boxes is .
According to the question, when is divided by , , , or , it leaves a remainder of .
Thus, the number can be written in the form:
First, find the LCM of , , , and :
*
*
*
*
So, .
We are also given that is completely divisible by (remainder is when divided by ).
Let us test values of :
* For : (not divisible by )
* For : (not divisible by )
* For : (not divisible by )
* For : (not divisible by )
* For :
Let's check if is divisible by :
Since is perfectly divisible by , the number of boxes is .