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?
(In reply to
re: I think I've covered the possibilities--Computer Aided Solution by Eric)
Unfortunately, despite my programming skills, it seems that my program did not minimize the product portion either, having neglected certain possibilities. The solution in the solution queue is smaller, so there's still room for someone to find it.
|
|
Posted by Charlie
on 2005-03-16 19:51:08 |
re(2): I think I've covered the possibilities--Computer Aided Solution
