Bachelor's Thesis: Computing the Mertens Function
This research project is dedicated to the computation of the Mertens function.
It was my Bachelor’s thesis at the University Paris Cité, under the supervision of Cathy Swaenepoel.
The Mertens function is defined as \(M(x) = \sum_{n=1}^{x} \mu(n)\), where \(\mu(n)\) is the Möbius function.
In this project, I explore a computational method and theoretical aspects related to the Mertens function and this computation.
All details about the project are provided in the report, and you can find the complete source code and presentation slides in this directory mertens.
Read the full project report here: report_mertens.pdf
Presentation Slides
Section intitulée « Presentation Slides »For a visual overview of the project, check out the slides: Slides
Source Code
Section intitulée « Source Code »The source code is written in C and optimized for performance. You can find the main implementation here: Main computation file
Feel free to explore the code and reach out if you have any questions about the implementation or the mathematical approach.