Séminaire de Théorie Analytique des Nombres et Problèmes
Diophantiens
Le 8 février 2001
Karl-Heinz Indlekofer (Université de Paderborn)
How random are primes?
- Heuristic, exact and computational results -
Résumé
: After (heuristic) arguments in connection with the prime number
theorem the talk deals with results obtained together with N.M. Timofeev
concerning shifted primes and together with A. Jarai in the field of
Computational Number Theory (largest known twin primes and Sophie
Germain primes), respectively.
Retour à la
page d'accueil.
stan@math.u-bordeaux.fr