scholarly journals Implementing 64-bit Maximally Equidistributed F 2 -Linear Generators with Mersenne Prime Period

2018 ◽  
Vol 44 (3) ◽  
pp. 1-11 ◽  
Author(s):  
Shin Harase ◽  
Takamitsu Kimoto
Keyword(s):  
Prime Period ◽  
Linear Generators ◽  
Mersenne Prime

Trace representation of Legendre sequences of Mersenne prime period

1996 ◽  
Vol 42 (6) ◽  
pp. 2254-2255 ◽  
Author(s):  
Jong-Seon No ◽  
Hwan-Keun Lee ◽  
Habong Chung ◽  
Hong-Yeop Song ◽  
Kyeongcheol Yang
Keyword(s):  
Prime Period ◽  
Trace Representation ◽  
Mersenne Prime

Pseudoperfect numbers with no small prime divisors

2009 ◽  
Vol 93 (528) ◽  
pp. 404-409
Author(s):  
Peter Shiu
Keyword(s):  
Difficult Problem ◽  
Prime Divisors ◽  
Perfect Number ◽  
Perfect Numbers ◽  
Mersenne Primes ◽  
Mersenne Prime

A perfect number is a number which is the sum of all its divisors except itself, the smallest such number being 6. By results due to Euclid and Euler, all the even perfect numbers are of the form 2P-1(2p - 1) where p and 2p - 1 are primes; the latter one is called a Mersenne prime. Whether there are infinitely many Mersenne primes is a notoriously difficult problem, as is the problem of whether there is an odd perfect number.

Fixed points of maps of odd prime period

1964 ◽  
pp. 104-124
Author(s):  
P. E. Conner ◽  
E. E. Floyd
Keyword(s):  
Fixed Points ◽  
Prime Period
Sign in / Sign up

Export Citation Format

Share Document