21. The 32nd Mersenne Prime By David Slowinski - Project Gutenberg Start here to download the Project Gutenberg eBook of The 32nd Mersenne Prime byDavid Slowinski. http://www.gutenberg.org/etext/69

Project Gutenberg Online Book Catalog Quick Search Author: Title Word(s): EText-No.: Advanced Search Recent Books Top 100 Offline Catalogs ... In Depth Information The 32nd Mersenne Prime by David Slowinski Read online Help on this page New Search Bibliographic Record Creator Slowinski, David Title The 32nd Mersenne Prime Predicted by Mersenne Note Math Language English LoC Class QA: Science: Mathematics Subject Numbers, Prime Subject Number theory EText-No. Release Date No Formats Available For Download Edition Format Encoding ¹ Compression Size Download Links ² Plain text none 241 KB main site mirror sites Plain text zip 121 KB main site mirror sites ¹ If you need a special character set, try our online recoding service ² If you are located outside the U.S. you may want to download from a mirror site located near you to improve performance. Click on mirror sites to select a mirror site. If you have P2P software installed that understands magnetlinks click on Most recently updated: 2005-09-08 07:15:23

22. Titan Biographies: David Slowinski Welcome to the Prover Database for the List of Largest Known Primes. These pagescontain a collection of records, resources and results all related to prime http://primes.utm.edu/bios/page.php?lastname=Slowinski

23. A Prime Of Record Size! 2^1257787-1 clever program, said David Slowinski, a Cray Research computer scientist.Slowinski and fellow Cray Research computer scientist Paul Gage developed the http://primes.utm.edu/notes/1257787.html

