20201226, 10:15  #1 
"murat"
May 2020
turkey
3×29 Posts 
A Study About Fermat Primability Test
The primability test of Fermat
• P is prime • ( n ^{p} – n ) / p is integer p is psodoprime or probably prime . • n ^{p  1 } mod p = 1 is must be true equation in this equation • ( n ^{p} – n ) / p = ( n * ( n^{ p – 1} – 1 ) ) / p is getted İf n is not equal to p or n is not equal to p * d than n is not devided by p so ( n ^{p – 1} – 1 ) must be devided by p Lets get n = 2 and p is one of the mersenne number • n =2 • p = 2^{31} – 1 • if ( ( 2 ) ^ ( 2^{31 – 1} ) 2 ) / ( 2^{31} – 1 ) is integer • 2^{31} – 1 is probably prime or psodoprime • ( ( 2 ) ^ ( 2^{31 – 1} ) 2 ) / ( 2^{31} – 1 ) • = (2* ( 2 ) ^ ( 2^{31 – 2} ) 1 ) / ( 2^{31} – 1 ) • Lets find 2^{n }which is equal to 1 according to mod( 2^{31} – 1 ) • 2^{31} mod ( 2^{31} – 1 ) = 1 • İn this case 2^{31*2} = 2^{62} , 2^{31*3} =2^{93} , 2^{31*a} mod ( 2^31 – 1) is equal to 1 • İf ( 2 ) ^ ( 2^{31 – 2} ) / 2^{31} is integer also is equal to 1 for mod ( 2^{31} – 1) • ( 2^{31 – 2} ) / 31 is integer • P is probably prime or psodoprime • n =2 • p = 2^{31} + 1 • lets find 2^{n} mod ( 2^{31} + 1 ) = 1 • 2^{n + 1} , 2^{n + 2} , … 2^{n + b} • 2^{n + b }mod 2^{31} + 1 = 1 • ( ( 2 ) ^ ( 2^{31 + 1} ) 2 ) / ( 2^{31} +1 ) • = (2* ( 2 ) ^ ( 2^{31 }) 1 ) / ( 2^{31} + 1 ) • if ( 2^{31 }) / ( n + b ) is integer • P is probably prime or psodoprime . • n =2 • p = 2^{31} + c • lets find 2^{n} mod 2^{31 }+ c = 1 • 2^{n + 1} , 2^{n + 2} , … 2^{n + b} sayısı 2^{31 }+ c • 2^{n + b} mod 2^{31} + c = 1 • ( ( 2 ) ^ ( 2^{31 + c} ) 2 ) / ( 2^{31} +c ) • = (2* ( 2 ) ^ ( 2^{31+c1} ) 1 ) / ( 2^{31} + c ) • İf ( 2^{31+c1} ) / ( n + b ) is integer • P is probably prime or psodoprime N can be different from 2 I Dont know this study adds something to Fermat Primability Test Please write your comments Last fiddled with by drmurat on 20201226 at 10:25 
20201226, 10:22  #2 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,109 Posts 

20201226, 10:25  #3 
"murat"
May 2020
turkey
3·29 Posts 

20201226, 14:22  #4 
"murat"
May 2020
turkey
3·29 Posts 
I dont know forum rules well. What is the meanimg of Red labeled minus sign on post and who putted it there

20201226, 17:20  #5  
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2^{3}×7×167 Posts 
Quote:
https://en.wikipedia.org/wiki/File:K...not_Enter).svg A moderator would have added it as a statement about the value of the thread. Green plus symbols have been added to threads to indicate that they are important or high value. Last fiddled with by Uncwilly on 20201226 at 17:22 

20201227, 02:41  #6  
"Alexander"
Nov 2008
The Alamo City
755_{8} Posts 
Quote:
Last fiddled with by Happy5214 on 20201227 at 02:44 Reason: Detail 

20201227, 09:54  #7  
"murat"
May 2020
turkey
1010111_{2} Posts 
Quote:


20201228, 05:26  #8 
"Alexander"
Nov 2008
The Alamo City
17×29 Posts 
To be fair, whether you interpret it as a minus or a Do Not Enter sign, the implication of a "bad", "poor quality", or "nogo" thread is the same (and I understood that part already), so the difference is immaterial.
Last fiddled with by Happy5214 on 20201228 at 05:27 Reason: Article 
20201228, 05:38  #9 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,109 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Checking primability  drmurat  Miscellaneous Math  19  20201130 06:31 
Sale!! 1/2 Price Fermat Test  a1call  Miscellaneous Math  5  20190310 03:39 
Proof of Primality Test for Fermat Numbers  princeps  Math  15  20120402 21:49 
The fastest primality test for Fermat numbers.  Arkadiusz  Math  6  20110405 19:39 
A primality test for Fermat numbers faster than Pépin's test ?  T.Rex  Math  0  20041026 21:37 