1729: The Number with Two Cube Sums

Try the puzzle before reading on

Here is the challenge: find two different pairs of positive whole numbers whose cubes add to 1729. A cube is a number multiplied by itself three times, so 4³ means 4 × 4 × 4, or 64. Work with pairs in increasing order to avoid counting the same pair twice: for instance, treat (2, 5) and (5, 2) as one representation.

Start with the two pairs that fit. Since 1³ = 1 and 12³ = 1728, the first sum is 1729. For the second, 9³ = 729 and 10³ = 1000; together they also make 1729. The representations are therefore:

• 1729 = 1³ + 12³ = 1 + 1728
• 1729 = 9³ + 10³ = 729 + 1000

Those are not just two ways to group the same four terms. They are two distinct pairs of positive cubes: one combines a tiny cube with a large one, while the other combines two cubes of similar size. The contrast is part of the number’s charm.

Why 1729 has a name

The smallest positive integer that can be expressed as the sum of two positive cubes in two different ways is called the first taxicab number. It is usually written Ta(1), and its value is 1729. The label comes from a widely repeated story about the British mathematician G. H. Hardy and the Indian mathematician Srinivasa Ramanujan.

Hardy later recounted visiting Ramanujan when he was ill and mentioning that the taxi he had taken carried the number 1729. Hardy described it as an unremarkable number. Ramanujan, according to the story, immediately observed that it was especially interesting: it was the smallest number expressible as the sum of two cubes in two different ways.

The anecdote is often told as a portrait of Ramanujan’s extraordinary instinct for numbers. It also works as a compact lesson in mathematical attention. A number that looks ordinary in one setting can have a precise structure waiting to be noticed. The taxi’s number was not special because it was large, prime, or visually striking. It was special because of the relationships hiding inside it.

Hardy and Ramanujan were real mathematicians whose collaboration helped shape twentieth-century mathematics. The taxicab story is associated with their time together in England during the First World War. As with many famous anecdotes, retellings differ in their wording and details; the mathematical property, however, can be checked directly with arithmetic.

What does “smallest” actually require?

Finding two representations establishes that 1729 has the property. Calling it the smallest number with that property requires more: we must rule out every smaller positive integer. That is a finite search, because cubes grow quickly and only a limited set of pairs can have a sum below 1729.

Write a pair as a³ + b³ with a ≤ b. If b is at least 12, then even the smallest possible a, namely 1, gives 1³ + 12³ = 1729. So any sum below 1729 must have b no greater than 11. For each possible larger cube, test the smaller positive values of a. The table lists those sums that are below 1729; the entries in each row correspond to a = 1, 2, 3, and so on.

No value below 1729 appears twice in the table. At 1729 itself, the two pairs are (1, 12) and (9, 10). This gives a direct, checkable reason for the “first” in first taxicab number, rather than relying on the anecdote alone.

The table is also an example of a useful mathematical habit: turn a broad claim into a bounded search. The cube of 12 is already 1728, so there is no need to test arbitrarily large integers. Growth supplies the stopping point.

A hand method for searching sums of cubes

Suppose you want to discover a number with two cube-sum representations rather than being given one. Make a list of cubes, then add pairs. For sums up to 1729, the relevant cubes begin 1, 8, 27, 64, 125, 216, 343, 512, 729, 1000, 1331, and 1728. Each is the cube of an integer from 1 through 12.

One efficient approach is to hold the larger number b fixed and calculate a³ + b³ for a = 1 up to b. Record each sum in a second list. If a sum appears again from a different pair, you have found a repeat. For example, the row for b = 9 includes 9³ + 1³ = 730, while the row for b = 10 includes 10³ + 1³ = 1001. Continue the process and compare the results.

A more systematic version uses a map: write each sum beside its pair, such as “1729: (1, 12).” When the same sum appears again, compare the pairs. If the new pair is different, the sum has two representations. This method is simple enough for a notebook or spreadsheet and works for other powers too, though the number of calculations grows as the search range expands.

