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

Home > Numbers
Pretty Potent Primes II (Posted on 2008-12-09) Difficulty: 3 of 5
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.)
re(2): A possible start! | Comment 3 of 5 |
(In reply to re: A possible start! by Dej Mar)

Edited on February 4, 2009, 2:24 pm
  Posted by K Sengupta on 2008-12-11 05:49:37

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 (10)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information