ConceptTheory & Algos
Greatest common divisor reduction
The greatest common divisor of two numbers is equal to the greatest common divisor of the second number and the remainder of the first number divided by the second.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Greatest common divisor1Modulo operation1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.