extended-euclidean-algorithm 0.1.1

This library computes the greatest common divisor of 2 natural numbers and 2 additional numbers such that gcd(a,b)=s·a+t·b holds.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24

[[bin]]
name = "extended-euclidean-algorithm"
path = "src/main.rs"

[dependencies]

[lib]
name = "mathematics"
path = "src/lib.rs"

[package]
autobenches = false
autobins = false
autoexamples = false
autotests = false
build = false
description = "This library computes the greatest common divisor of 2 natural numbers and 2 additional numbers such that gcd(a,b)=s·a+t·b holds."
edition = "2021"
keywords = ["rust", "gcd", "eea", "extended-euclidean", "moon-mathematics"]
license = "MIT"
name = "extended-euclidean-algorithm"
readme = false
repository = "https://github.com/BiliqisO/moon-math/tree/extended-euclidean-algorithm"
version = "0.1.1"