The Only Other Pair

I · Roll both, and watch

Two pairs of dice sit below. The first is ordinary: each cube reads 1,2,3,4,5,6. The second is the strange pair — one cube reads 1,2,2,3,3,4, the other 1,3,4,5,6,8. Roll both, again and again, and tally how often each sum from 2 to 12 comes up. The two histograms grow toward the same shape — the familiar triangle that peaks at seven — and the dashed outline is the exact distribution they are both chasing. By eye you cannot tell which pair made which pile.

II · Why — a die is a polynomial

Here is the trick that makes the whole thing transparent. Write a die not as a list of faces but as a polynomial: a face showing k contributes a term x^k. An ordinary die becomes x + x² + x³ + x⁴ + x⁵ + x⁶. Now the magic: when you roll two dice and add, the number of ways to make each sum is exactly the coefficients you get by multiplying the two polynomials. Rolling-and-adding is multiplication. So "two pairs roll the same sums" means, precisely, "two polynomials are equal."

Every polynomial factors uniquely into irreducible pieces, the way every integer factors into primes. The ordinary die factors like this:

A pair of dice is that expression squared — every piece appears twice. To re-number the dice while keeping the same product, you only get to choose how to deal those pieces between the two cubes. Most of the deal is forced: each die must take exactly one x (otherwise a face would read 0), and exactly one (1+x) and one (1+x+x²) — because those are the only pieces bigger than 1 when x=1, and their product has to equal the six faces. The one free choice is the two copies of (1−x+x²). Hand one to each die and you rebuild the ordinary pair. Pile both onto one die and the other pair appears — Sicherman's. Move that single piece below and watch the faces change while the product, the triangle, never flinches.

III · The only other pair — checked exhaustively

The factor argument already proves it: two ways to deal the free piece, so two pairs and no more. But you don't have to trust the algebra. The button below ignores all of it and simply tries every possibility — every way to write six positive whole numbers on a die (faces 1 through 11; nothing larger can fit, since the biggest sum is 12 and the partner shows at least 1), pairs it with the die forced by exact polynomial division, and keeps the pairs whose sums match ordinary dice. It runs thousands of candidates in your browser and comes back with exactly two: the ordinary pair, and Sicherman's.

IV · The honest edges

Uniqueness depends on the fine print, and the fine print is real. Drop "positive integers" and the result collapses: subtract 1 from every face of one die and add 1 to every face of the other and the sums are untouched — so {0,1,2,3,4,5} with {2,3,4,5,6,7} roll exactly like ordinary dice, and you can slide that trick forever. The condition that every face is a positive whole number is what makes the answer a clean two rather than infinitely many.

And the trick is not special to six-sided dice. Run the same factor reasoning on an n-sided die and whether a Sicherman partner exists comes down to whether 1 + x + ⋯ + xⁿ⁻¹ can be split. When n is prime that polynomial is itself irreducible — there is nothing to redistribute, so a prime-sided die has no nonstandard partner at all. When n is composite there is always at least one, and sometimes several. The table is computed live; pick a die size and see.

The deep reason Sicherman dice feel like a magic trick is that we read dice by their faces, but for a game determined solely by the sum, the odds and long-run fairness live in the product polynomial, and a product can be factored more than one way into legitimate dice. The faces are a costume; the distribution is the body underneath. There is exactly one other costume that fits, and it has been hiding in plain sight on a cube the whole time.