# Tag Archives: divisors

Given a range [l, r], the task is to find the sum of all the odd factors of the numbers from the given range. Examples:… Read More
Given an array arr[] of integers, the task is to find the element (other than 1) which is the factor of maximum number of elements… Read More
Given two positive integers N and M, the task is to find the smallest positive integer which is divisible by N and whose digit sum… Read More
Given an integer N. The task is to find the maximum possible sum of intermediate values (Including N and 1) attained after applying the beow… Read More
Given an array of N numbers which has all divisors of two numbers in any order. The task is to find the two numbers whose… Read More
Given a number N. The task is to express N as sum two Abundant Numbers. If it is not possible print -1. Examples: Input :… Read More
Given a number N. FInd the sum of he all amicable numbers up to N. If A and B are Amicable pairs (Two numbers are… Read More
Given an array arr[] of integers, the task is to count the number of divisors of product of all the elements from given array. Examples:… Read More
Given two integers N and K, the task is to count all the numbers < N which have equal number of positive divisors as K.… Read More
You are given a range of numbers, from lower number to higher number (both inclusive). Consider all the factors of these numbers except 1, the… Read More
Given a positive integer, N. Find the largest divisor of the given number that is not divisible by a perfect square greater than 1. Examples: … Read More
Given two strings, the task is to check whether the frequencies of a character(for each character) in one string is a multiple or a factor… Read More
Given an interval of integers [A, B]. For each number in this interval compute its greatest odd divisor. Output the sum of these divisors. Examples:… Read More
Given a number N(1<=N<=109), the task is to find the total number of integers less than equal to n which have exactly 9 divisors. Examples:… Read More
Given a number N, find the first triangular number whose number of divisors exceeds N. Triangular numbers are sums of natural numbers, i. e., of… Read More