## Print all multiplicative primes <= N

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 »

- Sum of the first N Prime numbers
- Largest factor of a given number which is a perfect square
- Sum of all the prime numbers in a given range
- Check if is possible to get given sum from a given set of elements
- Find a number that divides maximum array elements
- Largest palindromic prime in an array
- Minimum and Maximum prime numbers in an array
- Sum of all Primes in a given range using Sieve of Eratosthenes
- Count number of primes in an array
- Check if a prime number can be expressed as sum of two Prime Numbers
- Check if the sum of primes is divisible by any prime from the array
- Sum of element whose prime factors are present in array
- Count number of integers less than or equal to N which has exactly 9 divisors
- Find two distinct prime numbers with given product
- Smallest prime number missing in an array
- Lexicographically largest prime path from top-left to bottom-right in a matrix
- Product of all primes in the range from L to R
- Check if a number is a Trojan Number
- Sum of all prime numbers in an Array
- Longest Prime Subarray after removing one element
- Number of divisors of product of N numbers
- Print all safe primes below N
- Sum of elements in an array having prime frequency
- Find the Product of first N Prime Numbers
- Sort prime numbers of an array in descending order
- Check if a number is Primorial Prime or not
- Sum of every K’th prime number in an array
- Count all the numbers less than 10^6 whose minimum prime factor is N
- Maximum no. of contiguous Prime Numbers in an array
- Sum and product of k smallest and k largest prime numbers in the array

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

Given an array arr[] and the task is to print the sum of the non-prime elements from the array. Examples: Input: arr[] = {1, 3,… Read More »

Given an array arr[] of integers, the task is to count the number of divisors of product of all the elements from given array. Examples:… 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 »

Given an array arr[] of integers, the task is to print the largest palindromic prime from the array. If no element from the array is… Read More »

Given two integers N and K, the task is to count all the numbers < N which have equal number of positive divisors as K.… Read More »

Given an array arr[], the task is to check whether the sum of primes in the array is divisible by any of the primes in… Read More »

Given an array arr, the task is to find the sum of the elements which have prime frequencies in the array. Note: 1 is neither… 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 having N elements. The task is to check if the sum of prime elements of the array is prime or not. Examples:… Read More »

Given a prime number . The task is to check if it is possible to express as sum of two separate prime numbers. Note: The… Read More »

Given an array containing n distinct numbers. The task is to find the smallest prime which is not present in the array. Note: If there… Read More »