## Print all numbers whose set of prime factors is a subset of the set of the prime factors of X

Given a number X and an array of N numbers. The task is to print all the numbers in the array whose set of prime… Read More »

- Prime Factor
- Check whether a number is Non-hypotenuse number
- Count common prime factors of two numbers
- Sum of element whose prime factors are present in array
- Common prime factors of two numbers
- Count numbers from range whose prime factors are only 2 and 3
- Find maximum operations to reduce N to 1
- Count operations of the given type required to reduce N to 0
- Minimum prime number operations to convert A to B
- Sum of multiplication of triplet of divisors of a number
- Count arrays of length K whose product of elements is same as that of given array
- Print all numbers whose set of prime factors is a subset of the set of the prime factors of X
- Check for an array element that is co-prime with all others

Given a number X and an array of N numbers. The task is to print all the numbers in the array whose set of prime… Read More »

Given an integer array arr[] of length N and an integer K, the task is to count the number of possible arrays of length K… Read More »

Given an array arr[] of integers of size n. For each element, you have to print the summation of multiplication of every triplet formed using… Read More »

Given an array arr[] of positive integers where 2 ≤ arr[i] ≤ 106 for all possible values of i. The task is to check whether… Read More »

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 »