---
title: The longest equal pieces — a lesson of Mova's school · trees and pragmatics
description: «The longest equal pieces», a lesson of the lessons course of Mova's primary school, sentence by sentence with dependency trees and pragmatics. It begins: To cut two lengths into equal pieces with nothing left, the piece must divide both lengths; the longest such piece is the greatest common divisor
---

<!-- md -->
[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/corpora/school/lessons/188-longest-equal-pieces-gcd/)

<!-- crumbs -->
[home](https://md.mova.elamur.ai/free/en/) / [corpora](https://md.mova.elamur.ai/free/en/corpora/) / [school](https://md.mova.elamur.ai/free/en/corpora/school/) / [Lessons](https://md.mova.elamur.ai/free/en/corpora/school/lessons/) / The longest equal pieces

# The longest equal pieces

<!-- .vabout -->
Lesson 188 of the lessons course of Mova's primary school: 2 sentences, each with its syntax tree and pragmatics. The lessons are written for Mova, and their agreed trees are part of Mova corpus 0.4 (CC BY-SA 4.0).

<!-- list vl: b t -->
- [0](https://md.mova.elamur.ai/free/en/corpora/school/lessons/188-longest-equal-pieces-gcd/0/) — To cut two lengths into equal pieces with nothing left, the piece must divide both lengths; the longest such piece is the greatest common divisor.
- [1](https://md.mova.elamur.ai/free/en/corpora/school/lessons/188-longest-equal-pieces-gcd/1/) — Ribbons of 24 cm and 36 cm: the numbers that divide both are 1, 2, 3, 4, 6, 12, so the longest piece is 12 cm.

<!-- pn -->
- ← previous: [When together again](https://md.mova.elamur.ai/free/en/corpora/school/lessons/187-together-again-lcm/)
- next →: [Crossing the river with one boat](https://md.mova.elamur.ai/free/en/corpora/school/lessons/189-boat-crossings/)
- ↑ back to [Lessons](https://md.mova.elamur.ai/free/en/corpora/school/lessons/)