The Fibonacci numbers modulo m, \(k \mapsto F(k) \bmod m\), by fast doubling, \(\log k\) steps; the modulus is at most the square root of the word's order, so that the products stay in the word, and a wider one is refused where the arrow is read.
More...
|
|
using | Domain = N |
|
using | Codomain = N |
template<IsCountWord N = std::size_t>
struct dedekind::category::FibonacciMod< N >
The Fibonacci numbers modulo m, \(k \mapsto F(k) \bmod m\), by fast doubling, \(\log k\) steps; the modulus is at most the square root of the word's order, so that the products stay in the word, and a wider one is refused where the arrow is read.
- Template Parameters
-
◆ operator()()
template<IsCountWord N = std::size_t>
- Parameters
-
- Returns
- \(F(k) \bmod m\).
The documentation for this struct was generated from the following file: