Enigma 1174: Small sums
28 March 2016
Posted by on
From New Scientist #2330, 16th February 2002 [link]
An example of a letter sum is:
ABC + DCEF = AEFB.
That is to say word + word = word, where each word is a string of letters of any length. An example of an answer for the above sum is:
537 + 4726 = 5263.
We are concerned with letter sums that have exactly one answer. For each such letter sum we produce its A-number by taking its answer and discarding the + and =. For example if the above letter sum had only the answer given above then its A-number would be:
What are the four smallest A-numbers we can get by this process?