Forum: Math
2020-09-26, 01:55
|
|
Replies: 8
Views: 5,454
|
|
Forum: Math
2020-08-17, 15:10
|
|
Replies: 8
Views: 5,454
Yes they are the same time complexity. But it...
Yes they are the same time complexity. But it would be perhaps easier to modify Prime95 for the LL test rather than the Pepin test. At least thats what i hoped, So we could hunt for both Mersenne ...
|
|
Forum: Math
2020-08-16, 22:22
|
|
Replies: 8
Views: 5,454
|
|
Forum: Math
2020-08-16, 20:51
|
|
Replies: 8
Views: 5,454
Lucas-Lehmer Test for Fermat Numbers.
Here is a short paper by me on the Lucas-Lehmer Test for Fermat Numbers with a short readable Theorem and an Algorithm which implements the Lucas-Lehmer Test for the Fermat type Numbers.
Please read...
|
|
Forum: Math
2020-08-02, 17:20
|
|
Replies: 4
Views: 4,667
In the Theorem proof the error is here: ...
In the Theorem proof the error is here:
2^(n-1)==1 ( mod n) = 1 (mod p) as p | n
b^(n-1)==1( mod n) == 1 (mod p) as p | n
Subtracting the two equivalences gives:
2^(n-1)==b^(n-1) ( mod p)...
|
|
Forum: Math
2020-08-02, 06:55
|
|
Replies: 4
Views: 4,667
|
|
Forum: Math
2020-08-02, 06:07
|
|
Replies: 4
Views: 4,667
Attached is the code I tested it with in C. It...
Attached is the code I tested it with in C. It uses GMPLIB http://gmplib.org
Compile it as :
gcc -o pspf -lm -m64 -lgmp pspfactorsm.c
and run :
./pspf filename.out filename,in
where filename.in...
|
|
Forum: Math
2020-08-02, 05:54
|
|
Replies: 4
Views: 4,667
This is empirically true only so far
This is only empirically determined to be true for all base 2 Euler pseudo primes uptil 2^64-1 but the proof given is not correct as it includes circular reasoning. My stupid error in posting it up....
|
|
Forum: Math
2020-08-02, 01:44
|
|
Replies: 4
Views: 4,667
Solovay Strassen Mod
In the Solovay strassen primality test we can can make the the base a=2 and another a or b such that the jacobi symbol is the opposite sign of that of the jacobi of 2 with respect to n the odd...
|
