Please,
I know that TF performs calculations to find prime factors of 2^k-1 with k prime.
When I look at this page (https://www.mersenne.org/report_factoring_effort/?exp_hi=9999), I see that the first value of k that TF works on is k = 1277.
Now, unless I'm mistaken, if k = 1207, we have 2^1207-1, which hasn't yet been completely factorized either.
So why isn't the 337-digit cofactor for 2^1207-1 also on the program for the TF project ?
/ 
Reply
Quote
rebirtherVolunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Send message
Joined: 2 Jan 13
Posts: 7255
Credit: 42,729,227
RAC: 1
Please,
I know that TF performs calculations to find prime factors of 2^k-1 with k prime.
When I look at this page (https://www.mersenne.org/report_factoring_effort/?exp_hi=9999), I see that the first value of k that TF works on is k = 1277.
Now, unless I'm mistaken, if k = 1207, we have 2^1207-1, which hasn't yet been completely factorized either.
So why isn't the 337-digit cofactor for 2^1207-1 also on the program for the TF project ?
TF is only for sieving and should be done up to 74bit, 68bit is too low for GPU, if there is something still available then on CPU. You should ask in mersenneforum for more specific questions.
/ Reply
Quote
OK, many thanks for your answer !
/ Reply
Quote