![]() |
|
|
#1 |
|
Nov 2002
2·37 Posts |
Which number will be next after 2^713-1 ???
Will it also be a mersenne number??? Thanks for your answer ps: it woud be nice if the participants could select which number should be factored next!! |
|
|
|
|
#2 | |
|
Sep 2002
26210 Posts |
Quote:
Joss |
|
|
|
|
|
#3 | |
|
"Sander"
Oct 2002
52.345322,5.52471
118910 Posts |
Quote:
According to http://www.mersenne.org/ecmm.htm this number could use a lot more ECM to bring it to the P50 level, and with a year or more sieving, it might be worth to spend some more time and run a few curves with B1=110M |
|
|
|
|
|
#4 |
|
Jun 2003
The Texas Hill Country
32×112 Posts |
Rest assured that we will not start sieving on any number that has not already received "enough" searching by ECM and other methods to be reasonably sure that there are not any small (eg 50 digit) unknown factors. There are plenty of candidates that have been adequately screened.
If you would like for us to consider factoring a number such as M811 that has not already received adequate preliminary searching, you might wish to address that problem. |
|
|
|
|
#5 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2A0116 Posts |
Quote:
A few days ago I created the project files for 2,757-.c213, aka the 213-digit cofactor of M757. So it is a Mersenne number It has had a good amount of ECM work done on it, according to George Woltman and Paul Zimmermann's tables. It seems quite likely that there are no factors under 50 digits and very unlikely that there are any under 45 though neither can be ruled out. Trial sieving has shown that it will be slightly harder to sieve than 10,227-. The post-processing should be intrinsically about as hard as for 10,227- but it should be easier in practice as we have learned some valuable lessons in post-processing from that number. To answer the supplemental (followers of Prime Minister's question time in the House of Commons will know what that means) participants are always welcome to suggest factorizations for NFSNET. We can't guarantee that a project will follow, perhaps because it would be too hard or too easy, but they will certainly be considered. An email to nfsnet-l@nfsnet.org is the best way to suggest a target. Paul |
|
|
|
|
|
#6 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
Quote:
Paul |
|
|
|
|
|
#7 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
Quote:
Paul |
|
|
|
|
|
#8 | ||
|
Jun 2003
1008 Posts |
Quote:
!!!!!!What's your CPU?
|
||
|
|
|
|
#9 | |
|
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
10,753 Posts |
Quote:
Paul |
|
|
|
|
|
#10 |
|
"William"
May 2003
New Haven
2·7·132 Posts |
2^713-1 reached the target of 43 million relations. The server is now handing out assignments for 2^757-1.
|
|
|
|
|
#11 | |
|
Jun 2003
The Texas Hill Country
21018 Posts |
Quote:
|
|
|
|
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Finding multiples of a real number that are close to a whole number | mickfrancis | Math | 16 | 2017-03-01 07:17 |
| Estimating the number of primes in a partially-factored number | CRGreathouse | Probability & Probabilistic Number Theory | 15 | 2014-08-13 18:46 |
| Number of distinct prime factors of a Double Mersenne number | aketilander | Operazione Doppi Mersennes | 1 | 2012-11-09 21:16 |
| Estimating the number of prime factors a number has | henryzz | Math | 7 | 2012-05-23 01:13 |
| Fermat number F6=18446744073709551617 is a composite number. Proof. | literka | Factoring | 5 | 2012-01-30 12:28 |