## Program to find remainder when large number is divided by r

Given a Number N, the task is to find the Remainder when N is divided by R (a two digit Number). The input of the… Read More »

## Number of divisors of a given number N which are divisible by K

Given a number and a number . The task is to find the number of divisors of N which are divisible by K. Here K… Read More »

## Generating numbers that are divisor of their right-rotations

Given a number m, find all numbers which have m digits and are a divisor of their right-rotation. Right-rotation of a number N is the… Read More »

## Sum of the numbers upto N that are divisible by 2 or 5

Given a number n. The task is to find the sum of numbers up to n, that are divisible 2 or 5. Examples: Input: n… Read More »

## Check if a number is divisible by 23 or not

Given a number, the task is to quickly check if the number is divisible by 23 or not. Examples: Input : x = 46 Output… Read More »

## Check if a number is divisible by 41 or not

Given a number, the task is to quickly check if the number is divisible by 41 or not. Examples: Input : x = 123 Output… Read More »

## Triplet with no element divisible by 3 and sum N

Given an integer N greater than 2, the task is to print any combination of a, b and c such that: a + b +… Read More »

## Check if a number with even number of digits is palindrome or not

Given a number N containing even number of digits. The task is to check whether that number is palindrome or not. Examples: Input: N =… Read More »

## Check if any permutation of a large number is divisible by 8

Given a large number N and the task is to check if any permutation of a large number is divisible by 8. Examples: Input: N… Read More »

## Check if the large number formed is divisible by 41 or not

Given the first two digits of a large number digit1 and digit2. Also given a number c and the length of the actual large number.… Read More »

## 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 »

## Check whether a given number is Polydivisible or Not

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 »

## Print array elements that are divisible by at-least one other

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 »

## Program to print all the numbers divisible by 3 and 5 for a given number

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 »

## Count divisible pairs in an array

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 »