[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: A quick discussion of Mersenne Numbers
-----BEGIN PGP SIGNED MESSAGE-----
On Mon, 2 Dec 1996, Paul Foley wrote:
> On Sun, 1 Dec 1996 14:10:13 -0500, [email protected] wrote:
>
> A mercenne number is of the type:
>
> M(p) = 2**p -1 results in a prime when p is a prime.
>
> *Occasionally* results in a prime when p is prime. (A Mersenne number
> is any number of that form, prime or composite. It so happens that if
> M(p) is prime, p is prime)
>
> Hopefully this will lead the way to see the pattern of prime
> numbers and being able to compute prime numbers in a far more
> efficient manner (after all a function that when given a prime
> number results in a prime number would be quite a kicker now
> wouldn't it!)
>
> That's easy: f(x) = x
>
> The other Mersenne primes include:
>
> 2,3,5,7,13,17,19,31,127,61,89, and 107.
>
> 2, 5, 13, 17, 19, 61, 89 and 107 are not Mersenne numbers :-|
>
> The first few Mersenne primes are:
> 3, 7, 31, 127, 8191, 131071, 524287, 2147483647
True.. but 1 is. 2^1-1=1
--Deviant
PGP KeyID = E820F015 Fingerprint = 3D6AAB628E3DFAA9 F7D35736ABC56D39
Try `stty 0' -- it works much better.
-----BEGIN PGP SIGNATURE-----
Version: 2.6.2
iQEVAwUBMqM+rDCdEh3oIPAVAQHFAAf/RZmwPtfhTwZNhVUhQvNcWBU4agpcK7Tt
VwULhdS80wcwKr4bwtr/EcJlKR9h9pYvkrB4orQLCMOXoeMBJy2Hz0AwVKyjuWh+
BpvbHHQDd66kcpVEpRBbw5biCYuC5nW5uEtZKvidTgTl9zyh9DcJAv3OBdNwqSjN
61MbNX0WbMDTv/2BpVha4NPAcyPs78xNLzARDpASHV8kSCExDzcPsytu8/g/L0xZ
7fF9OIhqbBJM9KR4Qo7XjcV4dF2t0cCRAicJFf34ZkfHx2NBagYBNUIfLBPcgYWB
pUuUxDp4uy2MEAKI3GBYuZ/yXuKnQoBxznO+ltfB37MtVDrzUlq4aw==
=GzxY
-----END PGP SIGNATURE-----