Nombres Premiers - Prime Integers
Crible géométrique - Geometric Sieve
PAGES WEB
Jean-Paul Davalan
<http://perso.wanadoo.fr/jean-paul.davalan/arit/index.html>
<http://www.primepuzzles.net/problems/prob_026.htm>
<http://ksc9.th.com/warut/cunningham.html>
<http://www.utm.edu/research/primes/>
<http://www.utm.edu/research/primes/largest.html>
<http://www.dcs.ex.ac.uk/~jwallace/simtable.htm>
<http://www.maths.ex.ac.uk/~mwatkins/zeta/index.html>
Entropia, the computer the size of planet Earth
<http://www.entropia.com/>
<http://pages.prodigy.net/chris_nash/primeform.html>
<http://www.geocities.com/CapeCanaveral/Launchpad/4057/primes.htm>
Sur la division euclidienne d'un nombre premier par son rangM. Balazard et A. Vavoda ont rédigé un article intitulé "Division euclidienne" dans la revue Pour la Science no 239, de septembre 1997.
<http://www.desargues.univ-lyon1.fr/home/mizony/progression.html>
On 2 March 1998 using my PC/Windows program, cp10, Manfred Toplic found ten consecutive primes in arithmetic progression
<http://www.ltkz.demon.co.uk/ar2/10primes.htm>
<http://www.crypto-world.com/FactorPapers.html>
Prof. Manindra Agarwal and two of his students, Nitin Saxena and Neeraj Kayal, have discovered a polynomial time deterministic algorithm to test if an input number is prime or not.
<http://www.cse.iitk.ac.in/news/primality.html>
Recent work of D. Goldston and C. Yildirim
Dan Goldston to expound on his prime number theory result at Palo Alto math workshop
<http://aimath.org/goldston_tech/>
John Derbyshire
<http://olimu.com/Notes/GoldstonYildirim.htm>
<http://www.math.boun.edu.tr/instructors/yildirim/yildirimtech.htm>
François Dress Université Bordeaux 1
<http://www.math.u-bordeaux.fr/~dress/records.html>
Marcus du Sautoy
<http://www.musicoftheprimes.com/index.htm>
PROJETS - PROJECTS
<http://www.loria.fr/~zimmerma/records/ecmnet.html>
PAGES PERSONNELLES - HOME PAGES
<http://ourworld.compuserve.com/homepages/hlifchitz/>
<http://www-lipn.univ-paris13.fr/~banderier/>
<http://www.loria.fr/~zimmerma/>
<http://home.hia.no/~jkhaug00/maths.htm>
<http://www.utm.edu/~caldwell/>
<http://www.math.sjsu.edu/~goldston/publications.htm>
ERREURS
<http://www.seanet.com/~ksbrown/kmath049.htm>
<http://203.162.7.73/webs/math/mathpages/www.seanet.com/~ksbrown/kmath049.htm>
PROBLÈMES - PROBLEMS
<http://forum.swarthmore.edu/~isaac/problems/prime2.html>
edited by M.L.Perez
<http://www.gallup.unm.edu/~smarandache/conjprim.txt>
<http://www.utm.edu/research/primes/notes/conjectures/>
DEMOS
Java et JavaScript
<../calc/arit/probprimejava.html>
Java et JavaScript
<../calc/arit/primejava.html>
Fred Richman Florida Atlantic University
<http://www.math.fau.edu/Richman/carm.htm>
Le hasard
les entiers 4271
, ZJ=25×26+9=659
et 29
sont premiers, ainsi que
4271-659-29=3583
ou encore 4461+XN+29=4461+611+29=5101
.
EXEMPLES - EXAMPLES
invented by Yuri MATIYASEVICH and Boris STECHKIN
<http://www.informatik.uni-stuttgart.de/ifi/ti/personen/Matiyasevich/Journal/Sieve/Sieve.html>
IMAGES
<http://yoyo.cc.monash.edu.au/~bunyip/primes/#2d>
ANIMATIONS - MOVIES
Sir David Attenborough's Life in the Undergrowth - BBC wildlife
Certaines cigales ont un cycle de vie de 13 ou de 17 ans.
<http://www.youtube.com/watch?v=tjLiWy2nT7U>
LOGICIELS - SOFTWARES
<http://primefindersoftware.tripod.com/>
<http://www.interlog.com/~tcharron/ecm.html>
A Windows program for finding very large primes
<http://www.utm.edu/research/primes/programs/gallot/>
PROGRAMMES
<http://perso.wanadoo.fr/jean-paul.davalan/calc/arit/crible.c.txt>
SITES FTP
Méthodes de factorisation
<ftp://ftp.cwi.nl/pub/pmontgom/>
JAVA
A Java simulation of the algorithmic steps of a model of Shor's algorithm. The simulator can be used to investigate Shor's method of factoring for numbers up to 10 digits in length.
<http://www.dcs.ex.ac.uk/~dacrick/AST/>
Matthew Hayward
<http://www.imsa.edu/~matth/cs299/>
JAVASCRIPT
Jean-Paul Davalan
Construction d'une table de nombres premiers (java et javascript). Recherche de n-uplets de nombres premiers consécutifs de différences données. Nombres premiers probables.
<http://perso.wanadoo.fr/jean-paul.davalan/calc/arit/primesindex.html>
Alkulukuja Paskova Karhu
<http://www.primenumbershittingbear.com/>
Cyptography and Number Theory, Calculus, Interest, Modern algebra and other things, Liberal arts mathematics, One shot mysterious stuff
<http://www.math.fau.edu/Richman/jscripts.htm>
LIVRES - BOOKS
De la densité des sin(p) lorsque p parcourt l'ensemble des nombres premiers.
Voici donc un livre, plutôt destiné à un public de non spécialistes. On y traite de nombres premiers, et surtout d'une méthode introduite par la mathématicien russe Vinogradov vers 1937 pour les étudier.
Olivier Ramaré Université de Lille I
<http://math.univ-lille1.fr/~ramare/Maths/PetitLivre.html>
SUJETS - SUBJECTS
Jonas Wiklund
<http://abel.math.umu.se/~jwi/articles/primenumberthm/primenumberthm.html>
Shallit, Williams, Morain
Built by a French amateur, E.-O. carissan, around 1919.
<http://www.math.uwaterloo.ca/~shallit/Papers/carissan.html>
<http://www.math.uiuc.edu/~dan/ShortProofs/uf.htm>
Jean-Marie De Koninck
Un peu d'histoire. Quelques équivalences de l'hypothèse de Riemann (HR).La conjecture abc (1985). Nombres puissants, nombres premiers de Wieferich et théorème de Fermat. Les nombres premiers en progression arithmétique. Les tests de primalité. La méthode RSA et la méthode des courbes elliptiques. Le problème P versus NP.
<http://campmath.uqam.ca/infos2004/resDeKoninck2004.pdf>
DOCUMENTS - PAPERS
<http://www.britannica.com/bcom/eb/article/6/0,5716,117296%2B2,00.html>
<http://www-groups.dcs.st-and.ac.uk/~history/HistTopics/Prime_numbers.html#45>
<http://pass.maths.org.uk/subject.shtml#Primes>
Gaussian primes are Gaussian Integers a+ib for which the norm n(a+ib)=a2+b2 is Prime or, if b=0, a is a Prime Integer such that |a|=3(mod 4).
<http://mathworld.wolfram.com/GaussianPrime.html>
<http://mathworld.wolfram.com/EisensteinInteger.html>
<http://www.rzuser.uni-heidelberg.de/~hb3/rchrono.html>
Matthew Hayward
<http://www.imsa.edu/~matth/cs299/>
By Albert N. Debono
<http://www.bms.com.mt/archive/iss26/num12.htm>
<http://www.utm.edu/research/primes/lists/top20/ArithmeticProgression.html>
<http://www.math.uga.edu/~andrew/agpapers.html>
Pieter Moree
<http://web.inter.NL.net/hcc/J.Moree/wrench.dvi>
Least primitive root of prime numbers Least prime primitive root of prime numbers Least base necessary to prove the primality of a number
Tomás Oliveira e Silva
<http://www.ieeta.pt/~tos/p-roots.html>
<http://www.maths.ex.ac.uk/~mwatkins/zeta/tutorial.htm>
Matthew M. Conroy
It would follow from a conjecture of Schinzel that all positive integers are representable as (p+1)/(q+1) with q and p prime. This conjecture is verified to 109, and various results of the calculation are given.
<http://www.math.uwaterloo.ca/JIS/VOL4/CONROY/conroy.html>
John Renze Stan Wagon Brian Wick
Experimental Mathematics Volume 10 (2001)
<http://www.expmath.org/expmath/volumes/10/10.html>
Dan Gordon, Gene Rodemich Proceedings of ANTS III, LNCS 1423 (1998), pp. 216-225.
<http://www.ccrwest.org/gordon/ants.ps>
Paulo R. A. Campos and Viviane M. de Oliveira and R. Giro and Douglas S. Galvao
...The Magicicadas display an uncommon behavior: their emergence is synchronized and these periods are usually prime numbers. In the current work, we develop a spatially extended model at which preys and predators coexist and can change their evolutionary dynamics through the occurrence of mutations. We verified that prime numbers as life cycles emerge as a result of the evolution of the population. Our results seem to be a first step in order to prove that the development of such strategy is selectively advantageous...
<http://www.citebase.org/abstract?id=oai:arXiv.org:q-bio/0406017>
JOURNAUX - LETTERS
<http://www.sciencenews.org/sn_arc98/3_21_98/mathland.htm>
Ivars Peterson
<http://www.sciencenews.org/20020504/mathtrek.asp>
TUTORIELS - TUTORIALS - TUTORS
Cyril Banderier
<http://www-lipn.univ-paris13.fr/~banderier/Recipro/index.html>
où l'on verra Ãratosthène, Fermat, Legendre, Gauss, Kraïtchik, Lehmer, Pollard, Lenstra et Pomerance se disputant à l'envi l'honneur du meilleur algorithme de factorisation
par Cyril Banderier, maîtrise d'ingénierie mathématique, Université de Rouen. Année 1996/1997 Directeur du projet : G. Duchamp
<http://www-lipn.univ-paris13.fr/~banderier/Facto/facto.html>
CHRONOLOGIES
Mark Brader
<http://www.davros.org/misc/chronology.html>
ARTS
<http://www.madandmoonly.com/doctormatt/sound/primes.mp3>
ABONNEMENTS - MAILING LISTS
<http://www.utm.edu/~primes/Primes-L/threads.html>
LIENS - LINKS
<http://perso.wanadoo.fr/jean-paul.davalan/liens/liens_math.html>