W.W. Rouse Ball in his book Mathematical Recreations and Essays describes some variations on the old problem of representing numbers 1, 2, 3, … using four 4’s and various operations. He lists what he thinks are useful operations and whether they are considered “simpler” in some sense. In the table below, I have roughly followed his ordering, but have taken some liberties with some expressions and accepted an aesthetically more pleasing alternative. The main difference is that he places the denary scale (like 44) to be very simple, but I have downgraded that in order to prioritise the use of a 4 as the number four.
My order of importance is:
Rouse Ball also allows the use of a square root an infinite number of times, but that is a step I am unwilling to take, especially since as soon as we allow subfactorials we can achieve the equivalent.
The most common problem is to use four fours to make numbers in sequence 0, 1, 2, ... How far can we get? He claims to get to 877 with that set of allowable notations, and I agree. Here is a table of my proposals for fours 4’s.
Using each of the digits four times, we can reach to various lengths. Rouse Ball does not consider zero, and he limits himself and excludes the use of powers or subfactorials in his statements of how far we can get for each of the digits. The list below is the result of my further recent work and uses the full list of operations given above.
If we consider what we can do with four different digits, then the obvious combination of using 1, 2, 3 and 4 was mentioned by Rouse Ball as well, but not using exactly the same set of rules. However, I looked at various sets of four numbers to see how far we can go with the rules given above.
The worst case is the set {0, 1, 6, 7}, which gets us only to 91.
The commonly considered case of the set {1, 2, 3, 4} makes numbers up to 652.
Many combinations can get over 1000, and the best case is the set {3, 4, 5, 7} which go as far as 1410.
© Copyright Andy Pepperdine, 2019
Licensed under a
Creative Commons Attribution-Noncommercial-Share Alike 3.0 Unported License (detail)