## Find maximum operations to reduce N to 1

Given two numbers A and B ( A and B can be up to 106 ) which forms a number N = (A!/B!). The task… Read More »

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

Given two numbers A and B ( A and B can be up to 106 ) which forms a number N = (A!/B!). The task… Read More »

Given an integer n. The task is to count the number of operations required to reduce n to 0. In every operation, n can be… Read More »

Given a positive integer n, the task is to check if n is a Non-hypotenuse number or not. If n is a Non-hypotenuse number then… Read More »

Given two integers A and B, the task is to convert A to B with minimum number of following operations: Multiply A by any prime… Read More »

Given two integer and , the task is to find the count of common factors of two numbers where factors are prime. Examples: Input: A… Read More »

Given an array arr[] of non-negative integers where 2 ≤ arr[i] ≤ 106. The task is to find the sum of all those elements from… Read More »

Prime factor is the factor of the given number which is a prime number. Factors are the numbers you multiply together to get another number.… Read More »

Given two positive integers L and R, the task is to count the elements from the range [L, R] whose prime factors are only 2… Read More »

Given two integer and , the task is to find the common prime divisors of these numbers. Examples: Input: A = 6, B = 12… Read More »

Given an array A[] of N non-negative integers. Find an Integer greater than 1, such that maximum array elements are divisible by it. In case… Read More »

Given an integer N, below operations can be performed any number of times on N: Multiply N by any positive integer X i.e. N =… Read More »

Given a number N, find the smallest prime divisor of N. Examples: Input: 25 Output: 5 Input: 31 Output: 31 Recommended: Please try your approach… Read More »

Given a number . The task is to find the largest factor of that number which is a perfect square. Examples: Input : N =… Read More »

Given a positive integer N. The task is to check if N is an unusual number or not. Print ‘YES’ if M is an unusual… 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 »