---
title: "#gcd articles | Hashnode"
description: "Explore 8 articles tagged #gcd on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/gcd"
---

Tag

# #gcd

8 posts · 2 followers

[himanshu sharma](https://hashnode.com/@himanshu-sharma) · [Dec 23, 2025](https://hashnode.com/posts/euclid-gcd-algorithm-why-it-works/694a407b6feb1ff94816cbfe)

### [Euclid GCD Algorithm Why it works](https://eulclids-gcd-why-it-works.hashnode.dev/euclid-gcd-algorithm-why-it-works?utm_source=hashnode&utm_medium=feed)

Euclid gcd algorithm is a procedural way to find GCD(greatest common devisor)/HCF(highest common factor) of two numbers it is super fast and preferred way of calculating gcd for computer programs it has a simple logic let us assume two numbers a=54; ...

2 min read · [eulclids-gcd-why-it-works.hashnode.dev](https://eulclids-gcd-why-it-works.hashnode.dev/euclid-gcd-algorithm-why-it-works?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/euclid-gcd-algorithm-why-it-works/694a407b6feb1ff94816cbfe)

[Madhura Anand](https://hashnode.com/@madhura-anand) · [Jul 24, 2025](https://hashnode.com/posts/understanding-the-euclidean-algorithm-a-simple-guide-for-beginners/68819f4d5944704cd09515cf)

### [Understanding the Euclidean Algorithm: A Simple Guide for Beginners](https://madhura.hashnode.dev/understanding-the-euclidean-algorithm-a-simple-guide-for-beginners?utm_source=hashnode&utm_medium=feed)

Learn the ancient Euclidean Algorithm for efficiently finding the GCD with simple steps and real-life applications

5 min read · [madhura.hashnode.dev](https://madhura.hashnode.dev/understanding-the-euclidean-algorithm-a-simple-guide-for-beginners?utm_source=hashnode&utm_medium=feed)

[Gagan G Saralaya](https://hashnode.com/@GaganG) · [Mar 5, 2024](https://hashnode.com/posts/c-program-to-find-the-gcd-and-lcm-using-pointers/65e6fe954853d0af56db5484)

### [C program to find the GCD and LCM using pointers](https://gagang.hashnode.dev/c-program-to-find-the-gcd-and-lcm-using-pointers?utm_source=hashnode&utm_medium=feed)

Here is a C program to find the Greatest common devisor and the Least common multiple of a number. #include<stdio.h> void gcdlcm(int num1,int num2,int\*gcd,int\*lcm) { int i,max; max=(num1>num2)?num1:num2;//Simple way of saying if num1 is great...

1 min read · [gagang.hashnode.dev](https://gagang.hashnode.dev/c-program-to-find-the-gcd-and-lcm-using-pointers?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/c-program-to-find-the-gcd-and-lcm-using-pointers/65e6fe954853d0af56db5484)

[Sanya Verma](https://hashnode.com/@sanyaverma) · [Feb 26, 2024](https://hashnode.com/posts/finding-hcf-using-java/65dc0df4e7c1c16296e6fc4b)

### [Finding HCF using Java!!](https://bytebybyte.hashnode.dev/finding-hcf-using-java?utm_source=hashnode&utm_medium=feed)

HCF(Highest Common Factor), also known as GCD(Greatest Common Divisor) is is the largest positive integer that divides each of the numbers without leaving a remainder. It is widely used in various mathematical and practical applications like Fraction...

3 min read · [bytebybyte.hashnode.dev](https://bytebybyte.hashnode.dev/finding-hcf-using-java?utm_source=hashnode&utm_medium=feed)

[Meet Makwana](https://hashnode.com/@meetmak0101) · [Jan 27, 2024](https://hashnode.com/posts/understanding-the-euclidean-algorithm-for-finding-gcd/65b50b593818ce8d763e7f18)

### [Understanding the Euclidean Algorithm for Finding GCD](https://msquare.vercel.app/articles/understanding-the-euclidean-algorithm-for-finding-gcd?utm_source=hashnode&utm_medium=feed)

What is GCD What is GCD (Greatest Common Divisor): The Greatest Common Divisor, or GCD, is a fundamental concept in number theory, representing the largest positive integer that divides two numbers without leaving a remainder. Euclidean Algorithm Wha...

2 min read · [msquare.vercel.app](https://msquare.vercel.app/articles/understanding-the-euclidean-algorithm-for-finding-gcd?utm_source=hashnode&utm_medium=feed)

[Yaroslav Prozorov](https://hashnode.com/@Byka) · [Jun 10, 2023](https://hashnode.com/posts/gcd-or-hcf-of-two-numbers/648455efddd3e3571f5529cf)

### [GCD or HCF of two Numbers](https://byka.hashnode.dev/gcd-or-hcf-of-two-numbers?utm_source=hashnode&utm_medium=feed)

Description GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them. Example: We have a = 4 and b = 6. GSD of 4 and 6 is 2. But how do we find it? We can use the super classic way. T...

2 min read · [byka.hashnode.dev](https://byka.hashnode.dev/gcd-or-hcf-of-two-numbers?utm_source=hashnode&utm_medium=feed)

[Aman Nadaf](https://hashnode.com/@iRatherFear) · [Feb 6, 2023](https://hashnode.com/posts/number-theory/63e1021bef4a7c1cd7aebf5e)

### [Number Theory](https://teckbakers.hashnode.dev/number-theory?utm_source=hashnode&utm_medium=feed)

Hui!! Euclid's Algo Let's start with GCD(Greatest Common Divisor). I would assume you know what GCD is. You might know different ways to calculate GCD. You might use Euclid's Algo to find the GCD of two numbers or you would just represent both number...

8 min read · [teckbakers.hashnode.dev](https://teckbakers.hashnode.dev/number-theory?utm_source=hashnode&utm_medium=feed)

[Manoj Vignesh K M](https://hashnode.com/@kmmanoj) · [Apr 26, 2020](https://hashnode.com/posts/math-behind-euclids-theorem/64e8fe590bf6af73f8b6098e)

### [Math Behind Euclid’s Theorem](https://kmmanoj.hashnode.dev/math-behind-euclids-theorem?utm_source=hashnode&utm_medium=feed)

Wondered why Euclid’s GCD theorem works?

2 min read · [kmmanoj.hashnode.dev](https://kmmanoj.hashnode.dev/math-behind-euclids-theorem?utm_source=hashnode&utm_medium=feed)
