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(2): I think I've covered the possibilities--Computer Aided Solution | Comment 7 of 11 |
(In reply to re: I think I've covered the possibilities--Computer Aided Solution by Eric)

Unfortunately, despite my programming skills, it seems that my program did not minimize the product portion either, having neglected certain possibilities.  The solution in the solution queue is smaller, so there's still room for someone to find it.
  Posted by Charlie on 2005-03-16 19:51:08

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