The document discusses the Euclidean algorithm, which was developed by the ancient Greek mathematician Euclid of Alexandria around 300 BCE. It provides an introduction to the algorithm, outlines the steps to implement it, and gives an example of using it to find the greatest common divisor (GCD) of 60 and 24 by repeatedly dividing the larger number by the smaller number until the remainder is zero.

1. Euclidean
algorithm

2. Present contents
• Introduction
• Algorithm
• Implementation
• Example
9/3/20XX Presentation Title 2

3. Introduction
• Euclid of Alexandria, also known as Euclid
(330-275 BC), was a famous ancient Greek
mathematician. He is known as the "Father
of Geometry".(1)
3
(1): https://nguoinoitieng.tv/nghe-nghiep/nha-toan-hoc/euclid/a94q
• The Euclidean algorithm is an ancient
algorithm that appears in Euclid's Elements
around 300 BCE.(2)
(2): https://ladigi.vn/giai-thuat-euclid-la-gi-chi-tiet-ve-giai-thuat-euclid-moi-nhat-2021

4. Algorithm
4

5. Implementati
on
To implement the Euclidean
algorithm, you can use
programming languages as
follows:
9/3/20XX Presentation Title 5

6. Example
9/3/20XX Presentation Title 6
For example, to find the GCD of 60 and 24.

7. Example
9/3/20XX Presentation Title 7
For example, to find the GCD of 60 and 24:
Step 1: Divide 60 by 24, with remainder 12.
Step 2: Divide 24 by 12, with remainder 0.
Step 3: The GCD of 60 and 24 is 12.

8. Thank you
8