Be precise about what counts as “different.” Swapping terms does not create a new representation: 1³ + 12³ and 12³ + 1³ are the same pair. The taxicab definition counts distinct pairs of positive integers, usually with the smaller member written first. It also matters that the terms are positive; allowing zero or negative integers changes the search and the question.

Why the two pairs meet at the same total

The equality can be rearranged to show the balance between the cubes:

12³ − 10³ = 9³ − 1³ = 728

On one side, moving from 10³ to 12³ adds 728. On the other, moving from 1³ to 9³ adds exactly the same amount. This difference-of-cubes view makes the equality less like a coincidence between two unrelated sums and more like a matched change in two places.

The identity can also be read through the formula for a difference of cubes: x³ − y³ = (x − y)(x² + xy + y²). For the first difference, 12³ − 10³, the calculation is (12 − 10)(12² + 12 × 10 + 10²) = 2 × 364 = 728. For the second, 9³ − 1³ = (9 − 1)(9² + 9 × 1 + 1²) = 8 × 91 = 728. The factorizations arrive at the same result by different routes.

This does not by itself explain why 1729 is the first such number, but it reveals more structure than simply checking the two additions. A puzzle often becomes richer when a true statement is rearranged: the same arithmetic can expose a pattern that was hidden in its original form.

From one taxicab number to a family

1729 is the first member of a broader sequence of questions. How small can a number be if it has three distinct representations as a sum of two positive cubes? What about four? The search becomes harder because the numbers grow, but the principle remains the same: list sums, keep track of the pairs, and look for repeated totals.

Taxicab numbers are commonly defined as the smallest positive integers that can be written as sums of two positive cubes in a specified number of ways. Under that convention, Ta(1) = 2, which is the first number expressible as a sum of two positive cubes in one way; Ta(2) = 1729. The famous “first taxicab number” nickname refers to the first with two distinct representations, not the first possible sum of cubes overall.

There are related versions of the problem. Some allow zero or negative integers; others ask about sums of higher powers, such as fourth powers. Changing the permitted numbers changes the answers. That is why a careful mathematical definition states the rules before announcing a record: positive or nonnegative terms, two terms or more, and distinct pairs or ordered pairs all matter.

The search also connects to computational number theory. A computer can generate a large list of cube sums and sort them, but the underlying method is still the same one a learner can use by hand. The machine speeds up repeated arithmetic; it does not replace the need to define what counts as a solution or to verify a claimed equality.

Check your number sense

Before moving on, try these short checks without a calculator, then verify your work:

• Estimate the scale: Between which consecutive cubes does 1729 lie? Since 12³ = 1728 and 13³ = 2197, it sits just one above 12³.
• Compare the pairs: Which representation has the more balanced terms? The pair 9 and 10 is close together; 1 and 12 is widely separated.
• Reconstruct the second sum: Use 10³ = 1000 and 9³ = 729. Their total is 1729.
• Explain the stopping rule: Why does checking larger terms beyond 12 not produce a smaller sum? Because 1³ + 13³ is already greater than 1729, and any larger positive partner only increases the total.

These checks exercise different kinds of numeracy: recalling powers, estimating size, comparing quantities, and using a bound to limit a search. That mix is why a compact puzzle can be more than a trick question. It gives number facts a job to do.

A final challenge

Make your own small table of sums of two positive cubes, this time stopping at 10³ + 10³. Can you find a repeated total before reaching 1729? If you do, check that the pairs are genuinely distinct and that you have not simply reversed their order. If you do not, use the bounded-search idea to explain why your list is complete.

Then change one rule: allow 0 as a term. What new sums appear, and does the meaning of “smallest” change? The point is not to preserve the taxi story’s answer at all costs; it is to see how a mathematical result depends on its exact conditions.

1729 survives that scrutiny. Its two cube sums are easy to verify, and a finite search establishes that no smaller positive integer has two distinct representations of the same kind. The old taxi anecdote gives the number a memorable entrance. The arithmetic is what keeps it in view.