## Check if a M-th fibonacci number divides N-th fibonacci number

Given two numbers M and N, the task is to check if the M-th and N-th Fibonacci numbers perfectly divide each other or not. Examples:… Read More »

- Sum of the multiples of two numbers below N
- Remove characters from a numeric string such that string becomes divisible by 8
- Smallest perfect square divisible by all elements of an array
- Count of sub-sets of size n with total element sum divisible by 3
- Highest power of two that divides a given number
- Program to find Nth term divisible by a or b
- Minimum number of operations required to reduce N to 1
- Check if a large number is divisible by 2, 3 and 5 or not
- Count of sub-strings that are divisible by K
- Split a number into 3 parts such that none of the parts is divisible by 3
- Check if the sum of perfect squares in an array is divisible by x
- Find minimum x such that (x % k) * (x / k) == n
- Sum of common divisors of two numbers A and B
- Minimum removals in a number to be divisible by 10 power raised to K
- Longest subarray with elements divisible by k
- Find the multiple of x which is closest to a^b
- Possible cuts of a number such that maximum parts are divisible by 3
- Minimum and Maximum element of an array which is divisible by a given number k
- Largest Divisor of a Number not divisible by a perfect square
- Minimum positive integer divisible by C and is not in range [A, B]
- Sum of first N natural numbers which are divisible by 2 and 7
- Smallest multiple of 3 which consists of three given non-zero digits
- Maximum count of equal numbers in an array after performing given operations
- Find all numbers that divide maximum array elements
- Largest number with the given set of N digits that is divisible by 2, 3 and 5
- Program to find count of numbers having odd number of divisors in given range
- Smallest number greater than or equal to N divisible by K
- Minimum number of operations required to delete all elements of the array
- Minimum value that divides one number and divisible by other
- Sum of all the multiples of 3 and 7 below N

Given two numbers M and N, the task is to check if the M-th and N-th Fibonacci numbers perfectly divide each other or not. Examples:… Read More »

Given an integer n, find whether n is a Polydivisible or not. In mathematics, a number is called Polydivisible if it follows some unique properties.… Read More »

Given an array of length N that contains only integers, the task is to print the special numbers of array. A number in this array… Read More »

Given the integer N, the task is to print all the numbers less than N, which are divisible by 3 and 5. Examples : Input… Read More »

Given an array, count pairs in the array such that one element of pair divides other. Examples: Input : arr[] = {1, 2, 3} Output… Read More »

A number which consists entirely repeated number of times one is said to be Repeated Unit. We shall define R(k) of length k repeated unit… Read More »

Given a number, check whether it is even or odd. Examples : Input: n = 11 Output: Odd Input: n = 10 Output: Even Recommended:… Read More »

Given a sequence of non-negative integers, say a1, a2, …, an. Only following actions can be performed on the given sequence: Subtract 1 from a[i]… Read More »

Consider a very long K-digit number N with digits d0, d1, …, dK-1 (in decimal notation; d0 is the most significant and dK-1 the least… Read More »

Given a number n, check it is the Almost Perfect number or not. Almost perfect number is a natural number whose sum of all divisors… Read More »

Given an array of N integers, using ‘+’ and ‘-‘ between the elements check if there is a way to form a sequence of numbers… Read More »

Given n and a number, the task is to find the sum of n digit numbers that are divisible by given number. Examples: Input :… Read More »

Given number of digit n and a number, the task is to count all the numbers which are divisible by that number and having n… Read More »

Given a large number n, find if the number is divisible by 29. Examples : Input : 363927598 Output : No Input : 292929002929 Output… Read More »

Given an array of n-positive integers and a positive integer k, find a set of exactly m-elements such that difference of any two element is… Read More »