Finding the greatest common divisor by repeated subtractions

Research output: Contribution to journalArticle

Abstract

The greatest common divisor (GCD) of two or more positive integers is the largest integer that is a common divisor of the given integers - i.e. the largest integer that divides the given integers without leaving a remainder. There are many methods for finding the GCD of two or more integers. Some of the most commonly taught in schools are the methods of factor listing, prime factorisation, and common decomposition using the so-called ladder method. Each of these methods is briefly illustrated below for the pair of integers 18 and 24. Copyright © 2016 Association for Mathematics Education of South Africa (AMESA).
Original languageEnglish
Pages (from-to)22-24
JournalLearning and Teaching Mathematics
Volume2016
Issue number21
DOIs
Publication statusPublished - Jan 2016

Fingerprint

Highest common factor
Subtraction
Integer
Common divisor
L'Hôpital's Rule
Mathematics Education
Remainder
Divides
Decompose

Citation

Man, Y.-K. (2016). Finding the greatest common divisor by repeated subtractions. Learning and Teaching Mathematics, 2016(21), 22-24.