mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2011-03-17, 21:29   #45
allasc
 
Aug 2010
SPb

2×17 Posts
Default

Another interesting sequence

in OEIS A187923

Numbers n with property that 2^(m-1)=1(mod m) and n=3(mod 4) where m=(2*n-1)*n

47, 67, 2731, 2887, 5827, 13567, 41647, 44851, 46051, 47911, 59671, 61231, 66571, 78439, 90107, 109891, 138007, 141067, 144451, 164011, 183907, 321091, 406591, 430987, 460531, 501187, 513731, 532027, 537587, 554731, 598687, 673207, 677447, 792067, 912367, 1015171, 1162927...

for n<=708993451
all elements of prime numbers

Please help find exceptions if they are.

------------------

Number m has the interesting property.

For each item found n this sequence, we have the value m = (2*n-1) * n.

This value of m has the following property: p^(m-1)==1(mod m) where p=(2^i)-2 where (i - integer>=2)

as called pseudo-prime numbers that satisfy Fermat's little theorem for any base of (2^i)-2 where i - integer>=2 ????

message in Russian http://dxdy.ru/post424085.html#p424085
allasc is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Modifying the Lucas Lehmer Primality Test into a fast test of nothing Trilo Miscellaneous Math 25 2018-03-11 23:20
New PC test re-test plan? dh1 Information & Answers 8 2015-12-11 11:50
Double check LL test faster than first run test lidocorc Software 3 2008-12-03 15:12
Will the torture test, test ALL available memory? swinster Software 2 2007-12-01 17:54
A primality test for Fermat numbers faster than P├ępin's test ? T.Rex Math 0 2004-10-26 21:37

All times are UTC. The time now is 15:13.


Sun Dec 5 15:13:46 UTC 2021 up 135 days, 9:42, 1 user, load averages: 0.76, 1.19, 1.26

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.