![]() |
![]() |
#1 |
"murat"
May 2020
turkey
3×29 Posts |
![]()
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 = 231 – 1 • if ( ( 2 ) ^ ( 231 – 1 ) -2 ) / ( 231 – 1 ) is integer • 231 – 1 is probably prime or psodoprime • ( ( 2 ) ^ ( 231 – 1 ) -2 ) / ( 231 – 1 ) • = (2* ( 2 ) ^ ( 231 – 2 ) -1 ) / ( 231 – 1 ) • Lets find 2n which is equal to 1 according to mod( 231 – 1 ) • 231 mod ( 231 – 1 ) = 1 • İn this case 231*2 = 262 , 231*3 =293 , 231*a mod ( 2^31 – 1) is equal to 1 • İf ( 2 ) ^ ( 231 – 2 ) / 231 is integer also is equal to 1 for mod ( 231 – 1) • ( 231 – 2 ) / 31 is integer • P is probably prime or psodoprime • n =2 • p = 231 + 1 • lets find 2n mod ( 231 + 1 ) = 1 • 2n + 1 , 2n + 2 , … 2n + b • 2n + b mod 231 + 1 = 1 • ( ( 2 ) ^ ( 231 + 1 ) -2 ) / ( 231 +1 ) • = (2* ( 2 ) ^ ( 231 ) -1 ) / ( 231 + 1 ) • if ( 231 ) / ( n + b ) is integer • P is probably prime or psodoprime . • n =2 • p = 231 + c • lets find 2n mod 231 + c = 1 • 2n + 1 , 2n + 2 , … 2n + b sayısı 231 + c • 2n + b mod 231 + c = 1 • ( ( 2 ) ^ ( 231 + c ) -2 ) / ( 231 +c ) • = (2* ( 2 ) ^ ( 231+c-1 ) -1 ) / ( 231 + c ) • İf ( 231+c-1 ) / ( 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 2020-12-26 at 10:25 |
![]() |
![]() |
![]() |
#2 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,109 Posts |
![]() |
![]() |
![]() |
![]() |
#3 |
"murat"
May 2020
turkey
3·29 Posts |
![]() |
![]() |
![]() |
![]() |
#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
|
![]() |
![]() |
![]() |
#5 | |
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
23×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 2020-12-26 at 17:22 |
|
![]() |
![]() |
![]() |
#6 | |
"Alexander"
Nov 2008
The Alamo City
7558 Posts |
![]() Quote:
Last fiddled with by Happy5214 on 2020-12-27 at 02:44 Reason: Detail |
|
![]() |
![]() |
![]() |
#7 | |
"murat"
May 2020
turkey
10101112 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#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 "no-go" thread is the same (and I understood that part already), so the difference is immaterial.
Last fiddled with by Happy5214 on 2020-12-28 at 05:27 Reason: Article |
![]() |
![]() |
![]() |
#9 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,109 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Checking primability | drmurat | Miscellaneous Math | 19 | 2020-11-30 06:31 |
Sale!! 1/2 Price Fermat Test | a1call | Miscellaneous Math | 5 | 2019-03-10 03:39 |
Proof of Primality Test for Fermat Numbers | princeps | Math | 15 | 2012-04-02 21:49 |
The fastest primality test for Fermat numbers. | Arkadiusz | Math | 6 | 2011-04-05 19:39 |
A primality test for Fermat numbers faster than Pépin's test ? | T.Rex | Math | 0 | 2004-10-26 21:37 |