mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 10 of 10
Search took 0.01 seconds.
Search: Posts Made By: amenezes
Forum: Math 2021-11-20, 23:51
Replies: 4
Views: 310
Posted By amenezes
Smile Primality Certificates.

Are there any reliable Primality Certificates for Mersenne Numbers that are prime that cannot be faked?
Forum: Math 2020-09-26, 01:55
Replies: 8
Views: 5,886
Posted By amenezes
Sorry an obvious typo in the document. I think we...

Sorry an obvious typo in the document. I think we all know the definition of a Fermat Number Fn. If you do not here it is. A Fermat Number is Fn=2^2^n+1
Forum: Math 2020-08-17, 15:10
Replies: 8
Views: 5,886
Posted By amenezes
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,886
Posted By amenezes
Smile One can fashion a LL test using same similar code...

One can fashion a LL test using same similar code of prime95 for Mersenne Numbers that for Fermat Numbers too! The Pepin's test exists for Fermat Numbers and is deterministic and polynomial. This new...
Forum: Math 2020-08-16, 20:51
Replies: 8
Views: 5,886
Posted By amenezes
Post 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,825
Posted By amenezes
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,825
Posted By amenezes
Soory the correct code is here. The former code...

Soory the correct code is here. The former code has j=0. It should be j=ja;
Thank you.
Allan
Forum: Math 2020-08-02, 06:07
Replies: 4
Views: 4,825
Posted By amenezes
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,825
Posted By amenezes
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,825
Posted By amenezes
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...
Showing results 1 to 10 of 10

 
All times are UTC. The time now is 00:47.


Thu Dec 9 00:47:37 UTC 2021 up 138 days, 19:16, 0 users, load averages: 1.13, 1.41, 1.46

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