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

Home > Numbers
Pretty Potent Primes (Posted on 2005-03-13) Difficulty: 4 of 5
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(3): I think I've covered the possibilities--Computer Aided Solution | Comment 8 of 12 |
(In reply to re(2): I think I've covered the possibilities--Computer Aided Solution by Charlie)

After Charlie's posting, I started looking again, before that I never got lower than 27 something million for the products.

My new solution is:
2*3*5*487*1069 = 15.618.090 


  Posted by Hugo on 2005-03-18 19:21:50
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 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information