Disclaimer: these are my personal solutions; they have not been reviewed, so be careful relying on them as there might be errors. Some competitions may have official solutions from the contest publishers which you may wish to refer to instead if you’re looking for verified solutions.
Problem 2
A box contains marbles, each of which is red, white or blue. The number of blue marbles is a least half the number of white marbles and at most one-third the number of red marbles. The number which are white or blue is at least . Find the minimum possible number of red marbles.
Hints
Hint #1
Consider all the given constraints; how can you put them to use together?
Solution
Open to see the solution; try solving it first or see the hints above!
Let represent the number of red marbles, represent the number of white marbles, and represent the number of blue marbles.
From the problem statement, we know that:
The number of blue marbles is a least half the number of white marbles and at most one-third the number of red marbles.
thus:
We also know that:
The number which are white or blue is at least .
so we also have:
Our goal is to find such that .
We also have that:
The smallest integer to satisfy is . We need the smallest because is constrained by ; since , we can take as the minimal value of . Let’s see if we can come up with an assignment of to satisfy the remaining conditions of the problem.
Since and ; taking , we know that ; thus, satisfy the remaining constraints.
Thus, the minimal value of is
Verification
What if we consider whether is a feasible solution to this problem?
In that case, , so . Given that , we need to consider taking the largest since we also need to ensure that .
If , then we need to satisfy ; however, even the minimal cannot satisfy since .
As above, the issue comes down to ensuring that , which means cannot be a solution to the problem, and we arrive back to and hence, .