---
title: "Discussion on \"Euclidean Algorithm - Finding the GCD\" | Hashnode"
description: "Discussion on \"Euclidean Algorithm - Finding the GCD\". What Is GCD?\nThe Greatest Common Divisor (GCD) of two numbers is the largest number that divides both of them evenly.\nExample: GCD of 12 and 8 is 4, because 4 is the biggest number that divides both 12 and 8 with no remainder.\nWhat Is the Euclidean A..."
url: "https://hashnode.com/posts/euclidean-algorithm-finding-the-gcd/698af79fb5aef7a55b973c6d"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Euclidean Algorithm - Finding the GCD](https://harystyles.hashnode.dev/euclidean-algorithm-finding-the-gcd?utm_source=hashnode&utm_medium=feed)

What Is GCD? The Greatest Common Divisor (GCD) of two numbers is the largest number that divides both of them evenly. Example: GCD of 12 and 8 is 4, because 4 is the biggest number that divides both 12 and 8 with no remainder. What Is the Euclidean A...

Feb 10 · 2 min read · harystyles.hashnode.dev  
Read the article

-   [#euclidean-algorithm](https://hashnode.com/tag/euclidean-algorithm)
-   [#gcp](https://hashnode.com/tag/gcp)

## Written by

[Harrison Eze](https://hashnode.com/@dharystyles)

@dharystyles

  
[View profile](https://hashnode.com/@dharystyles)

I write because I mind

In my free time iwrite and raise my voice in toast.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
