# data[].attributes.body
student: Maja Jordanova

# data[].attributes.body
student: Maja Jordanova

# data[].attributes.body
Pythagoras Tree drawn by İlayda, Eylül, Berke Can, Simay and Hasancan.

# data[].attributes.body
Recall that the Greatest Common Divisor (GCD) of two integers A and B is the largest integer that divides both A and B.

The Euclidean Algorithm is a technique for quickly finding the GCD of two integers.

THE ALGORITHM-

The Euclidean Algorithm for finding GCD(A,B) is as follows:

If A = 0 then GCD(A,B)=B, since the GCD(0,B)=B, and we can stop.

If B = 0 then GCD(A,B)=A, since the GCD(A,0)=A, and we can stop.

Write A in quotient remainder form (A = B⋅Q + R)

Find GCD(B,R) using the Euclidean Algorithm since GCD(A,B) = GCD(B,R)

SOURCE:

-CEREN A.

# data[].attributes.attachment_link.description
Read and learn for free about the following article: The Euclidean Algorithm

# data[].attributes.body
😊
-CEREN A.

# data[].attributes.body
-CEREN A.

# data[].attributes.attachment_link.title
Euclid's proof of the Pythagorean theorem

# data[].attributes.body
-CEREN A.

# data[].attributes.attachment_link.title
Euclid's Proof of the Pythagorean Theorem

# data[].attributes.body
-CEREN A.

# data[].attributes.body
-CEREN A.

# data[].attributes.body
-CEREN A.

# data[].attributes.body
SOURCE:
http://www.wikizeroo.net/index.php?q=aHR0cHM6Ly9lbi53aWtpcGVkaWEub3JnL3dpa2kvUHl0aGFnb3JlYW5fdGhlb3JlbQ

-CEREN A.

# data[].attributes.body
SOURCE: http://www.wikizeroo.net/index.php?q=aHR0cHM6Ly9lbi53aWtpcGVkaWEub3JnL3dpa2kvUHl0aGFnb3JlYW5fdGhlb3JlbQ

-CEREN A.

# data[].attributes.body
CEREN AKARSU
MELİKE TURAN
FERAH ERBEK
SİMAY ÖZER
FATMAGÜL SARIKAYA
DİLAN DURSUN
AFRA ÜSTÜN
OMAYMA RAJI
SÜMEYYE GÜRDOĞAN