mersenneforum.org Search Results
 Register FAQ Search Today's Posts Mark Forums Read

 Showing results 1 to 7 of 7 Search took 0.01 seconds. Search: Posts Made By: Dr Sardonicus
 2021-03-15, 20:19 Replies: 27 Views: 3,369 Posted By Dr Sardonicus It seems that for the most of the mersenne... It seems that for the most of the mersenne numbers, this test says nothing. If Mn=7, you have 3^6=1, 1/2=4, 4+1=5 (mod 7). So, it doesn't tell me that 7 is prime or not. Or maybe you screwed up the...
 2021-03-13, 14:00 Replies: 27 Views: 3,369 Posted By Dr Sardonicus Nobody said a proof was not possible. A number... Nobody said a proof was not possible. A number of people have pointed out that no proof is known. There is AFAIK no known composite Mp the test has failed to detect. There are however known...
 2021-03-12, 17:00 Replies: 27 Views: 3,369 Posted By Dr Sardonicus I didn't say that. I said that 3^((n-1)/2) == 1... I didn't say that. I said that 3^((n-1)/2) == 1 (mod n) where n= 1913*5737 is a small composite factor of M239. I suggest you stop responding to posts as if you hadn't read them.
 2021-03-12, 14:12 Replies: 27 Views: 3,369 Posted By Dr Sardonicus Pepin's test works for Fermat numbers because if... Pepin's test works for Fermat numbers because if P = Fn the only prime factor of P - 1 is 2. If n > 0 and P is prime, 3 is a quadratic non-residue (mod P) so Mod(3,P)^((P-1)/2) = Mod(-1,P). ...
 2021-03-12, 01:04 Replies: 27 Views: 3,369 Posted By Dr Sardonicus This is going to miss cases when (a/Mp) = +1 if... This is going to miss cases when (a/Mp) = +1 if Mp is prime (which I'm guessing would be about half the cases for a given a > 3). For example, (5/Mp) = +1 if Mp is prime and p == 1 (mod 4), but...
 2021-03-11, 16:40 Replies: 27 Views: 3,369 Posted By Dr Sardonicus Could you please post one of these, or, if... Could you please post one of these, or, if previously posted, give a link? I can only imagine the fun that would ensue if Mod(3, 2^p - 1)^(2^(p-1)) + 3 == Mod(0, 2^p -1) but LL test says 2^p...
 2021-03-11, 14:58 Replies: 27 Views: 3,369 Posted By Dr Sardonicus A specific instance has been discussed previously... A specific instance has been discussed previously in this Forum, in, e.g. this thread (https://www.mersenneforum.org/showthread.php?t=21362). If P is prime, and gcd(a, P) == 1 then a^((P-1)/2) ==...
 Showing results 1 to 7 of 7

All times are UTC. The time now is 17:55.

Sun Mar 26 17:55:03 UTC 2023 up 220 days, 15:23, 0 users, load averages: 0.73, 0.83, 0.81