dedekind::category::detail_periodic::Pisano< N > Struct Template Reference

One step of the search for the Pisano period: the pair \((F(j), F(j+1))\) modulo m, and the least j at which it is \((0, 1)\) again, once found. More...

Collaboration diagram for dedekind::category::detail_periodic::Pisano< N >:

Public Member Functions
constexpr std::array< N, 3 >	operator() (std::array< N, 3 > s, N j) const

Public Attributes
N	m

Detailed Description

template<IsCountWord N>
struct dedekind::category::detail_periodic::Pisano< N >

One step of the search for the Pisano period: the pair \((F(j), F(j+1))\) modulo m, and the least j at which it is \((0, 1)\) again, once found.

---

The documentation for this struct was generated from the following file:

• src/main/modules/dedekind/category/periodic.cppm