## Check if product of array containing prime numbers is a perfect square

Given an array arr[] containing only prime numbers, the task is to check if the product of the array elements is a perfect square or… Read More »

- Python program to check whether a number is Prime or not
- Python program to print all Prime numbers in an Interval
- Sum of the first N Prime numbers
- Program to find Prime Numbers Between given Interval
- Sum of all Primes in a given range using Sieve of Eratosthenes
- Delete all Prime Nodes from a Singly Linked List
- Check if a prime number can be expressed as sum of two Prime Numbers
- Sum of all the prime numbers in a given range
- Sort only non-prime numbers of an array in increasing order
- Delete all Prime Nodes from a Circular Singly Linked List
- Length of largest sub-array having primes strictly greater than non-primes
- Largest palindromic prime in an array
- Minimum and Maximum prime numbers in an array
- Find two distinct prime numbers with given product
- Count subarrays with Prime sum
- Numbers less than N which are product of exactly two distinct prime numbers
- Count of Prime Nodes of a Singly Linked List
- Count number of integers less than or equal to N which has exactly 9 divisors
- Sum of all prime numbers in an Array
- Smallest prime number missing in an array
- Find the Product of first N Prime Numbers
- Print all safe primes below N
- Check if the sum of primes is divisible by any prime from the array
- Next smallest prime palindrome
- Find Largest Special Prime which is less than or equal to a given number
- Number of divisors of product of N numbers
- Product of all primes in the range from L to R
- Sort prime numbers of an array in descending order
- Longest Prime Subarray after removing one element
- Number of Co-prime pairs from 1 to N with product equals to N

Given an array arr[] containing only prime numbers, the task is to check if the product of the array elements is a perfect square or… Read More »

Given an integer N ≥ 2, you can split the number as a sum of k integers i.e. N = k1 + k2 + …… Read More »

Given an integer N, the task is to print all the semi-prime numbers ≤ N. A semi-prime number is an integer which can be expressed… 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 positive integer N > 1. Find the maximum count of prime numbers whose sum is equal to given N. Examples: Input : N… Read More »

Given a range [L, R]. The task is to count the numbers in the range having difference between the sum of digits at even position… 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 an integer N, the task is to print N integers ≤ 109 such that no two consecutive of these integers are co-prime and every… Read More »

Given an integer N, the task is to print all the multiplicative primes ≤ N. Multiplicative Primes are the primes such that the product of… Read More »

Given a number N, the task is to find the largest positive integer less than or equal to N/2 which is coprime to N. Note:… Read More »

Given an array arr[] and the task is to print the additive primes in an array. Additive primes: Primes such that the sum of their… Read More »

Given a number a N and the task is to check weather the sum of absolute difference of adjacent digit is a prime or not.… Read More »

Given an array arr[] of distinct elements, the task is to count the total number of distinct pairs in which at least one element is… Read More »

Given an integer N, the task is to print all safe primes below N safe primes. A safe prime is a prime number of the… Read More »