ot;No", but it is a valid question.
Cheers,
Paul Landon
ps. How about one of the more knowledgeable Mathematicians (or Computer
Scientists) regularly communicating a little tutorial on an interesting subject
of
their choosing?
_
funny, but it is not a perfect pun.
For every Mersenne pun there is a corresponding even Perfect Pun.
There is no odd Perfect Pun, the proof is in the margin, if you can't
read it then you need the latest Plug-in for Internet Explorer.
Paul Landon
(in a happy and humorous mood after a great
whether there are an infinite
number of Mersenne Primes or an infinite number of Mersenne
composites.
Cheers,
Paul Landon
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com
.
Cheers,
Paul Landon
Henrik Olsen wrote:
On Mon, 24 Jan 2000, Paul Landon wrote:
Subject: Re: Mersenne: Size of largest prime factor
[snip]
This is not new news to most people here, but I have to remind
myself, it still hasn't been proved whether there are an infinite
number of Mersenne
May I exclusively reserve the topic of "poaching"? ;-)
I will release it in 60 days. (unless it is completed by
someone else before then).
Paul Landon
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.ht
as
added but this was not manipulable like data. Before then reprogramming
could take days and involved recabling and even moving cabinets.
Up to and including this point X modulo m was possible, but would have
been calculated by the inefficient
r := X - ( (X DIV m) * m )
continued.
Paul Lando
-1 is divisible by 2^a-1 and 2^b-1
and can never therefore be prime, and the same for
other bases.
People who know more about this than me, forgive me
for jumping in first, but it is close to my level
of Maths.
Cheers,
Paul Landon
before, that the
first 2 (real) computers used Neumann and Von Neumann architectures!
[EMAIL PROTECTED] wrote:
Many thanks to Paul Landon for the very informative and enjoyable
trilogy about the history of computer testing of Mersenne numbers!
So Newman of Manchester was apparently the first
will be able to pick up from
my work email in that time, so please copy any replies
to [EMAIL PROTECTED]
Prost,
Paul Landon
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com
(mod 8)
to "drop" 3 powers of 2 and divide 2^E-1 with an odd exponent, E
than it would be for another f=7 (mod 8) to "drop" only one.
Pröst,
Paul Landon
From: Alexander Kruppa
Subject: Re: Mersenne: smallest possible factor
Spike Jones wrote:
A few weeks ago, I thought
to this new project, I suggest that
GIMPS would be worthy of your cpu cycles. It is in my opinion the most mathematically
interesting project currently running, and needs all the cycles it can get.
http://www.cecm.sfu.ca/projects/pihex/index.html
Well done,
Paul Landon
Hiya,
Where's the FAQ gone?
It's not at:-
http://www.exu.ilstu.edu/mersenne/faq-mers.txt
or
http://www.exu.ilstu.edu/mersenne/faq-mers
as it is linked from http://mersenne.org/faq.htm
I found one at
http://www.tasam.com/~lrwiman/FAQ-mers
Cheers,
Paul Landon
Hiya Ernst,
http://www.4thestate.co.uk/cipherchallenge/
There's also a good article in the Daily Telegraph:-
http://www.telegraph.co.uk:80/et?ac=000785383641742rtmo=LlLdbL3datmo=gg3Kpg=/et/00/10/12/wswed12.html
Cheers,
Paul Landon
Date: Thu, 12 Oct 2000 11:59:35 EDT
From: [EMAIL
of Q | M_C helping with factoring C is approx:-
M_P0 + M_P1
---
M_C+ M_P0 + M_P1
-
M_P0.M_P1 or not a lot!
Cheers,
Paul Landon
ps. Every train driver knows that Scottish sheep have
a maximum of 7 colours
picked up by SETI@Home.
Full story at:-
http://www.newscientist.com/hottopics/astrobiology/letslearn.jsp
I'm sure there are Pulsars out there transmitting to us larger Mersennes
- in binary.
Cheers,
Paul Landon
_
Unsubscribe
and patience.
I will post my analysis of Reverse Factoring shortly.
Paul Landon
_
Chat with friends online, try MSN Messenger: http://messenger.msn.com
16 matches
Mail list logo
