﻿ Grade 6 Mathematics Module 2, Topic D, Lesson 19 | EngageNY

## Grade 6 Mathematics Module 2, Topic D, Lesson 19

Student Outcomes

• Students explore and discover that Euclid’s Algorithm is a more efficient means to finding the greatest common factor of larger numbers and determine that Euclid’s Algorithm is based on long division.

Resources may contain links to sites external to the EngageNY.org website. These sites may not be within the jurisdiction of NYSED and in such cases NYSED is not responsible for its content.

 Grade 6 Mathematics Module 2, Topic D, Lesson 19: Student Version (523.42 KB) View PDF Grade 6 Mathematics Module 2, Topic D, Lesson 19: Teacher Version (919.18 KB) View PDF Grade 6 Mathematics Module 2, Topic D, Lesson 19: Student Version (195.24 KB) Grade 6 Mathematics Module 2, Topic D, Lesson 19: Teacher Version (330.36 KB)

## Common Core Learning Standards

CCLS State Standard
6.NS.4 Find the greatest common factor of two whole numbers less than or equal to 100 and the least common...