![]() |
|
|
#12 | |||
|
Feb 2004
France
22×229 Posts |
Quote:
Quote:
Quote:
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 |
|||
|
|
|
|
|
#13 | |||
|
Feb 2005
22·32·7 Posts |
Quote:
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:
Quote:
Last fiddled with by maxal on 2006-02-08 at 20:36 |
|||
|
|
|
![]() |
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 |