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

Home > Numbers
Extreme Eleven Exercise (Posted on 2010-01-21) Difficulty: 3 of 5
N is an 11-digit base ten prime number N (with no leading zero) with the proviso that N contains each of the digits from 0 to 9 at least once.

Determine the respective minimum and maximum value of N.

No Solution Yet Submitted by K Sengupta    
Rating: 3.5000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Minimum | Comment 1 of 4

I think the minimum is 10,123,457,689.

I started by building a file of all primes < 1,000,000, which is enough to check primality for any 11-digit number.  Then running a program with some optimization techniques I was able to get the above number.

Now to work on the maximum ...


  Posted by Jim Keneipp on 2010-01-21 14:23:02
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 (6)
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