Finding pan-digital products with Racket
One of the highlights of middle weeks of CPSC 201 is the
allSubsets procedure. Students develop a recursive solution for generating all subsets (up to length ) of a simple alphabet such as or .
The binary version is nice because it focuses attention on the base case, which is an empty nested list. By distributing the alphabet onto the base list, and then prepending these new strings onto the initial, empty list-of-lists, we get all subsets of length 1 and the null set:
But what if the alphabet has more than two or three symbols in it? We know that there are subsets of up to length for a binary alphabet. When dealing with the base 10 numeral system, there are subsets. This is quite a large number! In fact, it simply counts EVERY natural number from [0, ). For example, for strings up to length 2 there are 100 subsets given the alphabet : namely, the numbers from 0 to 99. Note that 0 is technically 00, since it represents the case of deciding twice in a row to NOT select a symbol from the alphabet. But as with the binary case, we don’t show the leading 0’s by convention.
The steps of our algorithm imply an inner and an outer loop. We are looping over each element in the first element of the result. That’s the outer loop; if we are at step then these elements will all be of length . The inner loop is over the symbols in the alphabet. We have choices for augmenting the selected lists from length to length , where is the size of the alphabet.
In Racket, you can use
map twice in order to get a nested list. See my code for Project Euler problem 32 here. In my comments to this file, I discuss a modification (using
filter) by which we can generate only those subsets that do not repeat any digits.