![]() |
|
|
#12 | |
|
Aug 2006
10111011001002 Posts |
Quote:
There's still no effective version of Baker-Harman-Pintz AFAIK (though they say it's possible, I guess it's just too much work for someone to have done it?) which would give a much tighter bound. |
|
|
|
|
|
|
#13 |
|
"Forget I exist"
Jul 2009
Dartmouth NS
210D16 Posts |
yes they are all 5 mod 6 that's how I got that it was 5 mod 6. 10 = 4 mod 6 4^2 = 4 mod 6 so 100 = 4^2 mod 6 = 4 , 1000 = 4^2 mod 6 = 4.
Last fiddled with by science_man_88 on 2011-04-15 at 18:09 |
|
|
|
|
|
#14 |
|
"Forget I exist"
Jul 2009
Dartmouth NS
8,461 Posts |
since you like giving things through PM I get you want me to look at 11,1001,100001, etc with even numbers of 0's and realize that they are multiples of 11.
|
|
|
|
|
|
#15 |
|
"Forget I exist"
Jul 2009
Dartmouth NS
8,461 Posts |
so this is of the form 11x + 1 as 11 is odd 50% of these numbers end up being even. that's as far as I know. but as it stands that all powers of 10 are 4 mod 6 we can conclude the n still stand for what to test. never mind no they don't I found an error.
Last fiddled with by science_man_88 on 2011-04-15 at 18:22 |
|
|
|
|
|
#16 |
|
"Forget I exist"
Jul 2009
Dartmouth NS
8,461 Posts |
n must actually be n
my error was jumping to 4,2 instead of 2,4 . Last fiddled with by science_man_88 on 2011-04-15 at 18:25 |
|
|
|
|
|
#17 |
|
1976 Toyota Corona years forever!
"Wayne"
Nov 2006
Saskatchewan, Canada
14CD16 Posts |
From this same list: http://primes.utm.edu/primes/lists/all.txt
I can say for sure that we know the smallest prime with 100,000 digits? 10,000 digits? 1,000 digits? |
|
|
|
|
|
#18 |
|
"Forget I exist"
Jul 2009
Dartmouth NS
8,461 Posts |
Code:
forstep(x=1,100,[2,4],if(x%11!=1 && x%120!=79 && x%6!=2 && x%4!=3,print1(x","))) Last fiddled with by science_man_88 on 2011-04-15 at 18:41 |
|
|
|
|
|
#19 | |
|
Nov 2008
2·33·43 Posts |
Quote:
10^9999+33603 is on the list - I suspect that is the smallest with 10000 digits as I see no other reason for it to be on the list. |
|
|
|
|
|
|
#20 |
|
"Forget I exist"
Jul 2009
Dartmouth NS
8,461 Posts |
Code:
(17:49)>for(y=2,300,for(x=1,300,if(((10^x)%y)==((10^(x+1))%y),print(x" "y" "10^x%y);break()))) 1 2 0 1 3 1 2 4 0 1 5 0 1 6 4 3 8 0 1 9 1 1 10 0 2 12 4 1 15 10 4 16 0 1 18 10 2 20 0 3 24 16 2 25 0 1 30 10 5 32 0 2 36 28 3 40 0 1 45 10 4 48 16 2 50 0 2 60 40 6 64 0 3 72 64 2 75 25 4 80 0 1 90 10 5 96 64 2 100 0 3 120 40 3 125 0 7 128 0 4 144 64 2 150 100 5 160 0 2 180 100 6 192 64 3 200 0 2 225 100 4 240 160 3 250 0 8 256 0 5 288 64 2 300 100 Last fiddled with by science_man_88 on 2011-04-15 at 20:54 |
|
|
|
|
|
#21 |
|
Aug 2006
598810 Posts |
Right, that is the smallest 10,000-digit prime. The smallest 100,000-digit prime is 10^99999 + 309403.
|
|
|
|
|
|
#22 | |
|
"Robert Gerbicz"
Oct 2005
Hungary
3×547 Posts |
Quote:
What is interesting about this table, that it isn't sorted correctly in decreasing order, there are many errors in the sort. One of them is: Code:
179 10^99999+309403 100000 Daniel Heuer 01/2004 180 10^100000-260199 100000 Patrick De Geest 01/2010 |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Sci-Tech extrapolation into Sci-Fi. | jwaltos | Reading | 0 | 2017-10-31 19:00 |
| Estimating minimum relations | bchaffin | Factoring | 24 | 2012-03-24 18:37 |
| Using long long's in Mingw with 32-bit Windows XP | grandpascorpion | Programming | 7 | 2009-10-04 12:13 |
| I think it's gonna be a long, long time | panic | Hardware | 9 | 2009-09-11 05:11 |
| Msieve NFS minimum size | 10metreh | Msieve | 35 | 2009-04-02 19:14 |