The Euclidean Algorithm

← Back to search

View Lesson Plan

Full Lesson Plan

Ozobot

6-12

•

Computer Science, Math

•

saved

Evo helps students learn how to compute the greatest common divisor (GCD) of a pair of positive integers by use of the Euclidean algorithm.

Ozobot Blockly

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

Resources

Lesson Plan

Explore more lessons

Ari Applied AI Career Kit: Agriculture | Lesson 6 | AI System Capstone

Ari Applied AI Career Kit: Agriculture | Lesson 5 | AI Crop Monitoring System

Ari Applied AI Career Kit: Agriculture | Lesson 4 | AI Data Collection

Ari Applied AI Career Kit: Agriculture | Lesson 3 | Using AI for Crop Navigation

Ari Applied AI Career Kit: Agriculture | Lesson 2 | Sensor Data Collection

Ari Applied AI Career Kit: Agriculture | Lesson 1 | AI in the Field

Exploration with color code

Go nuts

A-Mazing Race: Calculate and Code

Ozobot evo česky

Please login or create an account to access this content and more!