JMC 2014 Q20
20. Box P has \(p\) chocolates and box Q has \(q\) chocolates, where \(p\) and \(q\) are both odd and \(p > q\). What is the smallest number of chocolates which would have to be moved from box P to box Q so that box Q has more chocolates than box P?
- A \(\dfrac{q - p + 2}{2}\)
- B \(\dfrac{p - q + 2}{2}\)
- C \(\dfrac{q + p - 2}{2}\)
- D \(\dfrac{p - q - 2}{2}\)
- E \(\dfrac{q + p + 2}{2}\)
Junior Mathematical Challenge 2014, Question 20. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: B \(\dfrac{p - q + 2}{2}\)
Let the smallest number of chocolates required be \(n\). Then \(q + n > p - n\), that is \(2n > p - q\). Therefore \(n > \tfrac{1}{2}(p - q)\). Since \(p > q\) and \(p\) and \(q\) are both odd, \(\tfrac{1}{2}(p - q)\) is a positive integer. So the smallest possible value of \(n\) is \(\tfrac{1}{2}(p - q) + 1 = \tfrac{1}{2}(p - q + 2)\).
Solution © UK Mathematics Trust, from the JMC 2014 solutions. Longer versions with investigations: Solutions and investigations (PDF).