Given an integer N, the task is to find the total number of multiplicative partition for N. Multiplicative Partition: Number of ways of factoring of… Read More

# Tag Archives: divisors

Given an array arr[] representing a list of prime factors of a given number, the task is to find the product of divisors of that… Read More

Given an integer N, the task is to print all proper fractions such that the denominator is less than or equal to N. Proper Fractions:… Read More

Given an integer N. The task is to find the smallest N digit number S, such that S is not divisible by any of its… Read More

Given an integer N. The task is to find a pair of co-prime divisors of N, greater than 1. If such divisors don’t exists then… Read More

Two players are playing a game starting with a number n. In each turn, a player can make any one of the subsequent moves: Divide… Read More

Given a positive integer N, the task is to find the sum of divisors of all the numbers from 1 to N.Examples: Input: N =… Read More

Given an integer N, the task is to count the number of square-free divisors of the given number. A number is said to be square-free,… Read More

Given an integer array arr[] of size N, the task is to find the minimum number of array elements required to be divided by 2,… Read More

Given an array arr[] of N positive integers and the number of queries Q, each query contains two numbers L and R. The task is… Read More

Given two integers N and M, the task is to print all elements in the range [N, M] having at least one odd divisor. Examples:… Read More

A number N is said to be Primitive Abundant Number if N is an Abundant number and all it’s proper divisors are Deficient Numbers. The… Read More

A number N is said to be Multiply-perfect numbers if N divides sigma(N), where sigma(N) = sum of all divisors of N. The first few… Read More

Given a positive integer N, the task is to find the sum of divisors of first N natural numbers. Examples: Input: N = 4 Output: 15 Explanation: Sum… Read More

Given two integers X and Y representing total number of divisors and the number of composite divisors respectively, the task is to check if there… Read More