.remBld {float:left; font-weight:bold; margin-right:5px; font-size:17px;} #_alt_ctrl_ALL, #_alt_ctrl_Z {border-right:none !important;} ul.right_align {float:left;}
about dmoz | dmoz blog | suggest URL | update listing | become an editor | report abuse/spam | help Description See also: This category in other languages: - The Prime Pages - Prime number research, records and resources. Includes largest known primes, finding and proving primes, glossary, curios, links.
- The Prime Puzzles & Problems Connection - Carlos Rivera's collection of problems and puzzles related to prime numbers.
- Animation of Eratosthenes' Prime Sieve - An interactive animation of the sieve of Eratosthenes to obtain prime numbers (JavaScript required).
- Applets for Prime Numbers - Factorization and weights of Proth coefficients.
- Are the Prime Numbers Randomly Distributed? - Web article by Johan G. van der Galiën. Shows that smaller starting digits are more common for primes below 10^9.
- Ask Dr. Math FAQ: Prime Numbers - Archived questions and answers at different levels.
- Bertrand's Postulate - International Mathematics Olympiad tutorial proving there is always a prime between n and 2n. [PDF]
- Cunningham Chain Records - Sequences of nearly doubled primes, maintained by Dirk Augustin.
- Electronic Frontier Foundation: Cooperative Computing Awards - Offers $100000, $150000 and $250000 for the first discovery of a prime above 10, 100 and 1000 million digits.
- Entropy and Prime Numbers - Entropy of a nonnegative adjacency matrix related to prime numbers.
- Formulae for Primes - Includes a formula by Jones, Sato, Wada and Wiens. The set of primes is the set of positive values taken by this expression.
- Gebhard Glöggler - Makes a statement about the number of primes between the squares of odd numbers, and provides a proof of Goldbach's conjecture.
- Generalized Fermat Prime Search - Software, results and other resources.
- Generalized Woodall Numbers - An organized search for primes of the form n*b^n-1.
- Introduction to Twin Primes and Brun's Constant - An article by Pascal Sebah with the results of computation of the twin primes up to 5.10^15.
- Introductory Prime Number Theory Resources - Notes and links compiled by Mark Watkins on the relation of the Riemann zeta function to the distribution of prime numbers.
- Jens Kruse Andersen - Prime constellation records. Arithmetic progressions, simultaneous primes, prime gaps.
- K-Tuple Permissible Patterns - Findings using an exhaustive search by Thomas J Engelsma.
- MacTutor History of Mathematics: Prime Numbers - Includes biographies on many mathematicians.
- MathWorld: Prime Numbers - Index to hundreds of prime-related articles in Eric Weisstein's MathWorld.
- Natural Numbers - Provides a collection of tools and interesting pages for testing, visualizing, and understanding natural numbers.
- Notes and Literature on Prime Numbers - With applets to demonstrate properties of primes.
- Number Spiral - Explains this method of visually representing the distribution of primes and the relationships between factors and products.
- On-Line Encyclopedia of Integer Sequences (OEIS): Primes - Index to information about many integer sequences involving primes. Site includes numerous other prime-related sequences.
- Primality - Introductory text on the theory of prime numbers and number fields. Contains proofs of some important theorems including the fundamental theorem of arithmetic. [PDF]
- Primality Testing with Fermat's Little Theorem - Test numbers for primality and pseudoprimality in Java.
- Prime Constellation Counting Functions - Techniques for counting prime constellations between P(n) and P(n)^2. [PDF]
- Prime Number Lists - Downloads of over 100 million prime numbers. Each link contains 1 million primes in a .7z file. A special link allows for downloads of all primes at once.
- Prime Numbers - Short lesson.
- Prime Numbers Generator and Checker - Enter a natural number, check it and find the nearest prime.
- Prime Numbers List - Browse all prime numbers of less than 10 digits. A prime number checker facility is also included.
- Prime Numbers and Factoring - Links and references related to primes and factoring.
- Prime k-tuplets - Tony Forbes' extensive collection of special types of prime clusters.
- Some Prime Numbers - Sieves and factoring for small numbers. Download primes below 8 billion.
- The Nine and Ten Primes Project - The discovery of nine and finally ten consecutive primes in arithmetic progression.
- The Prime Machine - Explore interactively the Goldbach conjecture, the distribution of prime twins, the prime number theorem.
- The Prime Page - Methods and definitions of finding prime numbers.
- Thomas R. Nicely - Includes twin prime counts, tables of first occurrence prime gaps, papers.
- Visualizing the Distribution of Prime Numbers - Investigation into patterns in the distribution of the primes by visualizing them.
- Wikipedia: Prime Numbers - Index to many prime-related articles.
- World of Numbers: World of Palindromic Primes - Records, statistics, curios and puzzles about primes reading the same backwards. Compiled by Patrick De Geest.
- Bipeds and Prime Numbers - Graduation address by former professor of philosophy Garrett Barden. Mentions primes as sign of human curiosity. (September 18, 2001)
Volunteer to edit this category. TheSnowman copyright © 2001
Terms of Use Visit our sister sites mozilla.org | ChefMoz | MusicMoz | Open-Site | Wikipedia
Last update: Tuesday, January 2, 2007 5:54:39 PM EST - edit function runOmni(){(function(){var F,t,n,v,p,q,u,o,i,f,D,d,k,c,b,x,g,E,s,z,C,m,r,a,l,B,e,w,A,y,j,h;F=location.protocol.toLowerCase();t=location.hostname.toLowerCase();n=location.port;v=location.pathname.toLowerCase();p=location.search.toLowerCase();q=document.title.toLowerCase();s_265.pfxID="odp";s_265.server=t;s_265.channel="us.dmozodp";s_265.charSet="UTF-8";s_265.linkInternalFilters="aol.com,javascript:,dmoz.org";u=t.split(".");o=(u.length>1)?u[u.length-2]+"."+u[u.length-1]:"";if((o==="dmoz.org")||(t+":"+n==="dmozqa-m01.ihost.aol.com:8081")||(t+":"+n==="10.146.172.49:9099")){s_265.prop12=F+"//"+t+v;i=(v.indexOf("/world/")>-1)?1:0;f=v.split("/");D=(i===1)?parseInt(f.length,10)-4:parseInt(f.length,10)-2;d=(f[f.length-1].length>0)?f[f.length-1].split(".")[0]:" - ";k=(f[f.length-1].length>0)?f[f.length-1]:" - ";c=(i===1)?f[3]:f[1];b=(i===1)?f[4]:f[2];if(i===0){x="english"}else{if((i===1)&&(D===-1)){x="world top"}else{if((i===1)&&(D>-1)){x=f[2]}}}s_265.prop16=x;j=(D>0)?"level-"+D:"level-0";switch(D){case -1:A=t+" - world top";y=A;h=A;break;case 0:if(d!==" - "){A="utilities";y="general info";h=t+" - "+d}else{A=t+" - top";y=A;h=A}break;case 1:A=c;y="top";h=(d!==" - ")?h=A+" - "+d:h="category main";break;case 2:A=c;y=b;h=(d!==" - ")?h=A+" - "+y+" - "+d:h="subcategory main";break;default:A=c;y=b;h=(d!==" - ")?h=A+" - "+y+" - "+d:h="level-"+D+" main";break}if(t==="search.dmoz.org"){A="utilities";y="search";j="level-0";h=d+" - home";g=((d==="search")&&(p.split("=")[0]==="?search"))?1:0;if(g===1){E=s_265.getQueryParam("search","",p);s_265.eVar11="sTerms:f|"+E;s_265.prop18=(s_265.getQueryParam("all").toLowerCase()!=="yes")?s_265.getQueryParam("cat").toLowerCase():"";s_265.prop18=s_265.prop18||"all";s=s_265.getQueryParam("t").toLowerCase();z=s_265.getQueryParam("morecat").toLowerCase();if(s==="c"||s==="s"||s==="b"){s_265.prop19=s}else{s_265.prop19=(z===1)?"c":"b"}C=(parseInt(s_265.getQueryParam("Kids"),10)===1)?"kids":"none";m=(parseInt(s_265.getQueryParam("Teens"),10)===1)?"teens":"none";r=(parseInt(s_265.getQueryParam("Mteens"),10)===1)?"mteens":"none";s_265.prop20=C+"|"+m+"|"+r;a=((s_265.prop19!=="c")&&(z.length===0)&&(s_265.getQueryParam("co").length===0))?((parseInt(s_265.getQueryParam("start")/20,10)+1)+""):(z.length===0)?((parseInt(s_265.getQueryParam("start")/25,10)+1)+""):((parseInt(s_265.getQueryParam("morecat")/25,10)+1)+"");s_265.prop21="page "+a;h="search results";l=(((a*1)===1)&&(z.length===0)&&(s_265.getQueryParam("start","",document.referrer).length===0))?1:0;if(l===1){B=(s.length>0)?"advanced search":((s.length===0)&&(s_265.getQueryParam("cat").length>0))?"branch search":"standard search";s_265.events="event1";s_265.eVar1=B}}e=1}if(e!==1){switch(c){case"help":A="utilities";y="help";j="level-0";h=(d!==" - ")?"dmoz help - "+d:"dmoz help - helpmain";e=1;break;case"profiles":A="utilities";y="profiles";j="level-0";h="dmoz - user profile";s_265.mmxtitle=h;s_265.mmxcustom="http://www.dmoz.org/profiles/user.html";e=1;break;case"become_an_editor":case"user-banners":case"awards":A="utilities";y="general info";j="level-0";h="dmoz - general info - "+q;e=1;break;case"guidelines":A="utilities";y="editors";j="level-0";h=(D>1)?"editors - "+c+" - "+b+" - "+q:"editors guidelines - "+q;e=1;break;case"newsletter":j="level-0";switch(D){case 1:y="newsletter article archive";h=y;break;case 2:h="newsletter "+y+" - "+q;break}e=1;break;case"erz":A="utilities";y="editors";j="level-0";h=(D>1)?"erz - "+b+" - "+q:"erz - top - "+q;e=1;break}}if(e!==1){if((t==="www.dmoz.org")&&(D===0)&&(d==="reinstate")){A="utilities";y="editors";h="editors - "+q;e=1}if(t==="report-abuse.dmoz.org"){A="utilities";y="report abuse";j="level-0";h=((D===0)&&(d==="faq"))?"dmoz report abuse system faq":"dmoz report abuse system";e=1}else{if(t==="rdf.dmoz.org"){A="utilities";y="rdf";j="level-0";if((D===0)&&(d===" - ")){h="rdf - main"}else{if((D===1)&&(d===" - ")){h="rdf - file index"}else{if((D===1)&&(d!==" - ")){h="rdf - "+d}}}e=1}}}if(e!==1){if((c==="cgi-bin")&&(t!=="search.dmoz.org")){A="utilities";j="level-0";switch(d){case"apply":case"forgot":y="editors";h=(d==="forgot")?"editors - password reminder form":(s_265.getQueryParam("submit").length===0)?"editors - application info":"editors - application";e=1;break;case"add":case"update":case"update2":case"update3":case"reinstate":y="editors";if(d==="add"){h="editors - submit a site instructions"}else{if(d==="update"){h="editors - update listing instructions"}else{if(d==="update2"){h="editors - update listing form"}else{if(d==="update3"){h="editors - update listing form received"}else{if(d==="reinstate"){h="editors - account reinstatement form received"}}}}}e=1;break;case"send":case"send2":y="editors";h=(d==="send")?"send editors feedback":"editors feedback received";e=1;break}}}if(e!==1){if((k==="desc.html")||(k==="faq.html")){w=(k==="desc.html")?"description":"faq";h=(D===1)?"branch category ":(D===2)?"branch subcategory ":"branch level-"+D+" ";h=h+w}}s_265.trackExternalLinks=false;s_265.mmxgo=true;s_265.prop1=A;s_265.prop2=y;s_265.prop17=j;s_265.pageName=h;s_265.t()}}())}var s_account="aoldmozodp,aolsvc";(function(){var b=document,a=b.createElement("script");a.type="text/javascript";a.src=(location.protocol==="https:"?"https://s":"http://o")+".aolcdn.com/omniunih.js";b.getElementsByTagName("head")[0].appendChild(a)}());