Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.21021 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- We use state-of-art lattice algorithms to improve the upper bound on the lowest counterexample to the Mertens conjecture to $\approx \exp(1.96 \times 10^{19})$, which is significantly below the conjectured value of $\approx \exp(5.15 \times 10^{23})$ by Kotnik and van de Lune [KvdL04].