## Circular primes less than n

Find all circular primes less than given number n. A prime number is a Circular Prime Number if all of its possible rotations are itself… Read More »

- Sum of the first N Prime numbers
- Check if a prime number can be expressed as sum of two Prime Numbers
- Sum of all the prime numbers in a given range
- Find a number that divides maximum array elements
- Minimum and Maximum prime numbers in an array
- Largest factor of a given number which is a perfect square
- Largest palindromic prime in an array
- 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
- Check if a number is a Trojan Number
- 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
- Sum of element whose prime factors are present in array
- Product of all primes in the range from L to R
- 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 no. of contiguous Prime Numbers in an array
- Count pairs in an array such that at least one element is prime
- Common prime factors of two numbers
- Check if a number is Primorial Prime or not
- Product of all prime numbers in an Array
- Numbers in range [L, R] such that the count of their divisors is both even and prime
- Smallest Special Prime which is greater than or equal to a given number

Find all circular primes less than given number n. A prime number is a Circular Prime Number if all of its possible rotations are itself… Read More »

A Sphenic Number is a positive integer n which is product of exactly three distinct primes. The first few sphenic numbers are 30, 42, 66,… Read More »

A number n is called Equidigital if the number of digits in the prime factorization of n (including powers) is same as number of digits… Read More »

Given an array of limits. For every limit, find the prime number which can be written as the sum of the most consecutive primes smaller… Read More »

Emirp is the word “prime” spelled backwards, and it refers to a prime number that becomes a new prime number when you reverse its digits.… Read More »

Given a number n, the task is to find out whether this number is smith or not. A Smith Number is a composite number whose… Read More »

Given a Number n such that 1 <= N <= 10^6, the Task is to Find the LCM of First n Natural Numbers. Examples: Input… Read More »

Given an array arr[] such that 1 <= arr[i] <= 10^12, the task is to find prime factors of LCM of array elements. Examples: Input… Read More »

You are given a number n ( 3 <= n < 10^6 ) and you have to find nearest prime less than n? Examples: Input… Read More »

Given a number n find the smallest number evenly divisible by each number 1 to n. Examples: Input : n = 4 Output : 12… Read More »

Given Q queries, of type: L R, for each query you must print the maximum number of divisors that a number x (L <= x… Read More »

You are given two numbers a and b (1 <= a,b <= 10^8 ) and n. The task is to find all numbers between a… Read More »

Given a number n, find n’th smart number (1<=n<=1000). Smart number is a number which has at least three distinct prime factors. We are given… Read More »

Given a number n, print least prime factors of all numbers from 1 to n. The least prime factor of an integer n is the… Read More »

Given a number N, print all its unique prime factors and their powers in N. Examples: Input: N = 100 Output: Factor Power 2 2… Read More »