Logo
Explore Help
Sign In
boostorg/integer
1
0
Fork 1
You've already forked integer
mirror of https://github.com/boostorg/integer.git synced 2025-10-28 15:01:37 +01:00
Code Issues Packages Projects Releases Wiki Activity
371 Commits 84 Branches 134 Tags
ada03a59d73b6a43ac3202a1570c146db04482a9
Commit Graph

3 Commits

Author SHA1 Message Date
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
Nick Thompson
4f4f3eda37 [ci skip] Fix docs to use less verbose names for modular multiplicative inverse (mod_inverse) 2018-02-10 16:07:17 -06:00
Nick Thompson
fc4d657201 [ci skip] Modular exponentiation, modular multiplicative inverse, extended Euclidean algorithm, discrete logarithm. 2018-01-28 14:47:14 -06:00
Powered by Gitea Version: 1.24.6 Page: 18ms Template: 2ms
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API