Sign inSign in

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.
as Christof Paar defines itRuhr University Bochum
Watch it explained

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

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.