Date(s) : 08/06/2023 iCal
17 h 00 min - 18 h 00 min
It is known by everyone that it’s difficult to efficiently compute the factorization of a big integer in general. However, it becomes easy when this integer has only small prime divisors. Those integers are called smooth (or sometimes friable) and they have been of a particular interest in the 80’s because of their application in cryptography.
As it is the case with prime numbers, we would like to know how they behave under additive constraint but one can intuit that it is a difficult problem to deal with because in the case of primes, this kind of question is a rich source of unsolved problems like the famous Golbach or twin primes conjectures.
However, it is possible to find a lower bound for the set of smooth integers such that their successor is also smooth. We will also see a beautiful result which is true under the Elliot-Halberstam conjecture for smooth integers.
Le séminaire des doctorant⋅es de l’I2M et du CPT à Luminy regroupe chaque semaine les doctorant⋅es du site autour d’un exposé plus ou moins (in)formel, dans un cadre convivial. Il est évidemment ouvert aux étudiant⋅es de master et aux doctorant⋅es d’autres laboratoires.
C’est au rez-de-chaussée du bâtiment de « l’ancienne BU », dans la salle « Séminaire 2 » (au fond à gauche en sortant de l’escalier si vous venez de l’étage, au fond à droite si vous entrez par le rez-de-chaussée). Attention : l’entrée dans le labo nécessite un badge. En cas de souci (de type : être bloqué⋅e dehors), appeler le 04 91 26 95 91.
Emplacement
Amphi 5 - TPR2 (room 500-504, fifth floor)
Catégories