## Check if each element of the given array is the product of exactly K prime numbers

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

- Program to find the Nth Prime Number
- Generate elements of the array following given conditions
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Check if each element of the given array is the product of exactly K prime numbers
- Find the sum of the ascii values of characters which are present at prime positions
- Check if the given string is vowel prime
- Find a sequence of N prime numbers whose sum is a composite number
- Generate N integers satisfying the given conditions
- Find out the prime numbers in the form of A+nB or B+nA
- Number of 0s and 1s at prime positions in the given array
- Find prime numbers in the first half and second half of an array
- Product of Primes of all Subsets
- Sum of numbers in a range [L, R] whose count of divisors is prime
- Minimum operations required to convert X to Y by multiplying X with the given co-primes
- Ramanujan Prime
- Sum of Semi-Prime Numbers less than or equal to N
- XOR of elements in an array having prime frequency
- Program to find the next prime number
- Triangle of numbers arising from Gilbreath's conjecture
- Queries for the difference between the count of composite and prime numbers in a given range
- Find the sum of prime numbers in the Kth array
- Find the prime P using given four integers
- Find all numbers between range L to R such that sum of digit and sum of square of digit is prime
- Check if the first and last digit of number N is prime and their sum is less than K
- Find the XOR of first N Prime Numbers
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Sum of prime numbers without odd prime digits
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Partition first N natural number into two sets such that their sum is not coprime

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

Given three integers N, R and P where P is prime, the task is to find whether NCR is divisible by P or not. Examples:… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose weight is prime. Examples: Input:… Read More »

Given an array arr[] of N positive integers and a non negative integer K. The task is to delete exactly K sub-arrays from the array… Read More »

Given an array arr[] of 1’s and 2’s, the task is to re-arrange the array in such a way that the prefix sum of the… Read More »

Given an array arr[] of N integers, the task is to count the number of primes in the prefix sum array of the given array.… Read More »

Given an array arr[] of n integers. The task is to find an element from the array K such that K is prime. And, arr[i]… Read More »

Apart from Sieve of Eratosthenes method to generate Prime numbers, we can implement a new Algorithm for generating prime numbers from 1 to N. It… Read More »

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 a number N, the task is to find the largest number less than or equal to the given number N such that on rearranging… Read More »

Given an integer N, the task is to check if N is a Dihedral prime number or not. A Dihedral prime is a prime number… Read More »

Given an integer N, the task is to check whether the product of first N natural numbers is divisible by the sum of first N… Read More »

Given an array arr[] of size N. The task is to find the length of the longest subsequence from the given array such that the… Read More »

Given a number ‘N’. Check whether factorial of ‘N’ is divisible by the sum of first ‘N’ natural numbers or not? If divisibility is possible,… Read More »

Given an integer N, the task is to find whether fact(N) is divisible by sum(N) where fact(N) is the factorial of N and sum(N) =… Read More »