mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Proth Prime Search

Closed Thread
 
Thread Tools
Old 2022-09-16, 01:22   #34
bbb120
 
"特朗普trump"
Feb 2019
朱晓丹没人草

100001002 Posts
Default

Quote:
Originally Posted by Dr Sardonicus View Post
Please explain the warning about input3.txt

FWIW I verified that n "passes" the Fermat PRP tests to base 2 and base 14.

When n tests as a Fermat PRP but as composite by Miller-Rabin to the same base, a factorization is immediately obtainable.

In the case at hand, we have the factors

Code:
p=2004791083197498027091532260422734265025940830205662543872531023690016085350598121358111595798609866791081582542679083484572616906958584643763990222898400226296015918301
and q = 2*p - 1,
Code:
q = 4009582166394996054183064520845468530051881660411325087745062047380032170701196242716223191597219733582163165085358166969145233813917169287527980445796800452592031836601
EDIT:
It means you've been using the wrong tool for the job. And then you've been complaining that the problem is that the tool is broken.
I know its factor ,
let x=14^((n-1)/4)mod n ,x not equal ±1
and x^2=14^((n-1)/2)mod n equal 1,
so GCD(x-1,n) and GCD(x+1,n) will give the factor of n!
bbb120 is offline  
Old 2022-09-16, 11:54   #35
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

11010100110102 Posts
Default

Quote:
Originally Posted by bbb120 View Post
what does "F-Strong test" mean in pfgw?
Per pfgwdoc.txt:

Code:
A.3.4 F-Strong test
   This test is used when you use the -t option, and your factors don't reach
   the magic 33.33%. It is a strong-primality test, and gives more certainty
   than a Fermat test, but still is NOT a proof!
rogue is offline  
Old 2022-09-18, 23:47   #36
bbb120
 
"特朗普trump"
Feb 2019
朱晓丹没人草

8416 Posts
Default

Quote:
Originally Posted by rogue View Post
Per pfgwdoc.txt:

Code:
A.3.4 F-Strong test
   This test is used when you use the -t option, and your factors don't reach
   the magic 33.33%. It is a strong-primality test, and gives more certainty
   than a Fermat test, but still is NOT a proof!
I need more explanation on the test ,I need more detail about it .
I know it (pfgwdoc.txt),and I read it before
bbb120 is offline  
Old 2022-09-19, 00:15   #37
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

2×47×59 Posts
Default

Try a search engine. Again.

Your combination of complaints, demands, and abrasiveness (impoliteness) is growing quite tiresome.
VBCurtis is offline  
Old 2022-09-19, 00:38   #38
bbb120
 
"特朗普trump"
Feb 2019
朱晓丹没人草

2048 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
Try a search engine. Again.

Your combination of complaints, demands, and abrasiveness (impoliteness) is growing quite tiresome.
I know search engine !
I also know about search engines too,
but I didn't find any valuable information!
bbb120 is offline  
Old 2022-09-19, 08:01   #39
bbb120
 
"特朗普trump"
Feb 2019
朱晓丹没人草

22·3·11 Posts
Default 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 2022-09-19 at 15:05
bbb120 is offline  
Old 2022-09-19, 08:10   #40
bbb120
 
"特朗普trump"
Feb 2019
朱晓丹没人草

22·3·11 Posts
Default

fermat test is useless for Carmichael number!
bbb120 is offline  
Old 2022-09-19, 08:34   #41
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

22×1,087 Posts
Default

Quote:
Originally Posted by bbb120 View Post
why PFGW use fermat test ,not miller rabin test ?
for what reason to use fermat test instead of miller rabin test ?
OpenPFGW is open source. You are welcome to alter the source to provide Miller-Rabin tests. Do it instead of starting more threads about how inadequate the program is for your needs.
paulunderwood is offline  
Old 2022-09-19, 08:40   #42
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

22·1,087 Posts
Default

Quote:
Originally Posted by bbb120 View Post
fermat test is useless for Carmichael number!
Miller-Rabin 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 2022-09-19 at 08:43
paulunderwood is offline  
Old 2022-09-19, 11:44   #43
Denial140
 
Dec 2021

358 Posts
Default

https://en.wikipedia.org/wiki/Carmic...r#Distribution
Denial140 is offline  
Old 2022-09-19, 12:06   #44
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

24·5·83 Posts
Default

Quote:
Originally Posted by bbb120 View Post
why PFGW use fermat test ,not miller rabin test ?
for what reason to use fermat test instead of miller rabin test ?
If this upsets you too much then you can ask for your money back, and move to a different product that has tests you find more to your liking.

Alternatively, if no product suits your desires then you may need to write your own testing code.

Hope that helps.
retina is online now  
Closed Thread

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 2022-11-25 21:30
For which types of primes is GPU primality test software available? bur GPU Computing 6 2020-08-28 06:20
Fastest software for Mersenne primality test? JonathanM Information & Answers 25 2020-06-16 02:47
Primality searches and primality successes marco_calabresi Information & Answers 3 2009-04-17 19:44
Software TTn PSearch 0 2004-05-04 13:16

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


Sat Nov 26 15:49:59 UTC 2022 up 100 days, 13:18, 1 user, load averages: 1.34, 1.03, 0.98

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