I am investigating 64-100 sequences, which are chains of bases such that the
number written 100 in each is written 64 in the next (e.g. 8,10,16,42). I
quickly wrote a Python program to compute them. It is now computing the
square of a 1555000 digit number and has been doing so since the 17th.
On Saturday 17 August 2002 03:22, Halliday, Ian wrote:
In http://msn.com.com/2100-1104-949170.html?type=pt we read
Crypto scientists crack prime problem
To create encryption keys, RSA uses two huge prime numbers and
multiplies them together to produce an even bigger prime.
The hard problem
I got a new laptop a few weeks ago. I promptly loaded Linux on it and ran
into hardware problems. I copied statically linked mprime to it and ran it;
it crashed in a few minutes. I sent it back.
The technician knows nothing about Linux. He loaded Windows and ran some
test, which found
I have a new laptop which has some problems. First I ran tartest (a program I
wrote which repeatedly untars the kernel source and compares the results) and
found that one memory module is bad and the other is good. Next I found that
when it compiles Linux, the result doesn't work. So I copied
I was running mprime 21.4.2 under Linux 2.4.3 for many months with no
problem. I just rebooted into 2.4.8 (both are stock kernels from Mandrake)
and mprime segfaulted. I ran gdb on it and got the following:
[root@littlecat mersenne]# gdb
GNU gdb 4.17.0.4 with Linux/x86 hardware watchpoint and
On Sat, 09 Jun 2001, vincent mooney wrote:
I'd guess that sales of UPS's are on the upswing.
So how will that affect FedEx?
phma
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ --
On Sun, 25 Mar 2001, John R Pierce wrote:
Hmm ... my comp has NO idle time anymore (8
even with prime95 running 24/7 on my Windows2000 system, it seems to come up
with a FEW idle cycles. I figure its when prime95 gets paged out or
something. I rebooted a couple of hours ago after photoshop
On Sun, 25 Mar 2001, Jeff Woods wrote:
At 10:03 AM 3/25/01 -0500, you wrote:
even with prime95 running 24/7 on my Windows2000 system, it seems to come up
with a FEW idle cycles. I figure its when prime95 gets paged out or
How does idle time accrue *to a process*? Idle time is when the CPU is
On Sun, 07 Jan 2001, Russel Brooks wrote:
http://www.nashuatelegraph.com/Main.asp?UID=35947505SectionID=30SubSectionID=90ArticleID=23815
While I am the geek brother mentioned in the article I make no claim as
to the accuracy of the article.
What does "factor pi" mean?
phma
On Tue, 28 Nov 2000, Nathan Russell wrote:
However, the question we must consider is whether saving space in a
1-meg executable is worth the extra trouble for all concerned, as well
as using a non-standard compression format.
If you want to keep stuff compressed on your disk, use the e2compr
There are hard internal modems. Look at the instructions on how to install it
for Linux. It may say that you just make a symbolic link /dev/modem to an
existing device, or it may have you make a device /dev/ttyS4 and run setserial
on it, and still be a hardware modem. But if you have to install a
Anyone know what happened to Conrad Curry? His page has been saying for months
that 2,679- is 40% sieved, but when I tried to get another range to sieve, the
script appears to have run out of ranges.
phma
_
Unsubscribe list
I sort of doubt it. The whole GIMPS project is oriented to techie types.
Types who like to stay current with the latest technology and would upgrade
their browsers frequently. Also add in the fact that Internet Explorer, last
I heard, is gaining popularity and that IE4 and IE5 support PNGs
I understand. I didn't think at Prime95 so much using the bus (in fact, in
Paris the Metro is far more convenient).
But you wouldn't want it searching all the arrondissements for primes, as then
it would go at a snail's pace.
phma
A question to all you linux users with modems: I assume that the
/proc/net/route file exists when you are not connected. Let me know
if this is not the case (I'll need to change the default setting of
RouteRequired above).
I have a modem and an Ethernet card on one box. The file exists
M(17) is the number of people that could fit into a /very/ large open arena
or stadium.
What stadium is that big? The one at Urbana seats only about 2.
phma
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
So my question to the sysadmins out there is: what's the best way to avoid
this sort of thing, without installing a firewall and while still permitting
ftp access?
In re-reading the DEC Unix manpage for ftpd, it seems to me the weakest
link is the guideline for the ~ftp/pub directory, which the
On Fri, 11 Feb 2000, Paul Landon wrote:
May I exclusively reserve the topic of "poaching"? ;-)
I will release it in 60 days. (unless it is completed by
someone else before then).
I think we should forge ahead. The hunter poached eggs and the blacksmith
forged checks.
phma
If we left shift this by the position of the 1, for each 1 in the binary
representation, and add them together, we should get the square... So to
square 14, we do this:
1110 3 == 111 +
1110 2 == 0111000 +
1110 1 == 0011100 +
== 11000100 which is 196
So for
This led to a discussion as to whether or not it is possible to have a number
system based on a non-integer base. Maybe the great minds of GIMPS
can contribute to this.
Base phi is easy to compute in. The similar Fibonacci representation counts the
integers as follows:
On Thu, 03 Feb 2000, [EMAIL PROTECTED] wrote:
If smooth numbers are ones whose prime factors are all small,
what then are hairy numbers? Is there an official definition?
"And Jacob said to Rebekah his mother, Behold, Esau my
brother is a hairy man, and I am a smooth man:" (Gen. 27:11)
Also,
However, I assume that it will be possible to specify (change) what
hours are the
ON hours. I suppose that midnight to 06:00 would be fine for most
people, as a
default.
This probably depends on your distro. Red Hat and Mandrake run their crontabs
between 4 and 5 in the morning, so that hour may
If I pick a huge number n at random, how much smaller than n, on average, is
its largest prime factor?
phma
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ --
On Thu, 13 Jan 2000, gregory czajkowski wrote:
Hello All,
I've been involved in GIMPS for about 2.5 years now, several machines,
OSes. Recently I installed prime95 on a IBM Intellistation Dual uproc.
It seems my combination of soundcard+headphones is VERY sensitive
since when I'm running 1/2
On Sun, 26 Dec 1999, Kevin Sexton wrote:
I have prime95 running on win95, and have set up mandrake,
and I want mprime to continue the work, right now, linux is
only run a minority of the time, and I haven't set up a
compatible modem, but this will change. I am new to linux,
and so I don't know
I'd like to upgrade mprime, and I see it's linked with glibc 2.1. I have glibc
2.0.7. Will it work? I'm currently running 18.1.
phma
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ --
http://www.dallasnews.com/technology/1202ptech9pcs.htm
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Anybody care to port bash to Windows? (Oh well, it has probably been
done already...)
It has been done, and you need only operate swans.
phma
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ
On Tue, 26 Oct 1999, Alexander Kruppa wrote:
Hello all,
a simple Number Theory question. Is always
(2^p-1) / p ,odd prime p, divisible by 3 ?
I assume you mean truncated integer division, as real division makes no sense
here.
It isn't if p=3 (7/3=2), but 2^p-2 is divisible by 3. (2^n) mod 3
Secondly, I used to feed the output to a virtual terminal, but decided that
having a hard copy that I could periodically check was better. I've been
piping all the output to a file, such as mprime -d
/home/GIMPS/tracking.txt. When it finishes reporting a result, I delete
everything but the
When did using 10-byte reals become common? As far as I remember, you
don't even have a store instruction for that. The 80-bit load is slower
than the 64-bit load too, I think.
Win32Forth can be compiled either way. Here's some of the code from FLOAT.F:
B/FLOAT 10 =
[IF]synonym FSIZE
On Thu, 16 Sep 1999, Steinar H. Gunderson wrote:
On Thu, Sep 16, 1999 at 01:06:04PM +0200, Harald Tveit Alvestrand wrote:
One version of Linux has paid the bill and passed the test, so at least one
version of Linux is Unix.
If you wanted to be picky, you could always say that a version of
And gas, taking the bloatedness to new heights, will require 8 bytes of
memory, 32 kB of hard disk space (making it impossible to compile Merced
code on a C64 -- the gas team has already issued a public apology for this)
and a toaster.
Gasp!
(No, I won't buy an assember. An assembLer, on the
On Thu, 05 Aug 1999, Arnold R. Hart wrote:
I have a laptop and can't seem to figure out how to run prime95 when the
laptop is plugged in, but not when it is operating on battery power. I'm
running MS Win'98. (release 2???) The powermanagement software will let
me start prime95 (18.1) when
- Long ago ;-) I made some investigations about the period of inverse of
prime numbers (1/p) (Is this good English ?).
I found an empiric relation between the number of digits of the period
(d) et the fact that p is prime, namely that d is a divisor of p-1. I
have been told that this was
(Off topic, when I computed that value in Landon's Calc program, my computer
PII/233 started making a weird humming noise. The noise stopped when the
calculation finished. Very strange indeed...)
I'm running Prime95 on a computer at the office, and it emits faint cricketish
noises from the
On Thu, 22 Jul 1999, Blosser, Jeremy wrote:
Just was thinking the other day about this... Forgive me if its been
discussed before etc.
Aren't there other "better" algorithms for finding the square of a number
besides using an FFT? Sure an FFT is great for multiplying two different
numbers,
What do you call someone who searches for primes only because of the prize
money?
A mersennary.
phma
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ --
I run sieve on a laptop, and I don't want to run the battery down with sieve
when it's not plugged in to the wall. So I wrote the following shell scripts,
which start it automatically, run it nicely, and suspend it when the battery is
low. You will have to have APM in your kernel to get anything
On Thu, 08 Jul 1999, Brian J. Beesley wrote:
On 8 Jul 99, at 6:19, Lucas Wiman wrote:
In the book _Primes and Programming_ Head's method of multiplying
two numbers mod n is mentioned. Is this actually more effiecient
than simply multiplying the two numbers and taking the modulus?
Limbs? It is good to know that the world has many different literal meanings
in many languages for "bits" - variety is good for us all. (The French word
for "buffer" is also, I seem to remember, rather amusing).
"Limb" is the term used in gmp for a digit in a large base (such as 2147483648)
But the fact is that the performance of my mounted hdd win98 (vfat)
partition is very low. All my normal linux (ext2) partitions work with
normal performance. If I execute a command like `ls -l /Win98` (/Win98
is the path of may win98 (vfat) partition) it takes more than a second
to get the
Most modern motherboards contain case and/or CPU temperature
sensors which can be read by software.
Is there a file in /proc that will tell me this?
phma
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
On Sun, 06 Jun 1999, [EMAIL PROTECTED] wrote:
I wouldn't recommend the " /dev/null" command. If you start it remotely,
the stdout and stderr usually (but not always) go to e-mail. This way you
can still see the output and not lose any critical messages...
I pipe the output to a program that
if ( $mersenne 5 ) then
Why 5? Isn't one enough? If there is more than one running, they'll just
compete with each other for the CPU, even though they're being nice to everyone
else.
phma
Unsubscribe list info --
The type you're looking for is not text/html but multipart/alternative. If it's
multipart/mixed, that means there's an attachment. If the MIME type of the
message were text/html, that would mean that it is just an HTML message with no
text alternative.
phma
The only way I can think of is having a script monitor the optional
STDOUT of mprime and then checking whether it needs to contact the
server.
I use the attached Tcl script to keep the last 25 lines of the output of mprime
in a file. You could put some commands in your crontab to check this
I don't quite see how this makes it unneccessary to check only iteration
numbers which are powers of 2. How long does it take to find a cycle
length of, say, 127 if you're sampling only powers of 2?
Let's say you have a cycle of length 127 beginning at 992. You keep 1, 2, ...
1024. When you
On Wed, 14 Apr 1999, Guillermo Ballester Valor wrote:
Hi to all:
Henrik Olsen wrote:
On Tue, 13 Apr 1999, Ernst W. Mayer wrote:
A bit off-topic, but I think there are enough Linux users out there
to justify it. Check out
You are right, I think. I am a new user of linux, then a
How about this?:
If mprime finds that it needs to update itself, it downloads the new files,
renames the old ones, renames the new ones, and quits at five 'til. One minute
past the hour, a cron job notices that mprime isn't running and restarts it.
phma
50 matches
Mail list logo
