Talk:Lucas–Lehmer test for Mersenne numbers

From Wikipedia, the free encyclopedia

You have new messages (last change).

there is a mistake in the article , it supposed to :
s_{p-1}\equiv0\pmod{M_p};
not :
s_{p-2}\equiv0\pmod{M_p};

—The preceding unsigned comment was added by 85.250.124.207 (talk • contribs) 07:26, 4 November 2005 (UTC).

I disagree. M3 is prime and also s_1\equiv0\pmod{M_3}. That is, 14\equiv0\pmod7. However, s_2\ \not\equiv\ 0\pmod{M_3}; equivalently, 194\ \not\equiv\ 0\pmod7. Therefore I think the article is correct as is stands. Eric119 03:35, 5 November 2005 (UTC)

[edit] Dumbing this down with an example?

I think it might help some people by giving an example of how the Lucas-Lehmer test can prove primality of say... 2^5-1, for instance. As the article stands, not many people without prior experience of advanced mathematical notation and terms, would be able to take anything useful from this.

Retrieved from "http://en.wikipedia.org../../../l/u/c/Talk%7ELucas%E2%80%93Lehmer_test_for_Mersenne_numbers_27c1.html"