Smooth Numbers

Roughly, smooth numbers are integers with small prime factors relative to some bound. Interestingly, these integers find many applications in number theory, but also in graph theory and cryptography, among others.

A first goal of the project would be to gain some experience with smooth integers, by doing some computer calculations and finding possibly some nice patterns. In a second time, the project could allow various different subprojects, such as

The detailed description of the three projects is available for download here.

Schedule: Winter semester 2018/2019

Difficulty level: EML 2 (especially for students in their 3rd semester).