## Largest N digit number divisible by given three numbers

Given four integers x, y, z and n, the task is to find the largest n digit number which is divisible by x, y and… Read More »

- Program to find GCD or HCF of two numbers
- Euclidean algorithms (Basic and Extended)
- GCD of more than two (or array) numbers
- Program to find LCM of two numbers
- Euler's Totient Function
- LCM of given array elements
- Number of co-prime pairs in an array
- Check if two numbers are co-prime or not
- Fermat's little theorem
- Stein's Algorithm for finding GCD
- Minimum insertions to make a Co-prime array
- Finding LCM of more than two (or array) numbers without using GCD
- Find pair with maximum GCD in an array
- Product of given N fractions in reduced form
- Summation of GCD of all the pairs up to N
- Largest subarray with GCD one
- Minimum operations to make GCD of array a multiple of k
- Program to calculate the value of nCr Efficiently
- Number of Co-prime pairs from 1 to N with product equals to N
- GCD, LCM and Distributive Property
- Smallest Subarray with given GCD
- 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
- Largest number that divides x and is co-prime with y
- Replace every matrix element with maximum of GCD of row or column
- Minimum gcd operations to make all array elements one
- Convert the array such that the GCD of the array becomes 1
- Find the GCD of N Fibonacci Numbers with given Indices
- Check if possible to move from given coordinate to desired coordinate
- Largest subsequence having GCD greater than 1

Given four integers x, y, z and n, the task is to find the largest n digit number which is divisible by x, y and… Read More »

Given a rectangular sheet of length l and width w. we need to divide this sheet in the square sheets such that the number of… Read More »

Given a range, we need to check if is their any pairs in the segment whose GCD is divisible by k. Examples: Input : l=4,… Read More »

Given two integers and . The task is to find the Nth term which is divisible by either of or . Examples : Input :… Read More »

You are given an array of N integer values and M update operations. An update consists of choosing an element of the array and dividing… Read More »

Given a set containing N elements, you are allowed to add an element Z > 0 to this set only if it can be represented… Read More »

Given a range from L to R and every Xth tile is painted black and every Yth tile is painted white in that range from… Read More »

Given a range [L, R], the task is to find all possible co-prime pairs from the range such that an element doesn’t appear in more… Read More »

Given a number , find the number of distinct integers obtained by lcm(X, N)/X where X can be any positive number. Examples: Input: N =… Read More »

Given N and K, the task is to print N lines where each line contains 4 numbers such that every among those 4 numbers has… Read More »

Given two numbers n, r ( n>=r ). The task is to find the value of C(n, r) for big value of n. Examples: Input:… Read More »

Given a number N. The task is to find the number of co-prime pairs (a, b) from 1 to N such that their product(a*b) is… Read More »

Given indices of N Fibonacci numbers. The task is to find the GCD of the Fibonacci numbers present at the given indices. The first few… Read More »

Given the sum. The task is to find out the probability of occurring that sum on the thrown of the two dice N times. Probability… Read More »

Given N numbers, the task is to find the minimum removal of numbers such that GCD of the remaining numbers is greater than initial GCD… Read More »