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

Home > Numbers
Pretty Potent Primes IV (Posted on 2010-10-26) Difficulty: 3 of 5
Make a list of distinct prime numbers, using the hexadecimal digits 1,3, 5, 7, 9, B, D, F 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?

Bonus Question:

Make a list of distinct prime numbers, using the hexadecimal digits from 1 to F 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?

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

No Solution Yet Submitted by K Sengupta    
Rating: 3.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutionmaybe answerVishal Gupta2010-10-27 16:24:34
Some Thoughtscandidate for part 1Charlie2010-10-26 17:59:58
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:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information