C program for gcd and lcm of 2 numbers

Find G. D Using Recursion. Find the Sum of Natural Numbers using Recursion. To understand this example, you should have the knowledge of the following C programming topics: C Programming Operators C for Loop C if There are many ways to find the greatest common divisor in C programming. Example 2: GCD Using while loop and if Share on:. Did you find this article helpful? Sorry about that. How can we improve it? Leave this field blank.

Related Examples. C Example Add Two Integers. C Example Find G. Get App Get C App. Learn CSS. Learn JavaScript. C Language C Tutorial. C Compiler. Standard Template Library. Python Python Tutorial. Python Programs. Python How Tos. Numpy Module. Matplotlib Module. Tkinter Module. Network Programming with Python. Learn Web Scraping. More in Python Python Compiler. Java Core Java Tutorial. Java Type Conversion Examples.

Java Wrapper Class. Java 8. Java More in Java Java Compiler. The LCM of two integers n1 and n2 is the smallest positive integer that is perfectly divisible by both n1 and n2 without a remainder. For example, the LCM of 72 and is In this program, the integers entered by the user are stored in variable n1 and n2 respectively.

The largest number among n1 and n2 is stored in max. The LCM of two numbers cannot be less than max. In each iteration, whether max is perfectly divisible by n1 and n2 is checked. If this test condition is not true, max is incremented by 1 and the iteration continues until the test expression of the if statement is true.

Learn how to find the GCD of two numbers in C programming. Course Index Explore Programiz. Popular Tutorials Data Types in C. C for Loop. Arrays in C Programming. Pointers in C. Find roots of a quadratic equation.