mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2006-02-08, 20:24   #12
T.Rex
 
T.Rex's Avatar
 
Feb 2004
France

22×229 Posts
Default

Quote:
Originally Posted by maxal
First off, I've got slightly different result for F(43) running your program here:
Code:
? F(43)
q: 43 A4188889-28 A4188889-56
I wrote a program A that displays each factor only once. Then I wrote a simplified version F in order to provide it on the forum. And they seem to differ in some cases, like for 43. So, I've provided result of A(43) instead of F(43). Sorry.
Quote:
Regarding the algorithm: I think there is no much sense in computing gcd like A=gcd(S1-S1_,S2-S2_) and then checking if A is a dividor of M. It is no better than computing gcd(S1-S1_,M) and gcd(S2-S2_,M) and checking if either is greater than 1. But the latter approach allows to process different starting values independently.
My idea was that mixing values computed from different initial values would lead to more chances to find a factor. Your program shows that the basic Rho Pollard does provide nearly the same factors, but not exactly.
Quote:
And I am not convinced that using several starting values helps much.
Your example with 43 shows that 2/3 sometimes provides different factors.

So, do you agree that the conclusion is that this method could find some interesting factors, but with a higher cost than ways already used by prime95 ?
(up to now, I've found NO interesting big factor with this method and Pari ...)
Tony
T.Rex is offline   Reply With Quote
Old 2006-02-08, 20:35   #13
maxal
 
maxal's Avatar
 
Feb 2005

22·32·7 Posts
Default

Quote:
Originally Posted by T.Rex
My idea was that mixing values computed from different initial values would lead to more chances to find a factor.
Mixing values does not help at all. Because of the following trivial observation:
If gcd(S1-S1_,S2-S2_) gives you a factor of M, then the same factor is contained (maybe with others) in both gcd(S1-S1_,M) and gcd(S2-S2_,M).

Quote:
Originally Posted by T.Rex
Your example with 43 shows that 2/3 sometimes provides different factors.
Yes, but the amount of work is doubled/tripled/etc. with the number of different starting values.

Quote:
Originally Posted by T.Rex
So, do you agree that the conclusion is that this method could find some interesting factors, but with a higher cost than ways already used by prime95 ?
Maybe.

Last fiddled with by maxal on 2006-02-08 at 20:36
maxal is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
Double checking gd_barnes Riesel Prime Search 69 2021-03-21 00:54
Double checking, quail factoring, trick question Mark Rose GPU to 72 11 2014-08-21 20:25
What about double-checking TF/P-1? 137ben PrimeNet 6 2012-03-13 04:01
Double checking Unregistered Information & Answers 19 2011-07-29 09:57
Graph of leading edge of LL testing (and double-checking) over time GP2 Data 10 2003-11-17 14:55

All times are UTC. The time now is 15:08.


Mon Aug 2 15:08:10 UTC 2021 up 10 days, 9:37, 0 users, load averages: 2.74, 2.98, 3.20

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.