mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 2 of 2
Search took 0.00 seconds.
Search: Posts Made By: R. Gerbicz
Forum: And now for something completely different 2020-05-20, 08:57
Replies: 47
Views: 20,888
Posted By R. Gerbicz
You need a little more: For N=2*3^n+1 if...

You need a little more:
For N=2*3^n+1 if 2^(N-1)==1 mod N and gcd(2^((N-1)/3)-1,N)=1 then N is prime, direct use of the Generalized Pocklington theorem. So provable, and roughly in the same time...
Forum: And now for something completely different 2020-05-19, 21:10
Replies: 47
Views: 20,888
Posted By R. Gerbicz
Check out...

Check out https://en.wikipedia.org/wiki/Euler%27s_criterion, pretty old, but still good stuff.
Showing results 1 to 2 of 2

 
All times are UTC. The time now is 08:59.


Wed Dec 1 08:59:56 UTC 2021 up 131 days, 3:28, 1 user, load averages: 1.13, 1.26, 1.27

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.