Crate modinverse [−] [src]

Small library for finding the modular multiplicative inverses. Also has an implementation of the extended Euclidean algorithm built in.

Functions

egcd	Implementation of the extended Euclidean algorithm.
modinverse	Function to calculate the modular multiplicative inverse of an integer a modulo m.

Keyboard Shortcuts

?: Show this help dialog
S: Focus the search field
⇤: Move up in search results
⇥: Move down in search results
⏎: Go to active search result
+: Collapse/expand all sections

Search Tricks

Prefix searches with a type followed by a colon (e.g. fn:) to restrict the search to a given type.

Accepted types are: fn, mod, struct, enum, trait, type, macro, and const.

Search functions by type signature (e.g. vec -> usize or * -> vec)