found dumb solution to question 004. as it stands it takes too long, and it calculates everything twice. Moreover, I am not certain the bound I set will consistantly find a palindromic number, thought if it does it should be the largest one?...
solved problem 5, but I have not built a program for the general solution yet. The process for finding the answer if to find the minimal set of prime factors such that they can make up the entirety of the numbers from 1 to n, then perform a product on that set.