![]() |
1035*2^1260911-1 (379576 digits)
|
11th drive:
2061*2^956891-1 (288057 digits) |
1105*2^1305693-1 (393056 digits)
|
255*2^1037444-1 (312305 digits)
|
4117*2^968357-1 (291509 digits)
|
4035*2^969017-1 (291707 digits)
|
125*2^1398712-1 (421057 digits)
|
4019*2^972976-1 (292899 digits)
|
1329*2^1306295-1 (393238 digits)
|
2683*2^2360743-1 (710658 digits)
The last prime was at n=2239. |
11th drive
2031*2^966575-1 (290972 digits) 2275*2^967389-1 (291217 digits) |
1041*2^1267241-1 (381481 digits)
|
1019*2^3103680-1 (934304 digits)
|
4197*2^981024-1 (295322 digits)
|
1235*2^1268980-1 (382005 digits)
|
4185*2^984551-1 (296384 digits)
|
4073*2^986584-1 (296995 digits)
|
1019*2^3536312-1 (1064539 digits)
|
4095*2^987999-1 (297421 digits)
|
1385*2^1270984-1 (382608 digits)
1191*2^1271153-1 (382659 digits) |
[QUOTE=pb386;303756]1019*2^3536312-1 (1064539 digits)[/QUOTE]
Peter, congrats on yet another RPS record! :smile: |
1347*2^1271948-1 (382898 digits)
|
3335*2^989236-1 (297794 digits)
|
From the 11th drive:
2079*2^976473-1 (293951 digits) |
11th drive:
2129*2^977428-1 (294239 digits) |
11th drive:
2057*2^981262-1 (295393 digits) 2141*2^981462-1 (295453 digits) 2209*2^983781-1 (296151 digits) |
11th drive: 2247*2^979665-1 (294912 digits)
|
11th drive:
2071*2^986585-1 (296995 digits) |
6555 ยท 2^1068902 - 1 (321776 digits)
My first prime :) |
Hi shanecruise
Congrats on your first prime! :smile: [Your prover's code is now correct, thanks!] |
From the 8th drive
6975*2^1063347-1 (320104 digits) |
1141*2^1281659-1 (385821 digits)
|
11th drive:
2273*2^992830-1 (298875 digits) 2271*2^994134-1 (299268 digits) |
1145*2^1282568-1 (386095 digits)
|
1015*2^1283425-1 (386353 digits)
|
From the first megabit drive
61*2^2381887-1 (717022 digits) |
1195*2^1284795-1 (386765 digits)
|
11th drive:
2047*2^996273-1 (299912 digits) |
11th drive:
2021*2^998170-1 (300483 digits) 2009*2^998528-1 (300591 digits) 2211*2^998593-1 (300610 digits) 2011*2^999391-1 (300850 digits) |
1025*2^1285388-1 (386944 digits)
|
Two more from the 11th drive:
2121*2^997781-1 (300366 digits) 2273*2^997828-1 (300380 digits) |
5535 * 2^1070892 - 1
from 8th drive |
Hi shanecruise,
Congrats on yet another nice prime! |
1157*2^1308162-1 (393800 digits)
|
1029*2^1292517-1 (389090 digits)
|
6555*2^1080139-1 8th drive
325159 digits |
oh there's more
5355*2^1080645-1 (325311 digits) |
255*2^1422283-1 (428153 digits)
|
5445*2^1080331-1 (325216 digits)
@kosmaj : sir what are the odds of getting 3 in a single file and counting ;) |
[QUOTE=shanecruise;308385]5445*2^1080331-1 (325216 digits)
@kosmaj : sir what are the odds of getting 3 in a single file and counting ;)[/QUOTE] If we give you the odds of an individual test coming out prime, do you know how to calculate the odds you seek? I once knew those odds off the top of my head, but would have to do some thread-digging to refresh my knowledge. -Curtis |
Sir are you saying
using bernauli trials suppose Pr[number(n) tested is prime]=x then in a file of 1400 numbers having exactly three primes is P(3)=C(1400,3)*x^3*(1-x)^(1400-3) or if we want Pr[3 or more] 1-P(0)-P(1)-P(2) |
Given the high sieve depth we should expect one prime in about 10000 tests.
The average test file contains about 1500 tests, which means that on average we expect 0.15 primes per file, or a 1:6.67 chance of finding one prime in a test file. Thus, for 3 primes the chance would be about 1:(6.67)^3 or roughly 1:300. |
if 6.67 is the probability of one prime in a file then 1:6.67^3 is probability of finding 1 prime in each of 3 consecutive files.
|
[QUOTE=shanecruise;308402]if 6.67 is the probability of one prime in a file then 1:6.67^3 is probability of finding 1 prime in each of 3 consecutive files.[/QUOTE]
You may be right on this... :unsure: Meanwhile I digged out the formula for computing the odds for a single test to yield a prime, depending on k, n, and the sieve depth: p = 1.781*log(sievedepth) / (log(k) + n*log(2)) Taking n = 1080000, an average k = 6000 and sievedepth = 100,000,000,000,000,000 (100P) we get p = 0.000093127. Inserting this as "x" into your Bernoulli formula and taking N=1479 (the number of candidates in your file) we get the following: P(0) = 0.871324, or a chance of 1:1.15 P(1) = 0.120023, or a chance of 1:8.33 P(2) = 0.008261, or a chance of 1:121 P(3) = 0.000379, or a chance of 1:2640 P(4) = 0.000013, or a chance of 1:76818 P(3+) = 1 - (P(0) + P(1) + P(2)) = 0.000392, or a chance of 1:2550 On average there should be one prime in 10743 tests ( = 1/p), which is a bit more than my rough estimate of one in 10000. |
:beer: perfect
|
Thomas provided the per-test formula I had wished to look up, and the probability calc was exactly what I intended, since each prime test is independent.
2550-to-1 are steeper odds than I would have guessed for that event! -Curtis |
1215*2^1295400-1 (389958 digits)
|
177*2^1775674-1 (534534 digits)
|
From the 10th drive:
24217*2^1304085-1 (392574 digits) |
263*2^1587306-1
|
Hi Oscar,
The server at Top-5000 says that above number is composite. Can you check your submission, maybe you mistyped, or submitted a wrong number. Or, maybe, but hopefully not, you have a hardware issue. Thanks |
You are right Kosmaj, I misstyped it.
I resubmitted as 263*2^1587302-1 (477828 digits). This one should be the good one. |
225*2^1177945-1 (354600 digits)
|
4037*2^1000136-1 (301075 digits)
|
One more k=225 prime:
225*2^1123975-1 (338353 digits) |
4043*2^1001354-1 (301442 digits)
|
1015*2^1311187-1 (394710 digits)
|
4149*2^1002845-1 (301891 digits)
|
4085*2^1004094-1 (302267 digits)
|
4137*2^1007281-1 (303226 digits)
|
1155*2^1816779-1 (546909 digits)
|
4091*2^1012110-1 (304680 digits)
|
4081*2^1015419-1 (305676 digits)
4193*2^1015596-1 (305729 digits) |
4091*2^1016874-1 (306114 digits)
4039*2^1017027-1 (306160 digits) |
112*113^286643-1 (588503 digits)
|
1225*2^1317269-1 (396541 digits)
|
4077*2^1018708-1 (306666 digits)
|
4171*2^1022647-1 (307852 digits)
4185*2^1022913-1 (307932 digits) |
1101*2^1450203-1 (436558 digits)
|
4021*2^1023743-1 (308181 digits)
|
4135*2^1024697-1 (308469 digits)
|
103*2^1192775-1 (359064 digits)
|
4011*2^1032666-1 (310868 digits)
|
2nd Megabit Drive:
179*2^1464720-1 (440927 digits) |
4107*2^1036993-1 (312170 digits)
|
1245*2^1321376-1 (397777 digits)
|
1371*2^1322077-1 (397988 digits)
|
1221*2^1322591-1 (398143 digits)
|
Wow!
1271*2^4850526-1 (1460157 digits) |
[QUOTE=pb386;315540]Wow!
1271*2^4850526-1 (1460157 digits)[/QUOTE] Wow indeed! It looks like it'll be [URL="http://primes.utm.edu/primes/lists/all.txt"]32nd[/URL] largest known prime number when added to the list. :smile: Congrats! |
Hi Peter
Congrats on that BIG prime! :smile: And our new record :banana: about 1.3 million bits more than the current one (1019*2^3536312-1) also set by you. |
Hi Peter,
The confirmation proof at Top-5000 is over! Our score now is [B]50.5700[/B] and [B]796 primes[/B], a significant improvement from the 50.50 level where we spent last several months. And it helped you advance to the 12th position by score. Congratulations again! |
143*2^1214022-1 (365460 digits)
|
143*2^1336358-1 (402286 digits)
|
143*2^1406788-1 (423488 digits)
143*2^1507352-1 (453761 digits) |
4079*2^1049200-1 (315845 digits)
|
1089*2^1323857-1 (398524 digits)
|
| All times are UTC. The time now is 07:28. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.