(related to Problem: An Acrostic Puzzle)

There are twenty-six letters in the alphabet, giving $325$ different pairs. Every one of these pairs may be reversed, making $650$ ways. But every initial letter may be repeated as the final, producing $26$ other ways. The total is therefore $676$ different pairs. In other words, the answer is the square of the number of letters in the alphabet.

Thank you to the contributors under CC BY-SA 4.0!



Project Gutenberg

  1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.