perplexus.info :: Numbers : Pretty Potent Primes III

Pretty Potent Primes III (Posted on 2010-04-14)

Make a list of distinct prime numbers, using the undecimal digits from 0 to A 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? (None of the primes may admit leading zeroes).

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

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

For minimum sum, we have:
2 + 10 + 3A + 54 + 67 + 89
whose sum in decimal is 285.

For minimum product:
2*3*5*10*47A*689, whose product is 155,077,890 in decimal.
This assumes that the largest prime used is no larger than 1561 in base-11 representation, as that is the largest prime on the previously prepared input file of primes in base-11.
For an explanation, refer to the solution submitted by Charlie in this location.

Comments: ( You must be logged in to post comments.)

	Subject	Author	Date
	computer solution	Charlie	2010-04-14 18:13:09

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

Chatterbox:


perplexus dot info