failing tests for seeing if something is n-pandigital
implement n-pandigital?
prime number generation from the internet
tests and a solution

this throws because of a stack overflow when calculating primes
fix the primes function so it uses recur
update to correct expectation
move this from pandigital products to combinatorics
test for getting all pandigital numbers
make the non-zero case pass
this is more consistent with the rest
faster way of working out primality
this is considerably faster