All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Pretty Potent Primes II (Posted on 2008-12-09)
Make a list of distinct prime numbers, using the decimal digits from 0 to 9 exactly twice 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? (None of the primes may admit leading zeroes).

Bonus Question:

Make a list of distinct prime numbers, using the duodecimal digits from 0 to B exactly twice 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? (None of the primes may admit leading zeroes).

Note: Think of this problem as an extension of Pretty Potent Primes.

 No Solution Yet Submitted by K Sengupta No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 Solution? Comment 5 of 5 |
2+5+23+47+61+67+83+89+401+509 = 1287
 Posted by Claudio on 2009-07-17 22:05:42

 Search: Search body:
Forums (0)