A Prime of Record Size! 2 (Another of the Prime Pages ' resources) Home Search Site Largest The 5000 ... Submit primes This is no longer the largest known prime. Click here for information on and new records. On 3 September 1996 Cray Research announced that once again Slowinski and Gage have set a new record by finding the prime which has 378,632 digits. This is the largest known prime by farthe next largest has "only" 258,716 digits. It is also the 34th Mersenne prime to be discovered (though it might not be the 34th in order of size as the entire region below it has not been checked). Looking at the graph of the largest known prime by year, we see this prime is roughly the size record we'd expect to find this year. The proof of this 378,632 digit number's primality (using the traditional Lucas-Lehmer test ) took about 6 hours on one CPU of a CRAY T94 super computer. Richard Crandall and others independently verified the primality. The first and the most interesting of these was George Woltman who was 90% of the way through that very number when asked to check the result on April 15th. According to the San Jose Mercury News

24. Category:Mathematician Stubs - Wikipedia, The Free Encyclopedia David Masser David Slowinski David van Dantzig Delfino Codazzi Derek Taunt Dicaearchus Diederik Korteweg Dilly Knox Diocles (mathematician) http://en.wikipedia.org/wiki/Category:Mathematician_stubs

Category:Mathematician stubs From Wikipedia, the free encyclopedia. This category is for stub articles relating to biographies of mathematicians . You can help Wikipedia by expanding them. To add an article to this category, use mathbiostub instead of Contents: Top A B C ... Z (previous 200) ( next 200 Articles in category "Mathematician stubs" There are 200 articles in this category. A A. A. Krishnaswami Ayyangar A. S. Troelstra A.W.F. Edwards Abraham Gotthelf K¤stner ... Arnold Sch¶nhage A cont. Arthur Geoffrey Walker Arthur Moritz Sch¶nflies Arthur Wieferich Arvid Gerhard Damm ... Autolycus of Pitane B Barry Mazur Bart Preneel Bartel Leendert van der Waerden Benedetto Castelli ... B©la Bollob¡s C Cahit Arf Carl Gustav Axel Harnack Carl Hindenburg Carl Ludwig Siegel ... Czesław Ryll-Nardzewski D D. D. Wall D. R. Fulkerson D cont. D. R. Kaprekar Dag Prawitz Daina Taimina Damiaem J. van Doorninck ... D©nes K¶nig E E. Fauquembergue E. H. Moore E. M. Wright Edmond Laguerre ... Erwin Kreyszig Retrieved from " http://en.wikipedia.org/wiki/Category:Mathematician_stubs Categories Stub categories Mathematicians ... Scientist stubs Views Category Discussion Edit this page History Personal tools Create account / log in Navigation Main Page Community portal Current events Recent changes ... Donations Search Toolbox What links here Related changes Upload file Special pages ... Permanent link This page was last modified 11:50, 20 July 2005.

25. Science & Technology > Mathematics > All Formats > Page 1 By David Slowinski Format Adobe Reader Availability Email Delivery 12 BusinessDays Platforms Windows Computers, Mac, Linux, more Learn more http://www.ebookmall.com/all-ebooks/group-206-all-ebooks-page1.htm

Mathematics All Formats eBooks Pages: 1300 Math Formulas By: Alex Svirin Format: Adobe Reader Availability: Download Now Platforms: Windows Computers, Mac, Linux, more... Price: $12.90 32nd Mersenne Prime By: David Slowinski Format: Adobe Reader Availability: Email Delivery 1-2 Business Days Platforms: Windows Computers, Mac, Linux, more... Price: $7.95 32nd Mersenne Prime By: David Slowinski Format: Gemstar/Rocket eBook Availability: Email Delivery 1-2 Business Days Platforms: Gemstar eBook RCA REB 1100, Rocket eBook Price: $7.95 32nd Mersenne Prime By: David Slowinski Format: hiebook Availability: Email Delivery 1-2 Business Days Platforms: hiebook device Price: $7.95 32nd Mersenne Prime By: David Slowinski Format: HTML Availability: Email Delivery 1-2 Business Days Platforms: Windows, Tablet PC, Windows CE, Macintosh, Linux, Unix. Price: $4.95 32nd Mersenne Prime By: David Slowinski Format: Mobipocket Availability: Email Delivery 1-2 Business Days Platforms: Any PDA - Palm OS, Windows CE, Pocket PC, eBookMan, EPOC Price: $5.95 32nd Mersenne Prime By: David Slowinski Format: Microsoft Reader Availability: Email Delivery 1-2 Business Days Platforms: Windows 98 or higher Desktop and Laptop Computers, Tablet PC, and all Pocket PC's.

26. Science & Technology > Mathematics > Microsoft Reader > Page 1 By David Slowinski Format Microsoft Reader Availability Email Delivery 12Business Days Platforms Windows 98 or higher Desktop and Laptop Computers, http://www.ebookmall.com/microsoftreader/group-206-microsoft-reader-ebooks-page1

Mathematics Microsoft Reader eBooks 32nd Mersenne Prime By: David Slowinski Format: Microsoft Reader Availability: Email Delivery 1-2 Business Days Platforms: Windows 98 or higher Desktop and Laptop Computers, Tablet PC, and all Pocket PC's. Price: $7.95 Adults' Mathematical Thinking and Emotions By: Jeff Evans Format: Microsoft Reader Availability: Download Now Platforms: Windows 98 or higher Desktop and Laptop Computers, Tablet PC, and Pocket PC 2002. Price: $31.95 Atmosphere, Weather and Climate By: Roger Barry Format: Microsoft Reader Availability: Download Now Platforms: Windows 98 or higher Desktop and Laptop Computers, Tablet PC, Pocket PC 2002 Price: $147.57 Atmosphere, Weather and Climate By: Roger G. Barry Format: Microsoft Reader Availability: Download Now Platforms: Windows 98 or higher Desktop and Laptop Computers, Tablet PC, Pocket PC 2002 Price: $61.66 Calculus with Complex Numbers By: John B. Reade Format: Microsoft Reader Availability: Download Now Platforms: Windows 98 or higher Desktop and Laptop Computers, Tablet PC, Pocket PC 2002 Price: $33.48

27. S Sacks, David Jan93 (Clinical). 5005 River Road. Bethesda, MD 20816. (301) 986-8889 Slowinski, Julian May-77 (Clinical). 239-C Hutchinson Street http://gsappweb.rutgers.edu/Alumni/Directory/Directory_S.htm

Saad, Zipora May-83 (School) R N/A Languages spoken: Hebrew Areas of Specialty: Sabatini, Sandra May-87 (Clinical) 14 Falling Waters Oakland, NJ 07436 Office same as home Fax: Email Address: drsabatini@aol.com Job Title: Clinical Psychologist Licensed: NJ Preferred contact: either Areas of Specialty: Sacks, David Jan-93 (Clinical) 5005 River Road Bethesda, MD 20816 Office : D.C. Department of Mental Health 2700 Martin Luther King Jr. Ave., S.E. Washington, DC 20032 Fax: Office: Private Practice The Highland House 5480 Wisconsin Avenue, Suite LL8 Chevy Chase, MD 20816 Email Address: dsacks@prodigy.net Job Title: Supervisory Clinical Psychologist Licensed: MD; DC Languages spoken: Portuguese, Spanish Preferred contact: home Areas of Specialty: Salvador, Carole May-82 (School) Office Affiliates in Psychology and Education 882-A1 Pompton Avenue Cedar Grove, NJ 07009 Fax: Email Address: csalv@att.net Job Title: Consulting Psychologist Licensed: NJ Preferred contact: either Areas of Specialty: Salvador, Diana

28. Large Prime Numbers The discovery team David Slowinski left, CRAY T94 center ) Paul Gage Slowinski said the recent CRAY T90 series supercomputer test in which http://www.isthe.com/chongo/tech/math/prime/prime_press.html

Large Prime Number Found by SGI/Cray Supercomputer Now serving text by: Landon Curt Noll Note: This is no longer the largest known prime The largest known prime number may be found in chongo's table of Mersenne Prime Digits and Names <== try me A Large Prime Number A Large Perfect Number The discovery team: David Slowinski ... : right EAGAN, Minn., September 3, 1996 Computer scientists at SGI 's former Cray Research unit, have discovered a large prime number while conducting tests on a CRAY T90 series supercomputer. The prime number has 378,632 digits. Printed in newspaper-sized type, the number would fill approximately 12 newspaper pages. In mathematical notation, the new prime number is expressed as , which denotes two, multiplied by itself 1,257,787 times, minus one. Numbers expressed in this form are called Mersenne prime numbers after Marin Mersenne, a 17th century French monk who spent years searching for prime numbers of this type. See Chris Callwell's prime page for more information on prime numbers. Prime numbers can be divided evenly only by themselves and one. Examples include 2, 3, 5, 7, 11 and so on. The Greek mathematician

29. SAVEgateway Document Delivery said David Slowinski, the other codiscoverer of the latest record number.Using a Cray T94 supercomputer, Slowinski and Gage found what is currently http://www.isthe.com/chongo/tech/math/prime/mercnews.html

Note: This is no longer the largest known prime The largest known prime number may be found in chongo's table of Mersenne Prime Digits and Names CRUNCHING NUMBERS RESEARCHERS MAKE PRIME MATH DISCOVERY Published: Tuesday, September 3, 1996 Section: Front Page: 1A BY DAN GILLMOR, Mercury News Computing Editor When the British mountaineer George Leigh Mallory was asked why he wanted to scale Mount Everest, he replied: ''Because it's there.'' A related urge sparks computer scientists at Silicon Graphics Inc.'s Cray Research unit, who will announce today that they've discovered the world's largest-known prime number - and a special kind of prime number at that. This one is 378,632 digits long, roughly 120 single-spaced typewritten pages - and ''a rare jewel,'' said co-discoverer Paul Gage. But the way they found it, using sophisticated programming on high-powered supercomputers, goes well beyond mathematical mountain climbing. The techniques help create and test computer systems that in turn help solve real-world problems such as cryptography, improving weather forecasts and designing safer cars, said David Slowinski, the other co-discoverer of the latest record number. Using a Cray T94 supercomputer, Slowinski and Gage found what is currently the biggest example of a Mersenne prime number, named after a 17th-century French monk, Father Marin Mersenne, who had a thing for numbers. A prime number is an integer greater than zero whose divisors are only itself and 1. (The number 2 is prime because it can only be divided evenly by 1 and 2, for example). Mersenne numbers are primes that take the form 2 to some power, minus 1 - in other words, 2 multiplied by itself a certain number of times with 1 subtracted from the result.

30. Mersenne Primes -- From Harry J. Smith 1979 Landon Curt Noll (Cyber 174) 27 44497 13395 26790 1979 David Slowinski Harry L. Nelson (Cray 1) 28 86243 25962 51924 1982 David Slowinski (Cray http://www.geocities.com/hjsmithh/Perfect/Mersenne.html

Mersenne Primes N is an even perfect number if and only if N = 2^(q-1) * (2^q - 1) and 2^q - 1 is prime It should also be noted that for 2^q - 1 to be prime q must be prime. So when we search for even perfect numbers, we search on q equal to the primes. The numbers M(q) = 2^q - 1 (with q prime) are called Mersenne numbers. If M(q) = is prime then it is called a Mersenne prime. If a prime q makes a Mersenne number a Mersenne prime, then P(q) = 2^(q-1) * (2^q - 1) is a Perfect number. Here are the 42 known Mersenne primes, M(q), as of Feb 18, 2005: The way to determine if 2^q - 1 is prime, given that q is an odd prime, is to use the Lucas-Lehmer test: Lucas-Lehmer-Test(q): u := 4 for i := 3 to q do u := (u^2 - 2) mod (2^q - 1) enddo if u == then 2^q - 1 is prime else 2^q - 1 is composite endif EndTest Return to Perfect Numbers Return to Number Theory and Algorithms Return to Harry's Home Page This page accessed times since October 20, 2004.

31. A Comprehensive Introduction To Prime Numbers This prime was discovered by accident earlier this year by David Slowinski andPaul Gage at Cray Research. There s something special about this number http://www.geocities.com/CapeCanaveral/Lab/3550/prime.htm

Prime numbers by Dinoj Surendran A prime number p is a positive integer (not 1) that is only divisible by 1 and p. The set of primes is therefore 2, 3, 5, 7, 11, .... Sometimes we consider negatives of primes (-2, -3, -5, ...) as primes as well, but not usually. Our entire system of arithmetic (addition and subtraction) rests on the prime numbers. In particular the theorem that every positive integer larger than one can be expressed as the product of a unique set of primes, eg 140 = 2 x 2 x 5 x 7, and there are no other primes which when multiplied together will give 140. An impeccable proof of this was given by the Greek mathematician Euclid If this (The Unique Prime Factorization Theorem) wasn't true, maths would be very different. The world would also be very different! The biggest problem with primes is that we don't know how to find them. What would be nice would be a polynomial (a formula of the form f(x) = a n x n + a n-1 x n-1 + ... + a x + a , eg x - 7) that gives us only prime numbers. No such polynomial exists. There are some other formulae that do give the nth prime, but they are far, far , FAR too cumbersome to be of any use. There are some polynomials that give several primes though, like this one (n +n+41), given on page 435 of ``Rama II'', by Arthur C. Clarke and Gentry Lee:

32. Primi Di Mersenne Noll (Cyber 174) 27 44497 13395 26790 1979 David Slowinski Harry L.Nelson (Cray 1) 28 86243 25962 51924 1982 David Slowinski (Cray 1) 29 110503 33265 http://alpha01.dm.unito.it/personalpages/cerruti/primi/primigrandi/elenco.html

Primi di Mersenne noti Se M n n - 1 è primo, n deve essere primo. Per quali primi p, 2 p - 1 è primo? Nella quarta colonna appare il numero di cifre del numero perfetto pari associato. nr p cfre cifre anno Scopritore (Computer) in M p in P 1 2 1 1 - - 2 3 1 2 - - 3 5 2 3 - - 4 7 3 4 - - 5 13 4 8 1461 Anonimo 6 17 6 10 1588 Pietro Antonio Cataldi 7 19 6 12 1588 Pietro Antonio Cataldi 8 31 10 19 1750 Leonhard Euler GIMPS

33. Mersenne Prime Numbers 27, 44497, 197904-08, Harry Nelson David Slowinski, Cray 1 33, 859433,1994-02-01, David Slowinski Paul Gage, 7.2 hours, Cray C90 http://wwwhomes.uni-bielefeld.de/achim/mersenne.html

For which positive integers p is p a prime number? Such prime numbers are called now-a-days Mersenne Primes and p is called its (prime) exponent. A table ordered by discovery date follows: Rank exponent p discovery date discoverer (credited persons) needed time to prove supporting help Pietro Cataldi Pietro Cataldi Leonhard Euler Francois Edouard A. Lucas I. M. Pervushin R. E. Powers R. E. Powers Raphael M. Robinson ~ 80 sec SWAC Raphael M. Robinson ~ 2 min SWAC Raphael M. Robinson 13.5 min SWAC Raphael M. Robinson ~ 55 min SWAC Raphael M. Robinson 1 hour SWAC Hans Riesel 5.5 hours BESK ~ 50 min IBM 7090 50 min IBM 7090 Donald B. Gillies 83 min ILLIAC II Donald B. Gillies 90 min ILLIAC II Donald B. Gillies 135 min ILLIAC II Bryant Tuckerman 35 min IBM 360/91 CDC Cyber 174 CDC Cyber 174 Cray 1 David Slowinski Cray 1 David Slowinski Cray X-MP David Slowinski Cray X-MP/24 686 sec NEC SX/2 ~ 16 hours Cray-2 7.2 hours Cray C90 ~ 6 hours Cray T90 Joel Armengaud, Woltman, et. al. 88 hours 90 MHz Pentium PC Gordon Spence, Woltman, et. al. 15 days 100 MHz Pentium PC Roland Clarkson, Woltman, Kurowski et. al.

34. The Largest Known Primes The Five Largest Known Primes On January 4, 1994 David Slowinski announced onthe internet that he and Paul Gage have found a new record prime 2^8594331. http://www.math.unicaen.fr/~reyssat/largest.html

The Largest Known Primes Contents: Introduction (What are primes? Who cares?) The "Top Ten" Record Primes The Complete List of the Largest Known Primes Other Sources of Prime Information ... Comments? Suggestions? New records? New Links? Related Local Documents: Finding (and Proving) Primes Note: The most recent version of the Largest Known Primes home page (this document) can always be found at http://www.utm.edu/research/primes/largest.html Introduction An integer greater than one is called a prime number if its only positive divisors (factors) are one and itself. For example, the prime divisors of 10 are 2 and 5; and the first six primes are 2, 3, 5, 7, 11 and 13. The Fundamental Theorem of Arithmetic shows that the primes are the building blocks of the positive integers: every positive integer is a product of prime numbers in one and only one way, except for the order of the factors. The ancient Greeks proved (ca 300 BC) that there were infinitely many primes and that they were irregularly spaced (there can be arbitrarily large gaps between successive primes). On the other hand, in the nineteenth century it was shown that the number of primes less than or equal to n approaches n /(ln n ) (as n gets very large); so a rough estimate for the

35. A1,28,Amdahl 6 - 1989 A2,30,Amdahl 6 - 1989 B1,64,Dave Boyd C1,64 D1,9,David Slowinski D2,10,David Slowinski D3,11,David Slowinski D4,12,DavidSlowinski D5,13,David Slowinski D6,14,David Slowinski D7,15,David Slowinski D8 http://www.mersenne.org/gimps/programs.txt

A1,28,Amdahl 6 - 1989 A2,30,Amdahl 6 - 1989 B1,64,Dave Boyd C1,64,Nick Craig-Wood. StongARM machines. D1,9,David Slowinski D2,10,David Slowinski D3,11,David Slowinski D4,12,David Slowinski D5,13,David Slowinski D6,14,David Slowinski D7,15,David Slowinski D8,16,David Slowinski D9,17,David Slowinski E,64,Ernst Mayer v2.3 through 2.4c - residues may have up to 3 digits wrong E1,64,Ernst Mayer v2.4d - residue bug fixed. E2,64,Ernst Mayer v2.5 G,15,Gary Gostin G2,64,Glucas v. 2.2 G29,64,Glucas with initial shift counts J,12,John Sweeney. Mac version 1.1 - bug in residue code. J1,64,John Sweeney. Mac version 1.2 - same as 1.1 but residue bug fixed. J2,64,John Sweeney. Mac version 1.3 - radix 4 implementation J3,64,John Sweeney. Mac version 1.4 - Bug fix. prev versions can give bad data J4,64,John Sweeney. MacLL v1.0b1 M,64,Peter Marksteiner. M1,64,Woltman - OS/2 Version of WPn (Marcel van de Vusse) M3,64,Woltman - OS/2 Version of WQn (Michel van Loon) N1,15,Nick Myrman. Home grown FFT. residues up to 15 bits - can be off by 1. N2,15,Nick Myrman. Crandall FFT. residues up to 15 bits - can be off by 1. O1,64,Woltman - OS/2 version of WPn (Matan Ziv-Av) S,15,Dave Smitley U,15,Unknown U2,28,Unknown (sent to David Slowinski) W1,0,Woltman - All integer version W2,64,Woltman - Early floating point version W4,64,Woltman - First Web release W5,64,Woltman - Separate lucas14 and 15. pre-factoring - Win 3.1 W6,64,Woltman - Windows 95 version of W5 - Win 95 W7,64,Woltman - Vastly improved factoring algorithm - Win 3.1 W8,64,Woltman - Vastly improved factoring algorithm - Win 95 W9,64,Woltman - Better self-test. fixed factoring continue bug - Win 3.1 WA,64,Woltman - Better self-test. fixed factoring continue bug - Win 95 WB,64,Woltman - No two-to-phi array. more error checking - Win 3.1 WC,64,Woltman - No two-to-phi array. more error checking - Win 95 WL,64,Woltman - No two-to-phi array. more error checking - Linux WP0,64,Woltman - PFA version - Win 3.1 WP1,64,Woltman - PFA version - Win 95 WP2,64,Woltman - PFA version - Linux WP3,64,Woltman - PFA version - Win 3.1 Screen Saver WP4,64,Woltman - PFA version - Win 95 Screen Saver WP5,64,Woltman - PFA version - Win NT Service WQ0,64,Woltman - Better error checking - Win 3.1 WQ1,64,Woltman - Better error checking - Win 95 WQ2,64,Woltman - Better error checking - Linux WQ3,64,Woltman - Better error checking - Win 3.1 Screen Saver WQ4,64,Woltman - Better error checking - Win 95 Screen Saver WQ5,64,Woltman - Better error checking - Win NT Service WQ6,64,Woltman - Better error checking - UNIXWare version compiled by MF WR1,64,Woltman - Networked version - Win 95 WR2,64,Woltman - Networked version - Linux WR5,64,Woltman - Networked version - Win NT Service WR7,64,Woltman - Networked version - OS/2 port by Michiel van Loon WS0,64,Woltman - Exp to 20.5M - Win 3.1 WS1,64,Woltman - Exp to 20.5M - Win 95 WS2,64,Woltman - Exp to 20.5M - Linux WS5,64,Woltman - Exp to 20.5M - Win NT Service WS7,64,Woltman - Exp to 20.5M - OS/2 port by Michiel van Loon WT0,64,Woltman - Shifted starting value - Win 3.1 WT1,64,Woltman - Shifted starting value - Win 95 WT2,64,Woltman - Shifted starting value - Linux WT5,64,Woltman - Shifted starting value - Win NT Service WT7,64,Woltman - Shifted starting value - OS/2 port by Michiel van Loon WU0,64,Woltman - Works above 2^22 - Win 3.1 WU1,64,Woltman - Works above 2^22 - Win 95 WU2,64,Woltman - Works above 2^22 - Linux WU5,64,Woltman - Works above 2^22 - Win NT Service WU7,64,Woltman - Works above 2^22 - OS/2 port by Michiel van Loon WV1,64,Woltman - Even faster! - Win 95 WV2,64,Woltman - Even faster! - Linux WV3,64,Woltman - Even faster! - Solaris WV5,64,Woltman - Even faster! - Win NT Service WV6,64,Woltman - Even faster! - FreeBSD WV7,64,Woltman - Even faster! - OS/2 port by Michiel van Loon WW1,64,Woltman - P-1 - Win 95 WW2,64,Woltman - P-1 - Linux WW5,64,Woltman - P-1 - Win NT Service WW6,64,Woltman - P-1 - FreeBSD WX1,64,Woltman - SSE2 and prefetch - Win 95 WX2,64,Woltman - SSE2 and prefetch - Linux WX5,64,Woltman - SSE2 and prefetch - Win NT Service WY1,64,Woltman - New FFT crossovers WY2,64,Woltman - New FFT crossovers WY5,64,Woltman - New FFT crossovers WZ1,64,Woltman - Improved SSE2 FFTs - Windows WZ2,64,Woltman - Improved SSE2 FFTs - Linux WZ5,64,Woltman - Improved SSE2 FFTs - NT Service X,64,Richard Crandall program and it's successors - UNIX X1,32,Crandall's program - UNIX

36. The Mersenne Newsletter, Issue 1 February 24, 1996 Status David Slowinski As most of you know, David Slowinski has been Should you be lucky enough to pick a range that David Slowinski has not http://www.mersenne.org/news1.txt

The Mersenne Newsletter, issue #1 February 24, 1996 Status Since launching the search in early January, many of the lower ranges have been completed with no new Mersenne primes found. We now have over 40 people and over 50 computers involved in the search. In January, there were over 24,000 primes under 1,000,000 that needed checking. Today there are now less than 21,000. Well done! David Slowinski - As most of you know, David Slowinski has been searching for Mersenne primes for 17 years using spare CPU cycles on his company's supercomputers. Unfortunately, he has not shared any information on the primes he has already tested. However, he did offer to verify the residues of a dozen primes to make sure our Lucas-Lehmer test program is operating correctly. He verified the residues for: 659077, 659101, 659173, 710207, 945151, 950617, 973289, 979691, 981023, 989477. He had not tested: 719027, 732041 From this I concluded two things. One, there are indeed untested ranges below 859433. Two, Mr. Slowinski has probably tested most of the primes from 859,433 to 1,000,000 or more in an effort to find a new record. As a result, I've opened up the ranges from 1000 to 1299 for searching. If you want to find a new world record prime and have checked out a range between 860 and 1000, I would suggest you pick a range above 1100. Just mail me the results that you have already and the new range you'd like to test. You'll also need to download the latest program and database to test these new ranges. What are the odds? I'm often asked "What are my chances of finding a Mersenne prime?" Should you be lucky enough to pick a range that David Slowinski has not previously tested - the following table approximates your chances: Prime Odds for one Lucas-Lehmer test Odds for an entire range 400000 1 in 4000 about 1 in 130 600000 1 in 5900 about 1 in 200 800000 1 in 7550 about 1 in 250 1000000 1 in 9250 about 1 in 300 1200000 1 in 11000 about 1 in 370 The above odds are only for primes where the program did not find a factor. Program News The factoring part of the program was originally written for 386 computers. Since 486 and Pentium machines have a floating point unit and a data cache, there are new optimizations that can be made. So far, the factoring has been improved by 30%. Since the program can now factor faster it makes sense to check for more factors before beginning a Lucas-Lehmer test. This will improve the overall time spent testing a range by about 2%. This new version of the program is now available on the Web. By the way, if you're worried that your 486 cannot run Lucas-Lehmer tests in a timely manner, you can now use your 486 for factoring only. See the web pages for more details. Happy hunting, George Woltman

37. VACETS Technical Column - Tc48 2^12577871 (which denotes 2 multiplied by itself 1257787 times minus one) isthe 34th Mersenne prime, discovered by David Slowinski and Paul Gage. http://www.vacets.org/tc/tc48.html

VACETS Regular Technical Column The VACETS Technical Column is contributed by various members , especially those of the VACETS Technical Affairs Committe. Articles are posted regulary on vacets@peak.org forum. Please send questions, comments and suggestions to vacets-ta@vacets.org September 10, 1996 Largest Known Prime Number Discovered About 2 years ago, Andrew Wiles, a researcher at Princeton, claims to have proved the Fermat's Last Theorem (FLT) and later a large gap was found in the proof. (The gap was filled later at the end of 1994.) At that time, we, the VACETSERS, had debated on proving the FLT using numerical methods (i.e., using computer to crank out the solutions to the famous theorem). One of the first steps in numerical method is to find the prime numbers, and from that, a "fastest prime number generator" war was waged among us the VACETSERS. The result of that "war" was that we were able to reduce the time from tens of seconds to find all the primes below 1 million to less than 1 second to find all the primes below 10 million. It was an improvement of more than 100. It was a fun war. (Actually, for me, anything involved with numbers, especially prime numbers, is fun.) Shortly after that "fastest prime number generator" war, Thomas R. Nicely, Professor of Mathematics at Lynchburg College, Virginia, computed the sums of the reciprocals of the twin primes (such as 11 and 13), triplets (such as 11, 13, and 17), and quadruplets (such as 11, 13, 17, and 19) up to a very large upper bound (about 10 trillion). He discovered during the summer and fall of 1994 that one of the reciprocals had been calculated incorrectly by a Pentium computer, although a 486 system gave the correct answer; this led to the publicization of the hardware divide flaw in the Pentium floating point unit.

38. Suspect Thoughts: A Journal Of Subversive Writing, Open Season #1 By David Salci email David Salcido email Tim Slowinski. Open Season 1 Confessions of a FlyingMonkey © 2001 David Salcido. Dearth of a Nation © 2001 Tim Slowinski http://www.suspectthoughts.com/open1.htm

Dearth of a Nation by Tim Slowinski Confessions of a Flying Monkey Let me just start out by saying, I've never been a friend of Dorothy. Not that there's anything wrong with that... It's been said that I will fuck anything that casts a shadow and, with very few exceptions (camels smell bad and baboons creep me out... ), that's absolutely true. I may have chosen a man as my present confrere and bedfellow, but there never was and never will be a yellow brick road in this sensual pilgrim's life. I'd like to say the reason is simple, but it isn't. Nothing ever really is. Instead, a little background is in order. The fact is, I became sexually active at a very young age, thanks to an overzealous and much older male cousin. Far from being scarred by the experience, however, I took what he taught me and ran with it. Maybe that's why when, at a time when most of my friends were just getting an idea of what sex was all aboutwhile talking about growing up to be firemen, astronauts or superheroesI was well ahead of the game. I knew what I wanted to be and it had nothing to do with your standard run-of-the-mill male icon. I wanted to be the personification of sex. Not male sex. ALL sex. I was a voracious reader even then. By the time of my forced sexual awareness, I had already devoured Tolkien, Burroughs, Wells and dabbled in the best science fiction and fantasy of the day. Most of it bored me, as did the superhero comics (spandex and bulging muscles aside) my friends had become addicted to. I couldn't explain my dissatisfaction, I just knew that something was missing from those chaste morality tales which passed for imaginative entertainment.

39. The Valley Breeze : Lincoln High School Announces 4th Quarter Honor Roll Andrew Shuster, Annemary Sitnik, Amanda Slowinski, David St. Germain, LaurenStempien, Jennifer Thibault, Anthony Truppi, and Daniel Uyttebroek. http://www.valleybreeze.com/Free/327039041878758.php

E-mail Story Print version Lincoln High School announces 4th quarter honor roll LINCOLN - The following students have been named to the fourth quarter honor roll at Lincoln High School. Grade 12 First Honors: Alexander Albert, Brooke Alessandrini, Courtney Atkinson, Alexander Belshe, Meghan Bouthillette, Matthew Brothers, Amy Brunelle, Brandon Cote, Chelsea Daigneault, Scott Davis, Keru Dyer, Jeffrey Ericson, John Ferrante, David Gardner, Amy Gendron, Andrew Hall, Joshua Labossiere, Kenneth Martone, Matthew McCabe, Carolyn McCoy, Zachary Mendonca, Kara Montalbano, Christine Moreau, Abby Nagle, Charlotte Palermino, Oksana Plugovoy, Katie Raymond, Jennifer Reeves, Jaime Reopell, Evan Smith, Catherine Spinella, Cristen Spinella, Amanda Spitell, Alison Stott, Kristen Vartanian, and Jennifer Winslow. Second Honors: Kristina Andrews, Dana Arnold, Tiffany Babbitt, Richard Buckley, Alyssa Caldwell, Sarah Cote, Nichole Crawley, Shannon Cullen, Joseph Daigle, Christine DeLisi, Darlena Fulp, Melissa Furtado, Emily George, Laura Ginish, Kira Haining, Tyler Harrold, Jessica Hauser, Desiree Houle, Ashley Keene, Kayla Kurczy, Brianna Lee, Megan Leech, Ashley Marien, Karen Marsella, Kristen Morito, Jessica Morris, Elyse Netto, Kayla Pandolfi, Bethany Plante, Valerie Puleo, Samuel Raheb, Justine Rhault, Stephanie Tanzi, Michelle Tien, Stephanie Tingley, Sean Valois, Mitchell Voyer, Andrew Walsh, Mikaela Yanku, and Leeanne Zuromski. Third Honors: Tobi Adebamowo, Amanda Albanese, Jason Allegretti, Justina Aspinwall, Alyson Auclair, Jonathan Augusto, Joel Bessette, Jared Bethel, Meghan Bingham, Ian Boisvert, Karen Bouthillier, Kayla Brodeur, Jordan Burbank, Anna Cameron, Christina Canham, Jenna Daignault, Adam Dingley, Amanda Donahue, Kayla Dorocz, Ryan Doucette, Kelly Dwyer, Jessica Esper, Kevin Ezovski, Derek Fernandes, Alicia Friedlander, Daniela Galeano, Kavin Garneau, Emily Glynn, Adrienne Greene, James Hague, Danielle Hall, Dana Lauro, Cynthia Lee, Stacy Lima, Diana Malachowski, David Marzilli, Andrew Mazur, Bryant McGrath, Elizabeth Mersereau, Jessica Olbrych, Sarah Oster, Daniel Renaud, Geoffrey Rush, Theresa Santoro, Kiely Schultz, Ritesh Shah, Lauren Sheehan, Nicholas Simanski, Nicholas Sinapi, Samantha Spano, Alicia St. Germain, Adriana Turco, Cristina Varejao, and Amber Wilson.

40. McKay Messenger :: Alumni Spotlight David O. McKay School of Education MSE Calendar Contact Us Slowinski,who graduated from BYU with an Ed.D. in Educational Leadership and Foundations http://education.byu.edu/news/alumni/

BRIGHAM YOUNG UNIVERSITY SEARCH MSE Calendar Contact Us BYU Home McKay School ... News Alumni Spotlight Alumni Spotlight Featuring McKay School Friends from the Past Eldon McMurray Becoming a Master Student Educational Leadership . In that case, Eldon McMurray has been up to quite a lot. McKay School of Education In addition to his position at UVSC, McMurray serves as the Faculty Advisor for both Houghton-Mifflin and the 11th Edition of Becoming a Master Student Originally from Oregon, McMurray and his wife, Diane, have lived in Utah County for the last 27 years. They have five children and six grandchildren. Besides being an avid scout leader (he received the Silver Beaver Award in 1998) and golf aficionado (he is a member of the PGA players club), McMurray says his favorite thing to do is be a grandfather. McMurray will graduate with a doctorate in Teacher Education in December 2005. Dr. Tanise Chung-Hoon While Tanise Chung-Hoon is busy raising her family of four, and acting as the co-director for the LDS Foundation's Principal Gift Offices, she still found the time and energy to complete her Ph.D in Ed Leadership and Foundations at BYU.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 2     21-40 of 105    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20