Maths Olympiad Prep

Library / /84 of 84

, 1998

Number theory Difficulty 6.0 National Olympiad Prove it United States

Problem:

G.H. Hardy once went to visit Srinivasa Ramanujan in the hospital, and he started the conversation with: "I came here in taxi-cab number 1729. That number seems dull to me, which I hope isn't a bad omen." "Nonsense," said Ramanujan. "The number isn't dull at all. It's quite interesting. It's the smallest number that can be expressed as the sum of two cubes in two different ways." Ramanujan had immediately seen that 1729=123+13=103+931729=12^{3}+1^{3}=10^{3}+9^{3}. What is the smallest positive integer representable as the sum of the cubes of three positive integers in two different ways?

Solution

Solution:

Let this smallest positive integer be represented as a3+b3+c3=d3+e3+f3a^{3}+b^{3}+c^{3}=d^{3}+e^{3}+f^{3}. By inspection, a solution is not possible with the first 4 cubes. We prove that it is impossible to write the same number as two different sums of the first 5 cubes. Because we necessarily need to use the 5th cube (otherwise, this proof would be for the first 4 cubes), we have 53+b3+c3=d3+e3+f35^{3}+b^{3}+c^{3}=d^{3}+e^{3}+f^{3}. Without loss of generality, suppose d=5d=5. By inspection, there is no solution to b3+c3=e3+f3b^{3}+c^{3}=e^{3}+f^{3}, such that b,c,e,f5b, c, e, f \leq 5 and b,cb, c and e,fe, f are unique.
Then none of d,e,fd, e, f are 55. Then at least two must be 44, otherwise the RHS would be too small. Without loss of generality, suppose d=e=4d=e=4. Then b3+c3=3+f3b^{3}+c^{3}=3+f^{3}. By inspection, there are no possible solutions if b,c,f4b, c, f \leq 4.
Thus if a=5a=5, there are no solutions.
Suppose that there is a solution within the first 6 cubes. Then a=6a=6. By the same analysis as above, d=e=5d=e=5, otherwise the RHS would be too small. Then b3+c3=34+f3b^{3}+c^{3}=34+f^{3}. By inspection, we see that a possible solution is b=3,c=2,f=1b=3, c=2, f=1. Then the desired integer is 63+33+23=2516^{3}+3^{3}+2^{3}=251.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.