n_is_probabprime_fibonacci
Synopsis
#include <flint/ulong_extras.h>Fibonacci probable prime test: checks F_{n - (n/5)} \equiv 0 \pmod n, where (n/5) is a Jacobi symbol [CraPom2005]. Requires \gcd(n, 10) = 1.
References#
- [CraPom2005] R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, second edition, Springer (2005).
Cite this page
The FLINT team, “n_is_probabprime_fibonacci (ulong_extras.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/ulong_extras/n_is_probabprime_fibonacci.html (generated 2026-10-20).
@misc{flint-doc-ulong-extras-n-is-probabprime-fibonacci,
author = {{The FLINT team}},
title = {{n\_is\_probabprime\_fibonacci (ulong\_extras.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/ulong_extras/n_is_probabprime_fibonacci.html},
note = {Generated 2026-10-20}
}