Problem: An Acrostic Puzzle

In the making or solving of double acrostics, has it ever occurred to you to consider the variety and limitation of the pair of initial and final letters available for cross words? You may have to find a word beginning with $A$ and ending with $B,$ or $A$ and $C,$ or $A$ and $D,$ and so on. Some combinations are obviously impossible —s uch, for example, as those with Q at the end. But let us assume that a good English word can be found for every case. Then how many possible pairs of letters are available?

Solutions: 1


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

Github:
bookofproofs
non-Github:
@H-Dudeney


References

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 http://www.gutenberg.org. 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.