PROOF 83
Prove.
The last remainder of the Euclidean algorithm is the gcd
On the natural numbers ℕ.
Definition D1
d | a means there exists a natural number k with a = dk.
Proof.
Related labs
PROOF 83
The last remainder of the Euclidean algorithm is the gcd
On the natural numbers ℕ.
Definition D1
d | a means there exists a natural number k with a = dk.
Proof.
Related labs