Added a new method to ProjectEuler.Math that can generate the actual coin combinations instead of just counting them. This is useful if you need the actual integer partitions of a number, for instance.
Broke up mergeInf in Util.hs into two pieces. It is now clearer what is going on, I hope.
Solved 110. It is not very fast. It EATS memory.
Modified 108.hs to use the code from 110.hs.
Keeping the old version of 108.hs for posterity.