Partitions
I realized that I'd lost the partition code I wrote last summer, so I went to write it again, using a somewhat different approach. My new code is able to run much faster, finding the ZD(52)=180180 in under a minute (as opposed to around an hour for the old version, running on a slower computer). It still seems that there must be a more efficient way; that value was known in the late 1800s, before the availability of computers.
For people who weren't reading my diary last summer, ZD(n) is the largest order of any permutation over n elements -- the name comes from HCSSiM '93 ("Zoe/Dan").
I'm still trying to optimize my program a bit, but I may be on the wrong track entirely.
