Scribd
Upload
13 views

The Euclidean Algorithm

The document discusses the Euclidean algorithm for finding the greatest common divisor (GCD) of two integers. It explains how to use the algorithm through successive divisions to find the GCD, and provides an example calculation of the GCD of 945 and 219. The document also discusses using the algorithm to determine the minimum weight that can be measured given different weight combinations.

Uploaded by

cici imayanti
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

The Euclidean Algorithm

The document discusses the Euclidean algorithm for finding the greatest common divisor (GCD) of two integers. It explains how to use the algorithm through successive divisions to find the GCD, and provides an example calculation of the GCD of 945 and 219. The document also discusses using the algorithm to determine the minimum weight that can be measured given different weight combinations.

Uploaded by

cici imayanti
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

The Euclidean algorithm

This unit present a method of introducing students to the Euclidean algorithm for finding the greatest
common divisor of two given integers

PERFORMANCE ONJECTIVES

1. Given any two integers, students will determine the greatest common divisor of the two
integers, regardless of the magnitude of the two integers
2. Having determined the greatest common divisor, the students will the be able to express the
greatest common divisor in terms of the two integers

PREASSESSMENT

Ask student how they would weigh 12 ounces, 2 ounces, 3 ounces, 4 ounces, 1 ounces, and 11 ounces
using only a set of two pan balance scales and some 5 and 7 ounces weights.

TEACHING STRATEGIES

Students should be able so suggest weighing the weights in the following manner:

1. 12 ounces: place one 5 oz. and one 7 oz. weight on the same pan, and the 12 ounces can
weighted on the other pan.
2. 2 ounces: place one 7 oz. weight on the pan and a 5 oz. weight on the other pan. Then the
desired 2 oz. weight that which must be placed on the pan containing the 5 oz. weight in order
to balance the scales.
3. 3 ounces: place two 5 oz. weights on one pan and a 7 oz. weight on the other pan. The desired 3
oz. weight is that which must be added to the 7 oz. weight in order to balance the scales.
4. 4 ounces: place two 5 oz. weight on one pan and two 7 oz. weight in other. The desired weight is
that which must be added two the 5 oz. weights in other to balance the scales.
5. 1 ounces: place three 5 oz. weight on one pan and two 7 oz. weight on the other. The desired
weight is that which must be added to the two 7 oz. weights in order to balance the scales.
6. 11 ounces: place three 5 oz. weight on one pan and two 7 oz. weight on the other. The desired
weight is that weight is that which must be added to the two 7 oz. weights in order to balance
the scales.
Students should then be asked to weigh 1 ounce, 2 ounces, 3 ounces and 4 ounces using other
combinations of given weights. They should soon be able to discover that can be weighted using
any combination of given weights is equal to the greatest common divisor of the two weight:

Given weights g.c.d. Minimum weighable


2 and 3 1 1
2 and 4 2 2
3 and 9 3 3
8 and 20 4 4
15 and 25 5 5
The greatest common divisor of A and B will be referred to as either G.C.D. of A and B or (A, B).
To find (945, 219) we can use the Euclidean algorithm. The Euclidean algorithm is based on a
lemma, which states: A and B are integers where A does not equal zero. If B is divided by A a
quotient Q and remainder R is obtained (B=QA+R), then (B,A)=(A,R). Using the following
procedure, the G.C.D. of 945 and 219 can be found:
Divide 945 by 219: 945 = 4*219 + 69 (1)
Divide 219 by 69:219 = 3*69 + 12 (2)
Now continue this process
69 = 5*12 + 9 (3)
12 = 1*9 + 3 (4)
9 = 3*3 + 0 … until R
Equals 0.
Therefore, the G.C.D. of 945 and 219 is 3, which was the last nonzero remainder in the
successive divisions. This method may be used to find (A,B) where A and B are any two integers.
Have students practice this algorithm with some exercise before continuing the lesson.
For stronger students in the class (or just for your interest), a proof of this algorithm is provided.
The following is a statement and proof of the Euclidean algorithm.
For given nonzero integer a and b, divide a by b to get remainder r1: divide b by r1 to get
remainder r2. This is continued so that when remainder rk is di

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy