This website requires JavaScript.
Explore
Help
Sign In
feedc0de
/
boost_integer
Watch
1
Star
0
Fork
0
You've already forked boost_integer
forked from
boostorg/integer
Code
Pull Requests
Activity
Files
2d463f3ee7beb19e89a6ef17992008c368e25052
boost_integer
/
doc
/
modular_arithmetic
History
Nick Thompson
87e5b365d8
Return custom struct from extended Euclidean algorithm rather than tuple. Reduce number of operations for tests to reduce CI system workload. Disable discrete log tests until we have time to figure out why they are failing.
2018-10-25 09:38:16 -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
Return custom struct from extended Euclidean algorithm rather than tuple. Reduce number of operations for tests to reduce CI system workload. Disable discrete log tests until we have time to figure out why they are failing.
2018-10-25 09:38:16 -06:00
mod_inverse.qbk
Return custom struct from extended Euclidean algorithm rather than tuple. Reduce number of operations for tests to reduce CI system workload. Disable discrete log tests until we have time to figure out why they are failing.
2018-10-25 09:38:16 -06:00