The GNU Multiple Precision Library offers a function to calculate the modular multiplicative inverse of a multiple-precision number given the modulus (also a multiple-precision number). This program does the same, but shows all the steps of Euclid's Division Lemma, which is used to calculate the multiplicative inverse.
This repository was archived by the owner on Jan 25, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
tfpf/Euclid-Extended_Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
calculate the multiplicative inverse of a number (however large) using Euclid's Extended Division Lemma
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published