_qadic_log, _qadic_log_rectangular, _qadic_log_balanced
Synopsis
#include <flint/qadic.h>void _qadic_log(fmpz * z, const fmpz * y, slong v, slong len, const fmpz * a, const slong * j, slong lena, const fmpz_t p, slong N, const fmpz_t pN)sourcevoid _qadic_log_rectangular(fmpz * z, const fmpz * y, slong v, slong len, const fmpz * a, const slong * j, slong lena, const fmpz_t p, slong N, const fmpz_t pN)sourcevoid _qadic_log_balanced(fmpz * z, const fmpz * y, slong len, const fmpz * a, const slong * j, slong lena, const fmpz_t p, slong N, const fmpz_t pN)sourceSet (z, d) to
\log(1 - y) = -\sum_{i = 1}^{\infty} \frac{y^i}{i} \bmod p^N
for a nonzero y reduced modulo p^N, of valuation v with 1 \le v < N. The array z must have space for 2d - 1 coefficients. _qadic_log_rectangular allows aliasing between y and z, _qadic_log_balanced does not. _qadic_log uses rectangular splitting for N < 1024/b, where b is the bit length of p, and the balanced algorithm otherwise.
Cite this page
The FLINT team, “_qadic_log, _qadic_log_rectangular, _qadic_log_balanced (qadic.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/qadic/_qadic_log.html (generated 2026-10-20).
@misc{flint-doc-qadic-qadic-log,
author = {{The FLINT team}},
title = {{\_qadic\_log, \_qadic\_log\_rectangular, \_qadic\_log\_balanced (qadic.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/qadic/_qadic_log.html},
note = {Generated 2026-10-20}
}