## Smallest Special Prime which is greater than or equal to a given number

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 »

- C Program to Check Whether a Number is Prime or not
- Python program to check whether a number is Prime or not
- Sum of the first N Prime numbers
- Python program to print all Prime numbers in an Interval
- Sum of all Primes in a given range using Sieve of Eratosthenes
- Program to find Prime Numbers Between given Interval
- Sum of all the prime numbers in a given range
- Check if a prime number can be expressed as sum of two Prime Numbers
- Delete all Prime Nodes from a Singly Linked List
- Sort only non-prime numbers of an array in increasing order
- 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
- Delete all Prime Nodes from a Circular Singly Linked List
- Count number of primes in an array
- Find next palindrome prime
- Find two distinct prime numbers with given product
- Numbers less than N which are product of exactly two distinct prime numbers
- Count subarrays with Prime sum
- Check if the sum of primes is divisible by any prime from the array
- Smallest prime number missing in an array
- Count number of integers less than or equal to N which has exactly 9 divisors
- Print all safe primes below N
- Sum of all prime numbers in an Array
- Find Largest Special Prime which is less than or equal to a given number
- Next smallest prime palindrome
- Count of Prime Nodes of a Singly Linked List
- Product of all primes in the range from L to R
- Longest Prime Subarray after removing one element
- Find the Product of first N Prime Numbers

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 »

Given a number N, the task is to check whether the given number is Proth Prime or not. A Proth prime is a Proth Number… 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 a positive integer N, the task is to check if N is a strong prime or not. In number theory, a strong prime is… Read More »

Given a positive integer N, the task is to check if N is a Factorial prime or not. If it is a factorial prime then… Read More »

Given N integers with unknown values (ai > 0) having product P. The task is to find the maximum possible greatest common divisor of these… Read More »