## 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 »

- Largest palindromic prime in an array
- Sum of elements in an array having prime frequency
- Print all safe primes below N
- Number of divisors of product of N numbers
- Check if the sum of primes is divisible by any prime from the array
- Print prime numbers with prime sum of digits in an array
- Sum of element whose prime factors are present in array
- Common prime factors of two numbers
- Count pairs in an array such that at least one element is prime
- Smallest Special Prime which is greater than or equal to a given number
- Sum of all odd factors of numbers in the range [l, r]
- Find maximum operations to reduce N to 1
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- Check whether the sum of prime elements of the array is prime or not
- Find the sum of non-prime elements in the given array
- Largest number not greater than N which can become prime after rearranging its digits
- Print all multiplicative primes <= N
- Sum of all even factors of numbers in the range [l, r]
- Count the numbers < N which have equal number of divisors as K
- Sum of multiplication of triplet of divisors of a number
- Count primes that can be expressed as sum of two consecutive primes and 1
- Find the sum of all Truncatable primes below N
- Check whether N is a Dihedral Prime Number or not
- Count the number of primes in the prefix sum array of the given array
- Find prime number K in an array such that (A[i] % K) is maximum
- Check for an array element that is co-prime with all others
- Count of distinct sums that can be obtained by adding prime numbers from given arrays
- Composite numbers with digit sum 1

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 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 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 »

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 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 two arrays arr1[] and arr2[]. The task is to count the distinct sums that can be obtained while choosing a prime element from arr1[]… Read More »

Given an integer N, the task is to find the sum of all Truncatable primes below N. Truncatable prime is a number which is left-truncatable… Read More »

Given a range [l, r], the task is to find the sum of all the even factors of the numbers from the given range. Examples:… Read More »

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 positive integers where 2 ≤ arr[i] ≤ 106 for all possible values of i. The task is to check whether… Read More »

Given a number N. The task is to find the smallest special prime which is greater than or equal to N. A special prime is… Read More »

Given a number N. The task is to count the number of prime numbers from 2 to N that can be expressed as a sum… Read More »

Given a range [L, R], the task is to find all the numbers from the range which are composite as well as the eventual sum… Read More »