20220916, 01:22  #34  
"特朗普trump"
Feb 2019
朱晓丹没人草
10000100_{2} Posts 
Quote:
let x=14^((n1)/4)mod n ,x not equal ±1 and x^2=14^((n1)/2)mod n equal 1, so GCD(x1,n) and GCD(x+1,n) will give the factor of n! 

20220916, 11:54  #35 
"Mark"
Apr 2003
Between here and the
1101010011010_{2} Posts 
Per pfgwdoc.txt:
Code:
A.3.4 FStrong test This test is used when you use the t option, and your factors don't reach the magic 33.33%. It is a strongprimality test, and gives more certainty than a Fermat test, but still is NOT a proof! 
20220918, 23:47  #36  
"特朗普trump"
Feb 2019
朱晓丹没人草
84_{16} Posts 
Quote:
I know it (pfgwdoc.txt),and I read it before 

20220919, 00:15  #37 
"Curtis"
Feb 2005
Riverside, CA
2×47×59 Posts 
Try a search engine. Again.
Your combination of complaints, demands, and abrasiveness (impoliteness) is growing quite tiresome. 
20220919, 00:38  #38 
"特朗普trump"
Feb 2019
朱晓丹没人草
204_{8} Posts 

20220919, 08:01  #39 
"特朗普trump"
Feb 2019
朱晓丹没人草
2^{2}·3·11 Posts 
why PFGW use fermat test ,not miller rabin test ?
why PFGW use fermat test ,not miller rabin test ?
for what reason to use fermat test instead of miller rabin test ? Moderator note: I moved this post and all responses from new thread to this thread. Last fiddled with by Dr Sardonicus on 20220919 at 15:05 
20220919, 08:10  #40 
"特朗普trump"
Feb 2019
朱晓丹没人草
2^{2}·3·11 Posts 
fermat test is useless for Carmichael number!

20220919, 08:34  #41 
Sep 2002
Database er0rr
2^{2}×1,087 Posts 
OpenPFGW is open source. You are welcome to alter the source to provide MillerRabin tests. Do it instead of starting more threads about how inadequate the program is for your needs.

20220919, 08:40  #42 
Sep 2002
Database er0rr
2^{2}·1,087 Posts 
MillerRabin is "useless" with some composites. So what? Use Fermat+Lucas, and if you want to be 100% of primality use something like ECPP (if your number is general enough and not of a special form).
Last fiddled with by paulunderwood on 20220919 at 08:43 
20220919, 11:44  #43 
Dec 2021
35_{8} Posts 

20220919, 12:06  #44  
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2^{4}·5·83 Posts 
Quote:
Alternatively, if no product suits your desires then you may need to write your own testing code. Hope that helps. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
FastECPP software and >50000 digit primality proof (reposted from NMBRTHRY)  Batalov  And now for something completely different  207  20221125 21:30 
For which types of primes is GPU primality test software available?  bur  GPU Computing  6  20200828 06:20 
Fastest software for Mersenne primality test?  JonathanM  Information & Answers  25  20200616 02:47 
Primality searches and primality successes  marco_calabresi  Information & Answers  3  20090417 19:44 
Software  TTn  PSearch  0  20040504 13:16 