primitive_root_constexpr
関数 · internal/internal_math.hpp
constexpr int primitive_root_constexpr(int m);
概要
Compile time primitive root
パラメータ
| 名前 | 説明 |
|---|---|
m |
must be prime |
戻り値
primitive root (and minimum in now)
関連項目
barrett— Fast modular multiplication by barrett reduction Reference: https://en.wikipedia.org/wiki/Barrett_reduction NOTE: reconsider after Ice Lake NOTE: 法は 32bit (unsigned int) 前提。64bit 法には montgomery を使うmontgomery— Montgomery modular multiplicationis_SPRP64— given $2 \le n, a < 2^{64}$, $a$ prime, check whether $n$ is $a$-SPRP without 2,3,5,13,19,73,193,407521,299210837