arith_landau_function_vec
Synopsis
#include <flint/arith.h>Implements the basic algorithm of [DelegliseNicolasZimmermann2009], a dynamic programme over the prime powers p^e \le n for primes p up to about 1.33\sqrt{n \log n}. The running time is O(n^{3/2} / \sqrt{\log n}) operations on integers of O(\sqrt{n \log n}) bits.
References#
- [DelegliseNicolasZimmermann2009] Deleglise, Marc and Niclas, Jean-Louis and Zimmermann, Paul : Landau's function for one million billions, J. Théor. Nombres Bordeaux 20:3 (2009) 625–671
Cite this page
The FLINT team, “arith_landau_function_vec (arith.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arith/arith_landau_function_vec.html (generated 2026-10-20).
@misc{flint-doc-arith-arith-landau-function-vec,
author = {{The FLINT team}},
title = {{arith\_landau\_function\_vec (arith.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arith/arith_landau_function_vec.html},
note = {Generated 2026-10-20}
}