OK!
Anyone for a party in Bavaria?
Is it possible to have a better ETA of the verification, so we can plan a
party?
Cheers,
Paul
PS: Anyone who knows me, this is my current email address.
_
Use MSN Messenger to send music and pics t
problem given enough batteries and patience.
I will post my analysis of Reverse Factoring shortly.
Paul Landon
_
Chat with friends online, try MSN Messe
flection of it isn't 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
___
2 factors, the
probability 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 maxim
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,
P
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=000785383641742&rtmo=LlLdbL3d&atmo=gg3K&pg=/et/00/10/12/wswed12.html
Cheers,
Paul Landon
> Date: Thu, 12 Oct 2000 11:59:3
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
kely for an f=1 (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 wr
that I 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 -- h
t realised 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 wa
f Erdös,
page 35.
"The technique that the GIMPS project uses isn't much
more sophisticated than the 2000 year old method called
"the sieve of Eratosthenes," invented by Eratosthenes of
Alexandria, whose nickname was Beta"
That would be the Beta release of Prime95 then? ;-)
Cheers,
Paul Landon
_
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
-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
rsenne Primes was documented in a newspaper.
In conclusion, it is strongly probable that:-
Prof. Newman at Manchester University was the first person to use a
computer to test Mersennes using "Baby" the Manchester Mark 1 in 1949.
Please have a read about "Baby" - The First Real
s the storage system. But it didn't
> work. Meanwhile at the radar establishment, TRE, the top electronic
> engineers had found themselves suddenly out of a job in August 1945.
> F. C. Williams looked around for a leading-edge project. He soon
> heard that the possibility of bu
l computers for Siemens.
ENIAC was completed on 15th February 1946, but it was basically a
Numeric Integrator, a very very good one, but was barely programmable.
I have recently learnt that at the end of 1948 a programme store was
added but this was not
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/si
real Mathematicians.
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 b
o remind
myself, it still hasn't been proved 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/~l
the Manchester Mark 1 aka the SSEM or the "Baby".
Some people believe that factoring numbers with lots of zeroes is superior to primality
checking lots of ones, but anyway Fermat numbers are merely Generalised Mersennes
with t
is
> such a perfect pun/whatever.
>
Actually that is very very 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 In
y I do not know of an accessible English Language good Maths
library near Nuremberg.
>
> Is this could be of any use in the search for large primes ?
>
Valid question.
The answer is probably "No", but it is a valid question.
21 matches
Mail list logo
