perplexus.info :: Numbers : Pretty Potent Primes

Pretty Potent Primes (Posted on 2005-03-13)

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.)

A wild stab at an answer

| Comment 1 of 12

I just tried to come up with the smallest numbers that I could and use all the digits.

2, 3, 5, 67, 89, 401

Sum = 567

Product = 40,673,682,630

Posted by ken on 2005-03-13 16:58:36

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:


perplexus dot info