"Eleven Plus Two" and "Twelve Plus One" Are Exact Anagrams — And Both Equal 13

Spell out the numbers eleven, two, twelve, and one as words instead of digits, and something strange happens: "ELEVEN PLUS TWO" and "TWELVE PLUS ONE" are made of exactly the same thirteen letters, just rearranged. And both phrases, read as arithmetic, equal 13. It's one of the best-known examples in recreational math, and it's a good way to understand what an anagram actually is once you move past single words.

The letter math, laid bare

Strip the spaces and line up the letters alphabetically — which is exactly how you'd check an anagram by hand, and exactly what an anagram checker does internally:

  • ELEVENPLUSTWO → E, E, E, L, L, N, O, P, S, T, U, V, W
  • TWELVEPLUSONE → E, E, E, L, L, N, O, P, S, T, U, V, W

Thirteen letters each, same multiset, same order once sorted. That's the entire definition of an anagram: two strings are anagrams of each other if sorting their letters produces an identical result. No meaning, grammar, or pronunciation involved — it's pure letter accounting.

This is also why anagram puzzles are harder to solve by eye than they look. Your brain tries to read words, not count letters, so it misses repeated letters and silently "corrects" near-misses. A checker doesn't have that bias — it just counts.

Anagrams only work at the letter level, not the phrase level

The eleven/twelve example works because arithmetic happens to cooperate, but most interesting anagrams are just wordplay with no numerical trick attached. Two classics that have been passed around for over a century:

  • "DORMITORY" and "DIRTY ROOM" — both reduce to D, I, M, O, O, R, R, T, Y.
  • "A DECIMAL POINT" and "I'M A DOT IN PLACE" — both reduce to the same fourteen letters.

What makes these satisfying isn't just that the letters match — it's that the second phrase comments on the first. A dormitory is often a dirty room; a decimal point is a dot in place. Constructing one by hand usually starts from a target phrase, sorts its letters, and then hunts for a second phrase that uses the exact same multiset — which is tedious enough by hand that most serious anagram writers check their work letter-by-letter before committing to a final phrase.

Why punctuation, spaces, and case have to be ignored

If you tried to anagram-check "A decimal point" against "I'm a dot in place" using a tool that treated the apostrophe, the capital "A," and every space as significant characters, they would fail — not because the wordplay is wrong, but because the comparison is too strict. A proper anagram checker normalizes both inputs first: lowercase everything, strip spaces and punctuation, then compare what's left. Get that normalization wrong and you'll get false negatives on legitimate phrase anagrams, or false positives if you strip too aggressively and start ignoring letters that matter.

This is also where "near-anagrams" trip people up. "STATE" and "TASTE" look like they should match — same five letters, surely — but TASTE has no second letter in common with STATE if you check carelessly. Sort them out: STATE → A, E, S, T, T. TASTE → A, E, S, T, T. They do match. The eye just isn't a reliable anagram detector; it's easy to convince yourself two words match when they don't, or dismiss a real match because the letters are in an unfamiliar order.

Where this actually comes up outside of puzzles

Anagram checking isn't purely recreational. It shows up in a few practical spots:

  • Word game disputes. Scrabble and Words with Friends players occasionally need to confirm whether a proposed word is a genuine rearrangement of their rack, especially with blank tiles involved.
  • Cryptic crossword construction and solving. A large fraction of cryptic clues rely on anagram indicators ("mixed," "confused," "rearranged"), and constructors verify their fodder actually anagrams cleanly before publishing.
  • Pseudonym and alias checks. Writers and companies sometimes build pen names or product names as anagrams of a real name, and want to confirm the letters genuinely match rather than approximately match.
  • Data integrity spot-checks. Comparing whether two strings are permutations of each other is also a basic computer science exercise, used as a building block in some string-matching and plagiarism-detection logic.

None of these need you to do the sorting by hand. Drop two words or phrases into the Anagram Checker and it tells you immediately whether they're built from exactly the same letters — which is the one thing your eyes are surprisingly bad at judging on their own.