Problem 69 - Totient maximum

 - saw the pattern in this by printing the prime factors of the successively
   maximizing values of n/phi(n)
 - solution is then easy to calculate: product of primes <1000000