Make a list of prime numbers, using the digits from 0 to 9 exactly once each in the list. What is the minimum sum of all the numbers in such a list? What's the minimum product of all the numbers in such a list?

To sum up the last best answers:

2+5+7+61+83+409 = 567    or

2+3+5+67+89+401 = 567  for the sum and

2*3*5*487*1069 = 15,618,090 for the product.

Does anyone have a better solution to either?

Dave

 

Posted by david haendler on 2005-05-24 18:36:33