boostorg/integer
1
0
Fork 1
mirror of https://github.com/boostorg/integer.git synced 2025-07-29 20:27:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

Update docs. [CI SKIP]

Browse Source
This commit is contained in:
Nick Thompson
2018-10-26 12:05:47 -06:00
parent 2d463f3ee7
commit 3632ae43b2
2 changed files with 143 additions and 131 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/modular_arithmetic/mod_inverse.qbk
View File

@ -14,7 +14,7 @@ A fast algorithm for computing modular multiplicative inverses based on the exte
namespace boost { namespace integer {
template<class Z>
boost::optional<Z> mod_inverse(Z a, Z p);
boost::optional<Z> mod_inverse(Z a, Z m);
}}
@ -22,7 +22,7 @@ A fast algorithm for computing modular multiplicative inverses based on the exte
[section Usage]
Multiplicative modular inverses exist if and only if /a/ and /p/ are coprime.
Multiplicative modular inverses exist if and only if /a/ and /m/ are coprime.
So for example
auto x = mod_inverse(2, 5);