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 »
Tag Archives: Prime Number
Non-repeating Primes
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 »
Minimum changes required to make all Array elements Prime
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 »
Count all prime numbers in a given range whose sum of digits is also prime
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 »
Minimise N such that sum of count of all factors upto N is greater than or equal to X
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 »
Check if the Matrix follows the given constraints or not
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 »
Min steps to convert N-digit prime number into another by replacing a digit in each step
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 »
How to generate Large Prime numbers for RSA Algorithm
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 »
Find all possible ways to Split the given string into Primes
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 »
Tetradic Primes
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
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
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 Numbers
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 »
Multiply perfect number
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 »
Count of distinct power of prime factor of N
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 »
