Sorry, -d, not -m. I'm not that familiar with the command line arguments
of mprime. My expertise lies in the symantics of Linux.
One way to pipe to a virtual terminal AND to a file is by using a
combination of a tee and a redirect. Something like:
/usr/src/mprime -d | tee -a
If you want small exponents you better try to get them tonight and the
following days cause a lot of them are going be released again tonight...
I
skimmed through the assigned exponents list and counted about 20
exponents that are (almost) overdue... So be there when you want them...
I
Mersenne DigestSunday, October 24 1999Volume 01 : Number 651
--
Date: Thu, 21 Oct 1999 23:47:47 -0400 (EDT)
From: Chip Lynch [EMAIL PROTECTED]
Subject: Re: Mersenne: Re: Schlagobers, Louisville style
On
On Thu, Oct 21, 1999 at 03:38:59AM +0200, Lars Lindley wrote:
One more question. Can I by simple means redirect tty8 to an
xterm-session??
Try using a FIFO:
mknod /tmp/mprime-fifo p
./mprime -d /tmp/mprime-fifo
(in xterm)
tail -f /tmp/mprime-fifo
This won't help you redirect tty8 into an
On 24 Oct 99, at 15:55, Robert van der Peijl wrote:
[ ... snip ... ]
Show Number
Show me the last few digits of the
current Lucas number at each iteration.
This is distinctly non-trivial. The residue doesn't exist in a nice
form in work vectors in the program's memory, it has to be
On Sun, Oct 24, 1999 at 10:03:45PM +0100, Brian J. Beesley wrote:
Have you any idea of the amount of CPU time needed to convert a 10
million bit binary number to a 3 million digit decimal number?
Yes, but you don't need the entire number, do you? Collecting the
low 64 bits doesn't take _that_
On Thu, Oct 21, 1999 at 11:19:41PM -0400, Lucas Wiman wrote:
Though, pi is more useful than most rational numbers (with the
possible exceptions of 0,1/2,1,2).
I'd say 22/7 is about as useful as pi :-)
/* Steinar */
--
Homepage: http://members.xoom.com/sneeze/
Paul van Grieken asked on 21 Oct 1999 at 17:16 h
Why is there a difference in iteration time between the LL test and a
double test.
For the same FFT-size, the double checking code has to perform a bit
extra work per iteration:
it multiplies by 2 before the DWT, and divides by 4 afterward.
On 24 Oct 1999, at 23:03, Brian Beesley replied:
On 24 Oct 99, at 15:55, Robert van der Peijl wrote:
[ ... snip ... ]
Show Number
Show me the last few digits of the
current Lucas number at each iteration.
This is distinctly non-trivial. The residue doesn't exist in a nice
form
