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

## Repeated Unit Divisibility

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 »

## Check a number is odd or even without modulus operator

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

## Making zero array by decrementing pairs of adjacent

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 »

## Check whether a very large number of the given form is a multiple of 3.

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 »

## Almost Perfect Number

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 »