## Kth prime number greater than N

Given a number N, the task is to print the Kth prime number greater than N. Note: N and K are so given such that… Read More »

- Sum of the first N Prime numbers
- Program to find Prime Numbers Between given Interval
- Check if a prime number can be expressed as sum of two Prime Numbers
- Sum of all the prime numbers in a given range
- Delete all Prime Nodes from a Circular Singly Linked List
- Sort only non-prime numbers of an array in increasing order
- Minimum and Maximum prime numbers in an array
- Largest palindromic prime in an array
- Count subarrays with Prime sum
- Count number of integers less than or equal to N which has exactly 9 divisors
- Count of Prime Nodes of a Singly Linked List
- Find the Product of first N Prime Numbers
- Smallest prime number missing in an array
- Sum of all prime numbers in an Array
- Next smallest prime palindrome
- Print all safe primes below N
- Check if the sum of primes is divisible by any prime from the array
- Find Largest Special Prime which is less than or equal to a given number
- Sum of elements in an array having prime frequency
- Sort prime numbers of an array in descending order
- Number of divisors of product of N numbers
- Product of all primes in the range from L to R
- Find count of Almost Prime numbers from 1 to N
- Print prime numbers with prime sum of digits in an array
- Pair of prime numbers with a given sum and minimum absolute difference
- Sum and product of k smallest and k largest prime numbers in the array
- Maximum GCD of N integers with given product
- Minimum absolute difference of a number and its closest prime
- Count pairs in an array such that at least one element is prime
- Maximum no. of contiguous Prime Numbers in an array

Given a number N, the task is to print the Kth prime number greater than N. Note: N and K are so given such that… Read More »

Given an array of integers where all the elements are less than 10^6. The task is to find the difference between the largest and the… Read More »

Given a positive integer . The task is to represent it as a sum of the maximum possible number of prime numbers. (N > 1)… Read More »

Given a range [L, R], the task is to find the numbers from the range which have the count of their divisors as even as… Read More »

Given two positive integer n1 and n2, the task is to check if both are Cousin primes or not. Print ‘YES’ if the both the… Read More »

Given an array of integers (less than 10^6), the task is to find the sum of all the prime numbers which appear after every (k-1)… Read More »

Given a positive integer n, the task is to check if it is a Chen prime number. If the given number is a Chen Prime… Read More »

Given an array arr[] of N positive integers. The task is to write a program to find the sum of all prime elements in the… Read More »

Given a circular singly linked list containing N nodes. The task is to delete all nodes from the list which are prime. Examples: Input :… Read More »

Given an array arr[] of N positive integers. The task is to write a program to find the product of all the prime numbers of… Read More »

Given a positive number n, the task is to check whether the given number is Interprime or not. If the given number is Interprime print… Read More »

Given a range [l, r], the task is to find the sum of all the prime numbers within that range. Examples: Input : l=1 and… Read More »

Given a range of integer from ‘a’ to ‘b’ . Our task is to calculate the amount of numbers from the interval [ a, b… Read More »

Given a positive integer n, the task is to check if it is Euclid Number or not. Print ‘YES’ if the given number is Euclid… Read More »

Given a positive integer n, the task is to check if it is a Wagstaff prime or not. Print ‘YES’ if the given number is… Read More »