extended-euclidean-algorithm-0.1.0
- extended-euclidean-algorithm 0.1.0
- Docs.rs crate page
- MIT
- Links
- Repository
- crates.io
- Source
- Owners
- BiliqisO
- Dependencies
- Versions
- 50% of the crate is documented
Go to latest version
Platform
Feature flags

docs.rs

Rust

mathematics0.1.0

All Items

Crate Items

Functions

Crate mathematics

Functions§

extended_euclidean_algorithm
Computes the greatest common divisor of 2 natural numbers and 2 additional numbers such that gcd(a,b)=s·a+t·b holds.