## Sub array sum is prime or not

Given an array and limits (lower and upper limits), check the sum of the subarray in the given limit is prime or not Examples :… Read More »

- Primality Test | Set 3 (Miller–Rabin)
- Print all prime numbers less than or equal to N
- Product of unique prime factors of a number
- Length of largest sub-array having primes strictly greater than non-primes
- C Program to Check Whether a Number is Prime or not
- N expressed as sum of 4 prime numbers
- Queries of nCr%p in O(1) time complexity
- Find next palindrome prime
- Check whether a number is circular prime or not
- Number of Co-prime pairs from 1 to N with product equals to N
- Product of all primes in the range from L to R
- Check whether a number has exactly three distinct factors or not
- Count number of primes in an array
- Check whether the given number is Wagstaff prime or not
- Numbers less than N which are product of exactly two distinct prime numbers
- Count number of integers less than or equal to N which has exactly 9 divisors
- Find two distinct prime numbers with given product
- Sum of the first N Prime numbers
- Sum of all the prime divisors of a number
- Sort prime numbers of an array in descending order
- Delete all Prime Nodes from a Singly Linked List
- Sum of every K’th prime number in an array
- Check if a number is Quartan Prime or not
- Check whether the given number is Euclid Number or not
- Find four factors of N with maximum product and sum equal to N | Set 3
- Composite Number
- Sub array sum is prime or not
- Number of prime pairs in an array
- Sum of every K'th prime number in an array
- Number which has the maximum number of distinct prime factors in the range M to N

Given an array and limits (lower and upper limits), check the sum of the subarray in the given limit is prime or not Examples :… 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 »

It has been said that “Great engineering strikes a balance between competing objectives.” I believe this to be true, in both mechanical and software engineering.… Read More »

Given a number n, we need to find the sum of each digits of the number till the number becomes a single digit. We need… Read More »

A Pierpont Prime is a prime number of the form p = 2l.3k + 1. First few Pierpont prime numbers are 2, 3, 5, 7,… Read More »

Express a given number as a summation of 4 positive primes. If it is not possible to express then print “-1”. Examples: Input: 24 Output:… Read More »

Given a positive integer n(1 <= n <= 1018). Check whether a number has exactly three distinct factors or not. Print “Yes” if it has… Read More »

We are given a number n. Our task is to check whether the number is circular prime or not. Circular Prime : A prime number… Read More »

A composite number is a positive integer that is not prime. In other words, it has a positive divisor other than one or itself. First… Read More »

Given a number n, check if it is prime or not. We have introduced and discussed School and Fermat methods for primality testing. Primality Test… Read More »