Skip to content

Tag Archives: GCD-LCM

Given an array arr[] such that 1 <= arr[i] <= 10^12, the task is to find prime factors of LCM of array elements. Examples:  Input… Read More
Given three integers x, y, z, the task is to compute the value of GCD(LCM(x,y), LCM(x,z)). Where, GCD = Greatest Common Divisor, LCM = Least Common… Read More
Given a number n find the smallest number evenly divisible by each number 1 to n.Examples:   Input : n = 4 Output : 12 Explanation… Read More
Given two integer numbers, the task is to find the count of all common divisors of given numbers? Input : a = 12, b =… Read More
Given two integer numbers, the task is to find the count of all common divisors of given numbers. Input : a = 12, b =… Read More
You are given two positive numbers M and N. The task is to print greatest common divisor of M’th and N’th Fibonacci Numbers.The first few… Read More
Stein’s algorithm or binary GCD algorithm is an algorithm that computes the greatest common divisor of two non-negative integers. Stein’s algorithm replaces division with arithmetic… Read More
Given an array of n numbers, find LCM of it.   Input : {1, 2, 8, 3} Output : 24 Input : {2, 7, 3, 9,… Read More
Given an array arr[] of n numbers and an integer k, find length of the minimum sub-array with gcd equals to k.Example:  Input: arr[] =… Read More
Euler’s Totient function Φ (n) for an input n is the count of numbers in {1, 2, 3, …, n-1} that are relatively prime to… Read More
GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More
The Euclidean algorithm is a way to find the greatest common divisor of two positive integers. GCD of two numbers is the largest number that… Read More
GCD of two numbers is the largest number that divides both of them. A simple way to find GCD is to factorize both numbers and… Read More
LCM (Least Common Multiple) of two numbers is the smallest number which can be divided by both numbers.  For example, LCM of 15 and 20… Read More
GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them.  For example GCD of… Read More

Start Your Coding Journey Now!