This website requires JavaScript.
Explore
Help
Sign In
boostorg
/
integer
Watch
1
Star
0
Fork
1
You've already forked integer
mirror of
https://github.com/boostorg/integer.git
synced
2025-10-26 14:01:38 +01:00
Code
Issues
Packages
Projects
Releases
Wiki
Activity
Files
ada03a59d73b6a43ac3202a1570c146db04482a9
integer
/
doc
/
modular_arithmetic
History
Nick Thompson
faa61cd911
[ci skip] It is *not* the case that a discrete log exists when the base and modulus are coprime. Take 4^x = 2 mod 5 as a counterexample. Change API accordingly.
2018-02-10 17:51:59 -06:00
..
discrete_log.qbk
[ci skip] It is *not* the case that a discrete log exists when the base and modulus are coprime. Take 4^x = 2 mod 5 as a counterexample. Change API accordingly.
2018-02-10 17:51:59 -06:00
extended_euclidean.qbk
[ci skip] Modular exponentiation, modular multiplicative inverse, extended Euclidean algorithm, discrete logarithm.
2018-01-28 14:47:14 -06:00
mod_inverse.qbk
[ci skip] Fix docs to use less verbose names for modular multiplicative inverse (mod_inverse)
2018-02-10 16:07:17 -06:00