JMO 2019 B1
B1. In this word-sum, each letter stands for one of the digits 0–9, and stands
for the same digit each time it appears. Different letters stand for different
digits. No number starts with 0.
Find all the possible solutions of the word-sum shown here.
| \(J\) | \(M\) | \(O\) | |
| \(J\) | \(M\) | \(O\) | |
| + | \(J\) | \(M\) | \(O\) |
| \(I\) | \(M\) | \(O\) |
Junior Mathematical Olympiad 2019, Question B1. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: ‘\(JMO\)’ = 150 with ‘\(IMO\)’ = 450 and ‘\(JMO\)’ = 250 with ‘\(IMO\)’ = 750
To find \(O\), we add three \(O\)s to find a number that has an \(O\) in the units place. Hence we require \(3O = O\) or \(3O = O + 10\) or \(3O = O + 20\). Therefore, \(2O = 0\) or \(2O = 10\) or \(2O = 20\) respectively. The only digits which satisfy any of these conditions are 0 and 5.
If \(O = 0\), there are no tens to “carry” to the middle column and so we are seeking a digit for \(M\), for which three \(M\)s have an \(M\) in the units place. Therefore, using a similar argument as the one for \(O\), \(M\) is 0 or 5. However, \(O = 0\) and so \(M = 5\) (as different letters stand for different digits).
If \(O = 5\), the total of three \(O\)s is 15 and so we have a ‘1’ to carry to the middle column. Hence, we require \(3M + 1 = M\) or \(3M + 1 = M + 10\) or \(3M + 1 = M + 20\), which implies \(2M + 1 = 0\), \(2M + 1 = 10\) or \(2M + 1 = 20\) respectively. However, there are no digit values of \(M\) which satisfy these conditions.
Hence, \(O = 0\) and \(M = 5\). If \(J = 1\), \(I = 4\). If \(J = 2\), \(I = 7\). If \(J > 2\), 3 × ‘\(JMO\)’ does not give a 3-digit number and so there are only 2 possible values for \(J\).
The only solutions are ‘\(JMO\)’ = 150 with ‘\(IMO\)’ = 450 and ‘\(JMO\)’ = 250 with ‘\(IMO\)’ = 750.
Solution © UK Mathematics Trust, from the JMO 2019 solutions.