RE: Mersenne: Re: Changing Prime95's name
A rose by any other name smells the same. -Original Message- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] On Behalf Of Barry Hansen Sent: Sunday, August 25, 2002 2:35 PM To: '[EMAIL PROTECTED]' Subject: Mersenne: Re: Changing Prime95's name Briefly Brian Beesley began: Therefore the logical new name would be either WinPrime or Prime32. I'm definitely strongly _against_ change for the sake of change, particularly if the object is simply to track the latest fashion emanting from Redmond WA. In another 7 years, chances are Joe Public won't find XP any more relevant than 95. I think people are on the right track here... avoid names using the fad of the day, and pick something brief with just enough meaning to make it easy to remember. I don't really care what it's called as long as it generally follows this guideline. In fact my PrimeXP suggestion was tongue-in-cheek, since the eXtreme Programming moniker is just a clever marketing scheme for consultants to sell more books and make money. Our team has been doing XP for a year and there are some good things in it, but I'm still not sure why collecting several existing programming techniques together and emphasizing certain attributes has caused it to deserve a catchy new name. Oh well, at least it's recognizable. :-) Cheers, Barry PS - I don't seem to recall that someone *asked* for a vote on a new program name. Just think how much activity we'd see if George really wanted some opinions! :-) PPS - I sure hope to talk about this again in 93 years. _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Fw: [PrimeNumbers] AMD vs. Intel Floating Point
- Original Message - From: Milton Brown [EMAIL PROTECTED] To: [EMAIL PROTECTED] Cc: Milton Brown [EMAIL PROTECTED] Sent: Friday, June 22, 2001 7:36 AM Subject: [PrimeNumbers] AMD vs. Intel Floating Point The prime number group, might be interested in these timings. Milton L. Brown - Original Message - From: Jens-Peer Kuska [EMAIL PROTECTED] To: [EMAIL PROTECTED] Sent: Thursday, June 21, 2001 11:20 PM Subject: [mg29486] Re: AMD vs. Intel Floating Point Hi, a) the Mathematica speed comparsion from http://fampm201.tu-graz.ac.at/karl/timings40.html is posted regular in this news group b) on the www-site of *this* news group http://smc.vnet.net/mathgroup.html the second head line is a link to various speed comparsions found at http://smc.vnet.net/mathbench.html and it is quite natural to assume, that a poster to a news-group has visited the newsgroup hompage and is able to read and understand the headings on a page that begins with: --- Designed by S. Christensen. MathGroup The Email Group for Mathematica Users Comparison of Mathematica on Various Computers ~ MathGroup is now linked to the moderated newsgroup comp.soft-sys.math.mathematica on the Internet. Contact your local system administrator to find out how to read this new group. --- *and* it is quite natural to assume that a poster to the news group has read the group rules (on the same page) one of it say: PLEASE SEARCH THE ARCHIVES BEFORE YOU ASK WHAT MIGHT BE A COMMON QUESTION. See the links above for this. It must be also sayed, that the Mathematica speed depends in the most (symbolic) applications not on the floating point power of the CPU. The most actions performed by Mathematica are pointer operations with it's internal data structures. I would assume that 80-90 % of Mathematica's CPU load are pure interger operations. High precision calculations, symbolic operations, operations with integers, rationals ... all that don't use the floating point hardware. It depends shaply on the application how much floating point operations are used. But when a Mathematica function has such a huge floating point load it is always better to write a MathLink program. Regards Jens Morfeas79a wrote: Kofi as it is well known the AMD processors up untill the model of K6-3D have serious problems in their floating point operations - this can be observed by running programs with great CPU load like SETI@home, the time for a AMD computer to finish one work unit is about twice as big as this in an Intel computer running on the same MHz. The problem has been solved in later models. Of course all this is not known to Mr.Kuska who thinks that 90% of the questions sent in this newsgroup are of trivial nature or in anycase foolish. Regards Jim Unsubscribe by an email to: [EMAIL PROTECTED] The Prime Pages : http://www.primepages.org Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: VB primality test program
Perhaps you could interface your VB code with Microsoft C or C++, to be faster. Milton L. Brown [EMAIL PROTECTED] Monte Westlund wrote: On Mon, 12 Mar 2001 22:12:54 -0800, you wrote: I'm afraid VB would be awfully slow at any sort of intensive numerical work like this, and not very good with precision either, so I rather doubt anyone has spent any signficant time on anything much more sophisticated than a erathonese sieve program -jrp I know VB would not be the first choice. It's more for benchmarking some machines(Prime95 is not an option on them), and to explore a bit. Monte _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Re: Mersenne: Re: GIMPS in the News
This article seems to have its "facts" all wrong. Its use of mersenne primes makes no sense. The author should print a revised article that is correct and reviewed. Francois Gouget wrote: On Mon, 8 Jan 2001, Jeramy Ross wrote: > > > On Sun, 07 Jan 2001, Russel Brooks wrote: > > > >http://www.nashuatelegraph.com/Main.asp?UID=35947505SectionID=30SubSectio > nID=90ArticleID=23815 > > > > > >While I am the geek brother mentioned in the article I make no claim as > > >to the accuracy of the article. > > Then on Sun, 07 Jan 2001, Pierre Abbat wrote: > > What does "factor pi" mean? > > This is probably a reference to the PiHex project which computed Pi to > the Quadrillionth digit (I think..). The project is finished but I believe Note that the above (and the article) is incorrect/misleading. AFAIK the PiHex project did not compute Pi *to* the Quadrillionth digit. They computed *the* quadrillionth *bit* of Pi (using some standard probably fixed point representation I assume). I assume this is made clear on their site (which I have not read in recent times). So now we know the first few million decimal digits of Pi (and thus about three times as many bits) and then a few isolated bits calculated by PiHex: the five trillionth bit, the forty trillionth bit, and the quadrillionth bit. (went to their site after all) -- Francois Gouget [EMAIL PROTECTED] http://fgouget.free.fr/ Avoid the Gates of Hell - use Linux. _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Mersenne: Fw: Binary to Decimal Conversion
- Original Message -
From: Milton
Brown
To: [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Saturday, April 03, 1999 11:51 AM
Subject: Binary to Decimal Conversion
Attached is a Pascal Program that will convert a
Binary Number
of any length (currently 250 digits) to its Decimal
Form. It does
this by a "Decimal Search" on the high order
digits. This is similar
to a "Binary Search". If you want the executable
program, just
e-mail me at [EMAIL PROTECTED].
Milton L. Brown
PROGRAM Binary;
{ By Milton L. Brown 3-15-1999
[EMAIL PROTECTED]
Converts a Binary Number of any length to a Decimal Number
-
Uses a "Decimal Search" on high order digits, similar to
a Binary Search.
Example Output:
Enter binary number here : 11101011000110100010101
1 2345 6789
}
LABEL line1, line2;
TYPE
iarray = array[1..1000] of integer;
MaxStg = string[250];
VAR st1, st2 : MaxStg;
r1, q1, twos : integer;
VAR a, b, len1 : integer;
i, j, k, out, carry, carry2 : integer;
a1, b1, c1, d1, e1, binary, answer : iarray;
log2 : real;
binary_d, number_d, jj, kk, current : integer;
FUNCTION chardig( k : CHAR) : INTEGER;
BEGIN chardig := ORD( k ) - 48 END;
PROCEDURE digit1( k : MaxStg; var a : iarray );
VAR i: INTEGER; BEGIN
FOR i:= 1 TO length(k) DO a[length(k)-i+1] := chardig(k[i]) END;
PROCEDURE initial; BEGIN
carry := 0; out := 0;
FOR i:= 1 TO 1000 DO a1[i] := 0;
FOR i:= 1 TO 1000 DO b1[i] := 0;
FOR i:= 1 TO 1000 DO c1[i] := 0;
FOR i:= 1 TO 1000 DO d1[i] := 0;
FOR i:= 1 TO 1000 DO binary[i] := 0;
END;
procedure clear; BEGIN FOR i:= 1 to 1000 DO answer[i] := 0; END;
PROCEDURE REMAIN(a1: iarray; var r1 : integer; var b1 : iarray); BEGIN
r1 := 0; j := 1;
FOR i:= len1 DOWNTO 1 DO BEGIN
twos := r1*10 + a1[i];
q1:= trunc(twos/2);
b1[i] := q1;
r1:= twos - 2*q1;
END;
END;
FUNCTION compare2(c1, binary : iarray):integer;
LABEL lend;
BEGIN
FOR i:= (4*len1) downto 1 do BEGIN
if c1[i] binary[i] then begin compare2 := 1; goto lend; end;
if c1[i] binary[i] then begin compare2 := -1; goto lend; end;
END;
compare2 := 0;
lend :
END;
PROCEDURE convert2(a1:iarray;VAR c1:iarray);
VAR carry1, carry2, in1, out : INTEGER; BEGIN
FOR k := 1 TO (4*len1) DO BEGIN
remain(a1,r1,b1);
c1[k] := r1;
FOR i:= 1 TO len1 DO a1[i] := b1[i];
END;
END;
BEGIN
log2 := 0.3010299957;
line1: initial;
WRITE('Enter binary number here : '); READLN(st1);
binary_d := length(st1);
number_d := trunc(log2*binary_d) + 1;
writeln(binary_d,' ',number_d);
digit1(st1,binary);
clear;
current := number_d;
len1 := number_d;
jj := number_d;
len1 := jj;
line2:
FOR kk := 1 to 10 do BEGIN
answer[jj] := kk;
convert2(answer,c1);
if compare2(c1,binary) = 1 then begin
answer[jj] := kk-1;
jj := jj-1;
goto line2;
END;
END;
writeln(st1);
FOR i:= len1 DOWNTO 1 DO BEGIN
IF (i MOD 4) = 0 THEN write(' ');
WRITE(answer[i]);
END;writeln;
GOTO line1;
END.
