fmpz_lucas_chain, fmpz_lucas_chain_full
Synopsis
#include <flint/fmpz.h>void fmpz_lucas_chain_full(fmpz_t Vm, fmpz_t Vm1, const fmpz_t A, const fmpz_t B, const fmpz_t m, const fmpz_t n)sourceSet V_m and V_{m+1} modulo n for the Lucas sequence V_0 = 2, V_1 = A, V_j = A V_{j-1} - V_{j-2} (respectively A V_{j-1} - B V_{j-2}), by the doubling formulas. No aliasing is allowed.
Cite this page
The FLINT team, “fmpz_lucas_chain, fmpz_lucas_chain_full (fmpz.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz/fmpz_lucas_chain.html (generated 2026-10-20).
@misc{flint-doc-fmpz-fmpz-lucas-chain,
author = {{The FLINT team}},
title = {{fmpz\_lucas\_chain, fmpz\_lucas\_chain\_full (fmpz.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz/fmpz_lucas_chain.html},
note = {Generated 2026-10-20}
}