Some History Notes about Alphametiric Puzzles, (and some early versions of a Topology Gem)

They go by various names, Verbal arithmetic, alphametics, cryptarithmetic, crypt-arithmetic, cryptarithms, but you remember seeing them in school, probably as far back as elementary school. All of the terms are much newer than the puzzle. The name "cryptarithmie" was coined by puzzlist Minos (pseudonym of Simon Vatriquant) in the May 1931 issue of Sphinx, a Belgian magazine of recreational mathematics, and was translated as "cryptarithmetic" by Maurice Kraitchik in 1942. In 1955, J. A. H. Hunter introduced the word "alphametic" (my personal favorite) to designate cryptarithms, such as Dudeney's, whose letters form meaningful words or phrases

The almost certainly most well known version, published in the July 1924 issue of Strand Magazine by Henry Dudeney, is:

\(\begin{matrix} & & \text{S} & \text{E} & \text{N} & \text{D} \\ + & & \text{M} & \text{O} & \text{R} & \text{E} \\ \hline = & \text{M} & \text{O} & \text{N} & \text{E} & \text{Y} \\ \end{matrix}\)

The problems existed for at least sixty years before that, and almost any place on the internet you can find that , "Verbal arithmetic puzzles are quite old and their inventor is not known. An 1864 example in The American Agriculturist disproves the popular notion that it was invented by Sam Loyd." (As with many things popularly known to have been invented by Sam Loyd, it was he who popularized the notion that he had invented them.) But not one of the dozens of sites I found this exact statement on, had the original problem. Finally I dug deep into Google Books, and at last ladies and gentlemen, after a period of perhaps 150 years, the first known verbal arithmetic problem ever published:



Yikes, Ten different letters for a 4 digit by 6 digit multiplication......... This can NOT be the first such problem. Recreational problems start out with simple ideas that people stumble across and find curious, and then expand to more and more complexity.

For a modern, but challenging version, here is one I got from Dave Radcliffe@daveinstpaul in early 2016. No solution is offered, although he said he did it first by computer, and warned that "It wasn't so easy."

If that sounds too tough, Dave says  "I was inspired by HALF+HALF=WHOLE, which I saw on FB"
 -It has more than one answer, so if you find one too quickly, try to figure out how many it has in all. (collect the whole set, send them in the comments ) If you have trouble with Dave's problem, you can look to the bottom of the blog.... or you can visit this site which is set up to solve these types of problems for you .

Benjamin Vitale ‏@BenVitale came up with this one which has two solutions with the same total, NOT + IN + THE = MOOD

A little while later he did a second post with this somewhat unusual version:
(x, y, z)   are positive integers in arithmetic sequence such that
,
    and    
Find   And along the way, O, T, and W

---

While looking for the answer to the earliest alphametic, which I never found, I came across an early version of a common, "bet you can't do this" problem many students run into:

The problem is generally called the "five rooms" problem, and the object of the puzzle is to draw a continuous path through the walls of all 5 rooms, without going through any wall twice, and without crossing any path. At least that is the modern version of the problem, (and not too modern at that, as this was the version I encountered as a student a very long time ago.)..
But the earliest versions of the problem ask for it to be drawn with "three strokes of the pencil, without erasing any lines, or going over the same line twice.  This is the same version Henry E. Dudeney used in his 1917 "Amusements in Mathematics", problem 239.  I was surprised to see that Gardner's "Entertaining Mathematical Puzzles", 1961 also had this version under the title "Five Bricks" on page 77. In his "My Best Mathematical and Logic Puzzles" on pages 6 and 7 he calls it "Cross the Network" and it takes the form of the five rooms problem.





Here is a slightly blown up copy for you to try.

There are a number of these types of puzzles. Martin Gardner described them as one of the oldest of topological puzzles but gives no clear details on origin. I could find no references to the type of problem in David Singmaster's Chronology or Recreational Mathematics, but maybe it slipped my eye.
Lewis Carroll (Charles Dodgson) like to give one that is possible to his young friends according to an old article in the Strand Magazine, 1908. Although it is sometimes attributed to Carroll, the author of the article says he "saw it in a little book published in 1835. He then contrasts the easy solution of Carroll's problem with what he calls "the old circle and square" problem, I assume because he believes it is older.

If you have information about this problem in either form I would love information, links, or digital copies.

Sometimes you come across things in old puzzle magazines that leave you stumped, as I di in this problem. An interesting, and probably challenging question for people in the US, A question in one of the 1860 editions asked, "What four US coins can be used to make a total of 51 cents... If you get stuck, I will post this answer a little lower down the post..



The solution of the problem of the four coins to make 51 cents was two quarters and two 1/2 cent pieces. The 1/2 cent coins were produced in the United States from 1793 to 1857. The half-cent piece was made of 100% copper and was valued at five milles, or one two-hundredth of a dollar.

The solution to Dave's alphametic is A=7 E=5 F=1 H=6 I=4 L=0 N=3 O=8 T=2 W=9