Problem 51 - Prime Digit Replacements

 - A little lucky on the solution for this one
 - Search through the primes, for any prime containing a 0,1 or 2
 - replace all the original occurences of (0,1,2) with higher digits, checking for primes
 - I don't think this is guarenteed to find a solution, but it worked in this case
 - Would probably need to have another inner loop determining which of the orignal digits should be replaced....