All about
flooble

fun stuff

Get a free chatterbox

Free JavaScript

Avatars
perplexus
dot
info
Home
>
Numbers
Pretty Potent Primes (
Posted on 20050313
)
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: (
You must be logged in to post comments.
)
Subject
Author
Date
Pretty potent primes
david haendler
20050524 18:36:33
Possible Solution
David
20050328 07:47:15
I think I got it
gary wallravin
20050323 00:35:54
re(3): I think I've covered the possibilitiesComputer Aided Solution
Hugo
20050318 19:21:50
re(2): I think I've covered the possibilitiesComputer Aided Solution
Charlie
20050316 19:51:08
re(2): I think I've covered the possibilitiesComputer Aided Solution
Hugo
20050313 19:33:01
re: I think I've covered the possibilitiesComputer Aided Solution
Eric
20050313 18:17:46
I think I've covered the possibilitiesComputer Aided Solution
Charlie
20050313 17:57:01
re(2): A wild stab at an answer
Charlie
20050313 17:50:52
re: A wild stab at an answer
ken
20050313 17:04:42
A wild stab at an answer
ken
20050313 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:
blackjack
flooble's webmaster puzzle
Copyright © 2002  2017 by
Animus Pactum Consulting
. All rights reserved.
Privacy Information