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

..

gcd

[ci skip] Modular exponentiation, modular multiplicative inverse, extended Euclidean algorithm, discrete logarithm.

2018-01-28 14:47:14 -06:00

html

Update history.

2017-04-24 18:50:19 +01:00

modular_arithmetic

[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

integer.qbk

Update docs to match new gcd/lcm code.

2017-04-24 13:01:57 +01:00

Jamfile.v2

Add, and update, documentation build targets.

2016-10-07 23:07:34 -05:00