# Mathematical Algorithms | GCD & LCM

### Recent Articles on GCD and LCM !

- GCD and LCM
- LCM of array
- GCD of array
- Basic and Extended Euclidean algorithms
- Product of given N fractions in reduced form
- GCD of two numbers when one of them can be very large
- Stein’s Algorithm for finding GCD
- GCD, LCM and Distributive Property
- Replace every matrix element with maximum of GCD of row or column
- GCD of two numbers formed by n repeating x and y times
- Count number of pairs (A <= N, B <= N) such that gcd (A , B) is B
- Array with GCD of any of its subset belongs to the given array
- First N natural can be divided into two sets with given difference and co-prime sums
- Minimum gcd operations to make all array elements one
- Program to find GCD of floating point numbers
- GCD of digits of a given number
- Series with largest GCD and sum equals to n
- Find pair with maximum GCD in an array
- GCD of elements in a given range
- Minimum operations to make GCD of array a multiple of k
- Largest Subset with GCD 1
- Queries for GCD of all numbers of an array except elements in a given range
- Summation of GCD of all the pairs up to N
- Largest subsequence having GCD greater than 1
- Largest subarray with GCD one
- Count pairs of natural numbers with GCD equal to given number
- Count number of subsets of a set with GCD equal to a given number
- Pair with maximum GCD from two arrays
- LCM of factorial and its neighbors
- Find LCM of rational numbers
- LCM of First n Natural Numbers
- LCM of digits of a given number
- Maximum sum of distinct numbers with LCM as N
- HCF of array of fractions (or rational numbers)
- Program to find HCF iteratively
- Least Common Denominator (LCD)
- Program to find GCD or HCF of two numbers
- Find max of two Rational numbers
- Smallest number divisible by n and has at-least k trailing zeros
- Check whether right angled triangle is valid or not for large sides
- Inbuilt function for calculating LCM in C++
- Minimum steps to come back to starting point in a circular tour
- Given GCD G and LCM L, find number of possible pairs (a, b)
- Maximum sum of distinct numbers such that LCM of these numbers is N
- Check if LCM of array elements is divisible by a prime number or not
- Finding LCM of more than two (or array) numbers without using GCD
- Check if elements of array can be made equal by multiplying given prime numbers
- N-th multiple in sorted list of multiples of two numbers
- Print the kth common factor of two numbers
- Smallest number to multiply to convert floating point to natural
- Check if possible to move from given coordinate to desired coordinate

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.