Theoremcore
GCD recursion theorem
For integers a and b with b nonzero, gcd(a, b) equals gcd(b, a mod b), which justifies Euclid's algorithm.
For integers a and b with b nonzero, gcd(a, b) equals gcd(b, a mod b), which justifies Euclid's algorithm.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag EZSP4C Edit this page History Report an error