## Ways to express a number as product of two different factors

Given a number n, write a program to calculate number of ways in which number can be expressed as product of two different factors. Examples… Read More »

- Find a number that divides maximum array elements
- Largest factor of a given number which is a perfect square
- Smallest prime divisor of a number
- Count number of integers less than or equal to N which has exactly 9 divisors
- Check whether a number is Non-hypotenuse number
- Sum of element whose prime factors are present in array
- Prime Factor
- Count common prime factors of two numbers
- Common prime factors of two numbers
- Count numbers from range whose prime factors are only 2 and 3
- Count all the numbers less than 10^6 whose minimum prime factor is N
- Find maximum operations to reduce N to 1
- Count operations of the given type required to reduce N to 0
- Minimize the value of N by applying the given operations
- Find the largest good number in the divisors of given number N
- Minimum prime number operations to convert A to B
- Check if a number is an Unusual Number or not

Given a number n, write a program to calculate number of ways in which number can be expressed as product of two different factors. Examples… Read More »

Given a positive integer n(1 <= n <= 1018). Check whether a number has exactly three distinct factors or not. Print “Yes” if it has… Read More »

Given a number n, find the product of all factors of n. Since the product can be very large answer it modulo 10^9 + 7.… Read More »

Given an array with N elements, task is to find the count of factors of a number X which is product of all array elements.… Read More »

Given a positive integer n, we have to find the total number of divisors for n. Examples: Input : n = 25 Output : 3… Read More »

Given a number N, find the maximum number of unique prime factors any number can have in range [1, N]. Examples: Input : N =… Read More »

Given a number, find minimum sum of its factors. Examples: Input : 12 Output : 7 Explanation: Following are different ways to factorize 12 and… Read More »

Factor Tree is an intuitive method to understand factors of a number. It shows how all the factors are been derived from the number. It… Read More »

Given an array of natural numbers count the sum of its proper divisors for every element in array. Input : int arr[] = {8, 13,… Read More »

Given a number N, print all numbers in range from 1 to N having exactly 3 divisors. Examples: Input : N = 16 Output :… Read More »

Given an array of integers. Find the total number of subarrays whose product of all elements doesn’t contain repeating prime factor in prime decomposition of… Read More »

Given a number N. You are tasked with finding the smallest number S, such that N is a factor of S! (S factorial). N can… Read More »

Given a positive number n, we need to print exactly k positive numbers (all greater than 1) such that product of those k numbers is… Read More »

Given n doors and n persons. The doors are numbered 1 to n and persons are given id’s numbered 1 to n. Each door can… Read More »

Given an integer n. Find politeness of number n. Politeness of a number is defined as the number of ways it can be expressed as… Read More »