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?

Submitted by Old Original Oskar!

Rating: 3.3333 (3 votes)

Solution: (Hide)

567=2+3+5+67+89+401 and 15618090=2x3x5x487x1069

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
Puzzle Thoughts	K Sengupta	2023-03-30 21:48:28
Pretty potent primes	david haendler	2005-05-24 18:36:33
Possible Solution	David	2005-03-28 07:47:15
I think I got it	gary wallravin	2005-03-23 00:35:54
re(3): I think I've covered the possibilities--Computer Aided Solution	Hugo	2005-03-18 19:21:50
re(2): I think I've covered the possibilities--Computer Aided Solution	Charlie	2005-03-16 19:51:08
re(2): I think I've covered the possibilities--Computer Aided Solution	Hugo	2005-03-13 19:33:01
re: I think I've covered the possibilities--Computer Aided Solution	Eric	2005-03-13 18:17:46
I think I've covered the possibilities--Computer Aided Solution	Charlie	2005-03-13 17:57:01
re(2): A wild stab at an answer	Charlie	2005-03-13 17:50:52
re: A wild stab at an answer	ken	2005-03-13 17:04:42
A wild stab at an answer	ken	2005-03-13 16:58:36

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