Go Back > Great Internet Mersenne Prime Search > Math

Thread Tools
Old 2005-09-11, 19:50   #12
Jul 2003
Thuringia; Germany

728 Posts

Originally Posted by T.Rex
About q=53 I don't understand how 1 statement is true (5^...) though the other one is false (R^2+R-1 ...) since they are related. Do you ?
These two statements are related, yes. But the 5^... is stronger, because it uses the litte Fermat, too.

For q=53 the number 5 is a quadratic residue, but M_q does not hold a fermat-test with base 5.


Last fiddled with by cyrix on 2005-09-11 at 19:51
cyrix is offline   Reply With Quote
Old 2005-09-12, 07:56   #13
T.Rex's Avatar
Feb 2004

2×33×17 Posts
Default Pépin's test proved by means of LLT means

Hi Cyrix,
About what I said about proving that a Pépin's-like test can be used for Mersenne numbers, look at the bottom of page 4 of this
paper, which clearly shows that one can prove the Pépin's test (with k=3) for Fermat numbers by means of technics developped by Lucas and refined by Ribenboim for Mersenne numbers, and that I generalized and applied to Fermat numbers.
So I guess the same could be done (with k=5) for Mersenne numbers.
The problem is to find the appropriate Lucas Sequence, I think.
T.Rex is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Property of pseudoprime numbers by base 2 AND / OR 3 allasc And now for something completely different 1 2017-05-17 15:00
new property of prime numbers discovered? ixfd64 Math 1 2016-03-14 21:53
A conjecture on a new property of Mersenne primes Thiele Math 18 2010-05-23 05:35
Curious property of Mersenne numbers. arithmeticae Lounge 5 2008-10-27 06:15
A property of Fermat numbers. Already known ? T.Rex Math 6 2006-09-17 22:11

All times are UTC. The time now is 07:58.

Sat Oct 16 07:58:34 UTC 2021 up 85 days, 2:27, 0 users, load averages: 0.84, 1.05, 1.12

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.