## First element of every K sets having consecutive elements with exactly K prime factors less than N

Given two integers N and K, the task is to find the first element for every set of K consecutive elements which have exactly K… Read More »

- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Minimum window size containing atleast P primes in every window of given range
- Find the minimum number to be added to N to make it a prime number
- Find the position of the given Prime Number
- Count of subarrays having exactly K prime numbers
- Find the largest composite number that divides N but is strictly lesser than N
- Trial division Algorithm for Prime Factorization
- Permutation of first N positive integers such that prime numbers are at prime indices
- Nodes with prime degree in an undirected Graph
- Count of all prime weight nodes between given nodes in the given Tree
- Group all co-prime numbers from 1 to N
- Check if all nodes of the Binary Tree can be represented as sum of two primes
- Print all Co-Prime Levels of a Binary Tree
- Sum of factorials of Prime numbers in a Linked list
- Count Sexy Prime Pairs in the given array
- Program to find the LCM of two prime numbers
- Count of the non-prime divisors of a given number
- Longest sub-array of Prime Numbers using Segmented Sieve
- Permutation of first N positive integers such that prime numbers are at prime indices | Set 2
- Modify array by merging elements with addition such that it consists of only Primes.
- Check if a number is Prime, Semi-Prime or Composite for very large numbers
- Count the number of Prime Cliques in an undirected graph
- Wheel Factorization Algorithm
- Minimize the cost of selecting two numbers whose product is X
- Count of Prime digits in a Number
- Count of cells in a matrix whose adjacent cells's sum is prime Number
- Check if N is a Weak Prime number or not
- Check if all Prime factors of number N are unique or not
- Count of subsequences which consists exactly K prime numbers
- Check if the number is a Prime power number

Given two integers N and K, the task is to find the first element for every set of K consecutive elements which have exactly K… Read More »

Given an array arr[] containing repetitive prime and nonprime numbers, the task is to find the prime numbers occurring only once. Examples: Input: arr[] =… Read More »

Given an array of integers arr[], the task is to count the minimum number of changes required to convert each array element to its nearest… Read More »

Given two integers L and R, the task is to find the count of total numbers of prime numbers in the range [L, R] whose… Read More »

Given a number X, the task is to find the minimum number N such that the sum of the count of all factors from 1… Read More »

Given a matrix A[][] of size N*M, the task is to check if the given matrix satisfies the following two conditions or not: Sum of… Read More »

Given two N-digit prime numbers A and B, the task is to find the minimum number of steps taken to convert A to B. Condition… Read More »

The security of the RSA algorithm is based on the difficulty of factorizing very large numbers. The setup of an RSA cryptosystem involves the generation… Read More »

Given a string str that represents a number. The task is to find all possible ways to split the given string such that each segment… Read More »

A Tetradic Primes are prime numbers that are also tetradic number. A tetradic Number is a palindromic number containing only 0, 1, and 8 as… Read More »

Woodall Primes are prime numbers that are also Woodall number. Find the Woodall prime numbers less than N Given a number N, print all Woodall… Read More »

Super-Poulet number is a Poulet number (pseudoprime) to base 2 if each and every divisor D divides . Some of the super-poulet numbers are: 341,… Read More »

Brilliant Number is a number N which is product of two primes with same number of digits. Few Brilliant numbers are: 4, 6, 9, 10,… Read More »

A number N is said to be Multiply-perfect numbers if N divides sigma(N), where sigma(N) = sum of all divisors of N. The first few… Read More »

Given a positive integer N, the task is to find the total number of distinct power of prime factor of the given number N. Examples:… Read More »