`_fmpz_poly_fibonacci, fmpz_poly_fibonacci`

Synopsis#include <flint/fmpz_poly.h>

void _fmpz_poly_fibonacci(fmpz * coeffs, ulong n)source

void fmpz_poly_fibonacci(fmpz_poly_t poly, ulong n)source

Set poly to the $n$ -th Fibonacci polynomial $F_n$ , with $F_0 = 0$ , $F_1 = 1$ and $F_{n+1} = x F_n + F_{n-1}$ , computed by a hypergeometric recurrence.

Cite this page

The FLINT team, “_fmpz_poly_fibonacci, fmpz_poly_fibonacci (fmpz_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_poly/_fmpz_poly_fibonacci.html (generated 2026-11-02).

@misc{flint-doc-fmpz-poly-fmpz-poly-fibonacci,
  author       = {{The FLINT team}},
  title        = {{\_fmpz\_poly\_fibonacci, fmpz\_poly\_fibonacci (fmpz\_poly.h)}},
  howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
  year         = {2026},
  url          = {https://flintlib.org/doc/fmpz_poly/_fmpz_poly_fibonacci.html},
  note         = {Generated 2026-11-02}
}

Edit this page · PDF version · Built with fdoc from 0a4634bf95