The Euclidean Algorithm
Community
6-12
•
Computer Science, Math
•
saved
Ozobot Blockly
Evo helps students learn how to compute the greatest common divisor (GCD) of a pair of positive integers by use of the Euclidean algorithm.
Academic Standards
CSTA.2-AP-11, CSTA.2-AP-17, CSTA.2-CS-02, CSTA.3A-AP-17, CSTA.3A-DA-11, CSTA.3A-DA-12, CSTA.3B-AP-21, ISTE.1.c, ISTE.5.a, ISTE.5.b, ISTE.5.c, ISTE.5.d
Loading Document...