1729 is the smallest number that is a sum of two positive cubes in two ways, 1³ + 12³ and 9³ + 10³ — the fourth link prints the second of those pairings. The first three links are the third taxicab number, built three separate times: 167³ + 436³, 228³ + 423³ and 255³ + 414³. All three screens are identical, 8.7539319⋅10+7, and the point of laying them out that way is that no arithmetic is involved in the claim, only addition and a cube — the equality is the kind a machine can check in three lines and no one has ever had to believe on authority.
Finding 87 539 319 is not a matter of guessing pairs. Every sum of two cubes below a bound can be listed — under ninety thousand pairs for a bound this size, since the largest cube needed is 444³ — and then sorted, and the taxicab numbers are the collisions in that list. This is why the sequence is called by the name of a cab: Hardy's anecdote has Ramanujan remarking that the number was a dull one, and it is special precisely because the collision is hidden among so many unremarkable sums. The equation x³ + y³ = m is an elliptic curve in disguise, so the count of representations of m is tied to its arithmetic, and there is no formula that says how many pairings a given m will have. Under the stricter reading of the puzzle — pairs of positive integers, nothing else — no smaller number than 87 539 319 has three of them.
Answer
8.7539319⋅10+7
How to read it
Three different pairs of cubes, one screen. The fourth link is the two-way case that started the sequence.
Source
Hardy's 1940 recollection of visiting Ramanujan and being told of 1729; the third taxicab number 87 539 319 and its three decompositions are in the sequence A001235, and the search for them is the collision problem x³ + y³ = x′³ + y′³
Work it in the calculator
These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.