![]() |
![]() |
#1 |
"Juan Tutors"
Mar 2004
10001100002 Posts |
![]()
I know lots of these ideas come along, and I am getting more comfortable with the math involved with Stage 2 as I write this, so please forgive me if I missed something.
From what I understand, in the P-1 factoring stage 1, Given Mp, we calculate 3^(2*E*p)-1 mod Mp where E is the product of many powers of prime factors less than a number B1. In stage 2, for various primes q between B1 and B2, we then calculate 3^(2*E*p*q)-1 mod Mp. Noting that every prime q divides 2^n-1 for some value of n (and in fact all integer multiples of n), would it be feasible in some cases to instead calculate 3^(2*E*p*(2^n-1))-1 mod Mp for such a value of n? |
![]() |
![]() |
![]() |
#2 |
"University student"
May 2021
Beijing, China
2×53 Posts |
![]()
That's right, but the extension is not economic. You need even more iterations to calculate it. Also you can't directly use your sub-products for PRP either, unless you calculate modular inverses (higher complexity!)
|
![]() |
![]() |
![]() |
#3 |
"Juan Tutors"
Mar 2004
23016 Posts |
![]()
Ahh, I see my error. I was comparing 3^Mp-1 to 2^n-1 instead of 3^(2^n-1).
|
![]() |
![]() |
![]() |
#4 |
Romulan Interpreter
"name field"
Jun 2011
Thailand
100110111010102 Posts |
![]() |
![]() |
![]() |
![]() |
#5 |
"Juan Tutors"
Mar 2004
23016 Posts |
![]()
I did realize my error as I explained above but I did post in another thread by Zhangrc a more correct modification of this test. I'll reply there.
https://mersenneforum.org/showthread.php?t=26863&page=2 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Extension request | LaurV | Data | 9 | 2019-04-14 00:13 |
PCI-E USB 3.0 Extension Cable | vsuite | GPU Computing | 7 | 2017-07-10 20:45 |
Stage 1 with mprime/prime95, stage 2 with GMP-ECM | D. B. Staple | Factoring | 2 | 2007-12-14 00:21 |
brent suyama extension in P-1 | bsquared | Factoring | 9 | 2007-05-18 19:24 |
Stage 1 and stage 2 tests missing | Matthias C. Noc | PrimeNet | 5 | 2004-08-25 15:42 |