## Twin Prime Numbers between 1 and n

Given an integer n. we need to print all twin prime number pairs between 1 to n. A Twin prime are those numbers which are… 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
- 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
- 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
- Maximum no. of contiguous Prime Numbers in an array
- Count pairs in an array such that at least one element is prime
- Minimum absolute difference of a number and its closest prime
- Print numbers such that no two consecutive numbers are co-prime and every three consecutive numbers are co-prime
- Absolute difference between the Product of Non-Prime numbers and Prime numbers of an Array
- Check if a number is Primorial Prime or not

Given an integer n. we need to print all twin prime number pairs between 1 to n. A Twin prime are those numbers which are… Read More »

In mathematics, Bertrand’s Postulate states that there is a prime number in the range to where n is a natural number and n >= 4.… Read More »

In mathematics, Rosser’s Theorem states that the nth prime number is greater than the product of n and natural logarithm of n for all n… Read More »

Given L and R, find a possible non transitive triplet (a, b, c) such that pair (a, b) is coprime and pair (b, c) is… Read More »

It says that there is always one prime number between any two consecutive natural number’s(n = 1, 2, 3, 4, 5, …) square. This is… Read More »

Sum Rule – If a task can be done in one of ways or one of ways, where none of the set of ways is… Read More »

Given a number n, we need to find the product of all of its unique prime factors. Prime factors: It is basically a factor of… Read More »

Given two numbers N and M. Find the number of ways in which factorial N can be expressed as a sum of two or more… Read More »

Given a number n, we need to find the product of all prime numbers between 1 to n. Examples: Input: 5 Output: 30 Explanation: product… Read More »

A Fortunate number is the smallest integer m > 1 such that, for a given positive integer n, pn + m is a prime number.… Read More »

Any odd integer greater than 5 can be expressed as a sum of an odd prime (all primes other than 2 are odd) and an… Read More »

Given two integers n and m, task is to find a number p which satisfy following conditions : -> The number p should be less… Read More »

Given three numbers sum S, prime P and N, find all N prime numbers after prime P such that their sum is equal to S.… Read More »

In this article we will discuss about Lucas-Lehmer series which is used to check primality of prime numbers of the form 2p – 1 where… Read More »

Given a range [L, R], and a prime number P. We are required to find the sum of the highest power of P in all… Read More »