perplexus.info :: Numbers : Pretty Potent Primes

Pretty Potent Primes (Posted on 2005-03-13)

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?

See The Solution Submitted by Old Original Oskar!

Rating: 3.3333 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re(2): I think I've covered the possibilities--Computer Aided Solution

| Comment 6 of 12 |

(In reply to re: I think I've covered the possibilities--Computer Aided Solution by Eric)

Another solution giving 567 = 409+61+83+7+5+2

Posted by Hugo on 2005-03-13 19:33:01

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info