Dec 23, 2025 · 2 min read · 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; ...
Hhimanshu commentedJul 24, 2025 · 5 min read · Have you ever typed =100/45 into Excel or Google Sheets, formatted it as a fraction, and watched it magically turn into 20/9? Seems simple. But under the hood, it’s using one of the oldest and smartest math tricks ever invented — the Euclidean Algori...
Join discussionMar 5, 2024 · 1 min read · 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...
M-- commented
Feb 26, 2024 · 3 min read · 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...
Join discussion
Jan 27, 2024 · 2 min read · 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...
Join discussionJun 10, 2023 · 2 min read · 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...
Join discussion
Feb 6, 2023 · 8 min read · 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...
Join discussion
Apr 26, 2020 · 2 min read · We were taught in our programming classes that, to calculate gcd of two integers efficiently use the Euclid’s algorithm. Magic The Euclid algorithm is programmed as follows: Take a step back and think for a minute. Why does it work? How did you do th...
Join discussion