![]() |
|
|
#287 | |
|
May 2010
Prime hunting commission.
24×3×5×7 Posts |
Quote:
If it took me about 10-15 minutes to prove a p22 prime; It should have taken you a similar timeframe to prove the same number prime; A number ≈70000-75000 times that size should have taken many thousands of times longer. Or did you get started 3-6 months ago? Last fiddled with by 3.14159 on 2010-09-05 at 21:30 |
|
|
|
|
|
|
#288 | |
|
Mar 2006
Germany
22×727 Posts |
Quote:
618970019642690137449562111 = 2^89-1 and therfore only factors = 2kp+1 have to be considered and tested! Last fiddled with by kar_bon on 2010-09-05 at 21:30 |
|
|
|
|
|
|
#289 | |
|
May 2010
Prime hunting commission.
24·3·5·7 Posts |
Quote:
![]() General numbers only. Optionally, Proth numbers. Take a probable prime and prove it prime, using trial-factoring only. So, Charles, try again, with a general or Proth number. (Can either be b = 2 or regular). Unless your computer speeds up by 10000 on demand, let's see how that works out. Last fiddled with by 3.14159 on 2010-09-05 at 21:36 |
|
|
|
|
|
|
#290 |
|
Aug 2006
3·1,993 Posts |
|
|
|
|
|
|
#291 | |
|
May 2010
Prime hunting commission.
24·3·5·7 Posts |
Quote:
You so far have contributed nothing. Next! |
|
|
|
|
|
|
#292 |
|
May 2010
Prime hunting commission.
168010 Posts |
Reporting for 17 or 18: (981248619155265231198804096876768467232996282812538785080944608471724730019235498676*3000!+1)/486830979235504387397288386896757349991446828735164830762828213017832532827952201 is prime, 9051 digits.
This may probably be in Special Cofactor. Last fiddled with by 3.14159 on 2010-09-05 at 21:53 |
|
|
|
|
|
#293 |
|
"Forget I exist"
Jul 2009
Dumbassville
26·131 Posts |
|
|
|
|
|
|
#294 | |
|
May 2010
Prime hunting commission.
69016 Posts |
Quote:
Last fiddled with by 3.14159 on 2010-09-05 at 22:27 |
|
|
|
|
|
|
#295 |
|
Aug 2006
3×1,993 Posts |
Copy/paste error. I fixed it before you posted, but you quoted the unedited version.
Last fiddled with by CRGreathouse on 2010-09-05 at 22:31 |
|
|
|
|
|
#296 |
|
Aug 2006
3×1,993 Posts |
|
|
|
|
|
|
#297 | |
|
Mar 2006
Germany
22·727 Posts |
Quote:
1. Wasting CPU-cycles to find the biggest prime proven by trial division. 2. He can't recognize simple 'easy' numbers. 3. He can't prove if such number is proven only by trial division. Last fiddled with by kar_bon on 2010-09-05 at 23:07 |
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Prime posting thread, part 2. (With a catch.) | 3.14159 | Miscellaneous Math | 55 | 2010-11-19 23:55 |
| Tiny range request .... 555.1M | petrw1 | LMH > 100M | 1 | 2010-07-13 15:35 |
| Other primes thread | nuggetprime | No Prime Left Behind | 32 | 2009-10-21 21:48 |
| Error: tiny factoring failed | 10metreh | Msieve | 26 | 2009-03-08 23:28 |
| Tiny error on nfsnet pages. | antiroach | NFSNET Discussion | 1 | 2003-07-08 00:27 |