Skip to content

Tag Archives: sieve

Mersenne Prime is a prime number that is one less than a power of two. In other words, any prime is Mersenne Prime if it… Read More
Given a range L to R, the task is to find the highest occurring digit in prime numbers lie between L and R (both inclusive).… Read More
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 Explanation… 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