Mersenne Digest Friday, April 28 2000 Volume 01 : Number 725 ---------------------------------------------------------------------- Date: Wed, 26 Apr 2000 22:11:58 -0400 From: George Woltman <[EMAIL PROTECTED]> Subject: Re: Mersenne: Priority double-checking Hi, At 01:39 AM 4/26/00 -0400, Nathan Russell wrote: >I recall reading about a priority queue for double-checking those >exponents whose original tester reported hardware errors. What I do is just re-issue them as first time tests. The last time I did this was roughly six months ago. I don't feel very guilty about this as there is about a 50% chance the first test was no good and these exponents probably take about half as much time as the big exponents now issued for first time testing. I'm not sure why the server has marked some exponents above 5.5M as available for double-checking. Regards, George _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Wed, 26 Apr 2000 22:19:28 -0400 From: George Woltman <[EMAIL PROTECTED]> Subject: Mersenne: last v20 beta Hi, Version 20.4 is available. If no bugs are reported in the next few days I'll make it the official release. You can download it from ftp://entropia.com/gimps/v20/p95setup.exe or ftp://entropia.com/gimps/v20/prime95.zip or ftp://entropia.com/gimps/v20/winnt.zip or ftp://entropia.com/gimps/v20/mprime.tgz or ftp://entropia.com/gimps/v20/sprime.tgz Note the availability of NT service version. The Linux code supports a new -B switch to run in background and a new algorithm to detect connection to the internet. The Windows version has this new: 1) If stage 2 of P-1 was postponed because of insufficient memory, the program did not restart stage 2 when nighttime started. This bug was fixed. 2) By default, PII-300's and faster get first-time LL tests, P-90 and faster get double-checking work, and all slower machines get factoring work. 3) An ECM bug during stage 2 init on huge exponents caused false ILLEGAL SUMOUT errors. This bug was fixed. Regards, George _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Wed, 26 Apr 2000 22:41:20 -0400 From: George Woltman <[EMAIL PROTECTED]> Subject: Mersenne: Java/javascript anyone? Hi, I sent this a few days ago, but it seems to have gotten lost... In my new benchmarking page I'd like to create a form that takes CPU type, CPU speed, and exponent and returns the estimated number of days to complete the exponent. I hope this will help newcomers understand how much effort is required before joining GIMPS. Can this be done in Javascript (both MSIE and Netscape)? Can it be done on the client side (i.e without a "Submit" button and CGI)? If so, would someone care to volunteer to write the necessary script using three or four lines from the http://www.mersenne.org/bench.htm table and I'll fill in the rest? Thanks, George _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Thu, 27 Apr 2000 00:50:41 EDT From: [EMAIL PROTECTED] Subject: Mersenne: Account ID << Bucephalus >> Someone has a great sense of humor. :-D Stephan Lavavej _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Thu, 27 Apr 2000 00:50:32 -0700 From: Kevin Sexton <[EMAIL PROTECTED]> Subject: Re: Mersenne: Java/javascript anyone? George Woltman wrote: > > Hi, > > I sent this a few days ago, but it seems to have gotten lost... > > In my new benchmarking page I'd like to create a form that > takes CPU type, CPU speed, and exponent and returns the estimated > number of days to complete the exponent. I hope this will help newcomers > understand how much effort is required before joining GIMPS. > Can this be done in Javascript (both MSIE and Netscape)? Can > it be done on the client side (i.e without a "Submit" button and CGI)? > If so, would someone care to volunteer to write the necessary script > using three or four lines from the http://www.mersenne.org/bench.htm > table and I'll fill in the rest? > > Thanks, > George > > _________________________________________________________________ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers One short question, I might be able to figure it out myself, but it's late, and I'm lazy right now, but how is the estimated time calculated? for example for a P-II 400 on a 7.73M to 9.02M exponent the timing is 0.252 How would the days be calculated? _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Thu, 27 Apr 2000 01:56:17 -0700 From: Stefan Struiker <[EMAIL PROTECTED]> Subject: Re: Mersenne: Java/javascript anyone? - --------------EC79A1D55BDD52D49E27FB85 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Kevin Sexton wrote: > George Woltman wrote: > > > > Hi, > > > > I sent this a few days ago, but it seems to have gotten lost... > > > > In my new benchmarking page I'd like to create a form that > > takes CPU type, CPU speed, and exponent and returns the estimated > > number of days to complete the exponent. I hope this will help newcomers > > understand how much effort is required before joining GIMPS. > > Can this be done in Javascript (both MSIE and Netscape)? Can > > it be done on the client side (i.e without a "Submit" button and CGI)? > > If so, would someone care to volunteer to write the necessary script > > using three or four lines from the http://www.mersenne.org/bench.htm > > table and I'll fill in the rest? > > > > Thanks, > > George > > > > _________________________________________________________________ > > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > > One short question, I might be able to figure it out myself, but it's > late, and I'm lazy right now, but how is the estimated time calculated? > for example for a > > P-II 400 on a 7.73M to 9.02M exponent the timing is 0.252 > > How would the days be calculated? > _________________________________________________________________ > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm > Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers I do these calculations ad nauseam like this: say 8M *.252 gives the total number of seconds (best case!). Then divide by 86400, the number of seconds on a day, and get 2016000 / 86400 = 23.33333 days. Now calculate CPU hours per day (homework) :-) Unless, of course, I'm even more tired than you are.... Selah! Stefanovic - --------------EC79A1D55BDD52D49E27FB85 Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit <!doctype html public "-//w3c//dtd html 4.0 transitional//en"> <html> <p>Kevin Sexton wrote: <blockquote TYPE=CITE>George Woltman wrote: <br>> <br>> Hi, <br>> <br>> I sent this a few days ago, but it seems to have gotten lost... <br>> <br>> In my new benchmarking page I'd like to create a form that <br>> takes CPU type, CPU speed, and exponent and returns the estimated <br>> number of days to complete the exponent. I hope this will help newcomers <br>> understand how much effort is required before joining GIMPS. <br>> Can this be done in Javascript (both MSIE and Netscape)? Can <br>> it be done on the client side (i.e without a "Submit" button and CGI)? <br>> If so, would someone care to volunteer to write the necessary script <br>> using three or four lines from the <a href="http://www.mersenne.org/bench.htm">http://www.mersenne.org/bench.htm</a> <br>> table and I'll fill in the rest? <br>> <br>> Thanks, <br>> George <br>> <br>> _________________________________________________________________ <br>> Unsubscribe & list info -- <a href="http://www.scruz.net/~luke/signup.htm">http://www.scruz.net/~luke/signup.htm</a> <br>> Mersenne Prime FAQ -- <a href="http://www.tasam.com/~lrwiman/FAQ-mers">http://www.tasam.com/~lrwiman/FAQ-mers</a> <p>One short question, I might be able to figure it out myself, but it's <br>late, and I'm lazy right now, but how is the estimated time calculated? <br>for example for a <p>P-II 400 on a 7.73M to 9.02M exponent the timing is 0.252 <p>How would the days be calculated? <br>_________________________________________________________________ <br>Unsubscribe & list info -- <a href="http://www.scruz.net/~luke/signup.htm">http://www.scruz.net/~luke/signup.htm</a> <br>Mersenne Prime FAQ -- <a href="http://www.tasam.com/~lrwiman/FAQ-mers">http://www.tasam.com/~lrwiman/FAQ-mers</a></blockquote> I do these calculations <i>ad nauseam </i>like this: say 8M *.252 gives the total number of seconds (best case!). <br>Then divide by 86400, the number of seconds on a day, and get 2016000 / 86400 = 23.33333 <br>days. Now calculate CPU hours per day (homework) :-) <p>Unless, of course, I'm even more tired than you are.... <p>Selah! <br>Stefanovic</html> - --------------EC79A1D55BDD52D49E27FB85-- _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Thu, 27 Apr 2000 12:32:47 EDT From: [EMAIL PROTECTED] Subject: Re: Mersenne: Java/javascript anyone? That's correct in calculations. That's how I calculated my own time, independent of the computer. Since it said it was going at 1.75 seconds per iteration, and there were 9025267 iterations to go, I just multiplied 1.75 by 9025267, and rounded high (knowing I'd be stopping every now and then), and used my TI-85 to turn that into days. That just divides the number by 86400. So it said I had to take 182.8034222 More days till the end. Finally, considering that the whole thing started March 10th, I went to the calendar, and counted out 183 days. I think that you can calculate that, in Java. Anyway, my calculations said that I'd be done some time around September the eleventh. Of course, I wanted to know when, so I took 182.8034222, and took the whole think mod 1, giving the fraction .8034222, which I converted back to hours, by multiplying by 24, giving 19.27733333. so, it would be 19 hours from when I started, that being the basis of my calculation. This I took mod 1, giving .27733333 which I multiplied by 60, to give the number of minutes, giving 16.4 , so I knew there would be 16 minutes. This I also took mod 1, giving .4, which I multiplied by 60, giving 24 seconds from when I started. PS I also started learning Java a little bit ago, and I may be able to help, but not until summer. Marko Man _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Thu, 27 Apr 2000 14:51:59 -0700 From: Eric Hahn <[EMAIL PROTECTED]> Subject: Re: Mersenne: Java/javascript anyone? George Woltman wrote: > In my new benchmarking page I'd like to create a form that >takes CPU type, CPU speed, and exponent and returns the estimated >number of days to complete the exponent. I hope this will help >newcomers understand how much effort is required before joining >GIMPS. > Can this be done in Javascript (both MSIE and Netscape)? >Can it be done on the client side (i.e without a "Submit" button >and CGI)? >If so, would someone care to volunteer to write the necessary script >using three or four lines from the http://www.mersenne.org/bench.htm >table and I'll fill in the rest? George, I've come up with a dynamic javascript form for the purpose. It needs a little more work to be done. I'm converting the numerous 'if' statements into an array lookup, and making it calculate out more than just days... I should have it fixed up within two or three days.... I'll send it to you when it's finished to your opinion at that time! Eric _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Thu, 27 Apr 2000 18:26:23 -0400 From: Nick Glover <[EMAIL PROTECTED]> Subject: Re: Mersenne: Java/javascript anyone? Yes, this can definitely be done in JavaScript that works in both IE and Netscape. I am willing to write the code, but I won't have time until about May 5th or so because I have exams and that type of stuff occupying my time for the next week. At 22:41 26/04/00 -0400, you wrote: >Hi, > > I sent this a few days ago, but it seems to have gotten lost... > > In my new benchmarking page I'd like to create a form that >takes CPU type, CPU speed, and exponent and returns the estimated >number of days to complete the exponent. I hope this will help newcomers >understand how much effort is required before joining GIMPS. > Can this be done in Javascript (both MSIE and Netscape)? Can >it be done on the client side (i.e without a "Submit" button and CGI)? >If so, would someone care to volunteer to write the necessary script >using three or four lines from the http://www.mersenne.org/bench.htm >table and I'll fill in the rest? > >Thanks, >George > >_________________________________________________________________ >Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm >Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers > > Nick Glover: [EMAIL PROTECTED] ICQ UIN: 3463696 Computer Science, Clemson University Homepage: http://hubcap.clemson.edu/~nglover/ "It's good to be open-minded, but not so open that your brains fall out." - Jacob Needleman _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Fri, 28 Apr 2000 12:29:22 +0200 From: "Hoogendoorn, Sander" <[EMAIL PROTECTED]> Subject: Mersenne: ILLEGAL SUMOUT Hi, Finally i've got them, the illegal sumout error. I'm 100% sure it's a software error, 'cause the are reproducable when playing F1 2000. Anyone else this problem? Are the caused by the game, or by the new direct x version I installed (7a i believe) or do i have a driver problem? _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ Date: Fri, 28 Apr 2000 22:19:04 EDT From: [EMAIL PROTECTED] Subject: Mersenne: Mersenne Silliness OK, now here something that's really interesting. Start with 1. Add 2. Then add 3. Keep going till you reach a Mersenne prime. The result is always a perfect number. Now I know you're all going to say this is because the formula for summing to a number is .5(n)(n+1), and that if you substitute (2^p)-1 for n you get .5((2^p)-1)(2^p), which is simplified to ((2^p)-1)(2^(p-1)). What I thought was interesting was the fact that all the numbers up to a Mersenne prime equal the sum of the powers of 2 before that Mersenne, plus that Mersenne, plus all those powers of two (except 2^p) times the Mersenne. It's kind of interesting to the layman, but computationally useless, since if you start with a composite, then you'll get a number that seems large, but it's not perfect. So, you'll get a whole list of wannabe perfects : - D _________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers ------------------------------ End of Mersenne Digest V1 #725 ******************************
