Print all possible pair with prime XOR in the Array
Given an array arr[] of N positive integers. The task is to print all possible pairs such that their XOR is a Prime Number. Examples:… Read More »
Tag Archives: Prime Number
Check if all Prime factors of number N are unique or not
Given a number N. The task is to check whether the given number N has unique prime factors or not. If yes then print YES… Read More »
Minimum number of primes required such that their sum is equal to N
Given a positive integer N greater than 1, the task is to find the minimum count of Prime Numbers whose sum is equal to given… Read More »
Longest sub-array of Prime Numbers using Segmented Sieve
Given an array arr[] of N integers, the task is to find the longest subarray where all numbers in that subarray are prime. Examples: Input:… Read More »
Minimum splits required to convert a number into prime segments
Given a number in the form of a string s, the task is to calculate and display minimum splits required such that the segments formed… Read More »
Wheel Factorization Algorithm
Given a number N. The task is to check if the given number is Prime Number or not. Examples: Input: N = 987 Output: Not… Read More »
Count twin prime pairs in an Array
Given an array arr[] of N natural numbers. The task is to count all possible pairs in the arr[] that are Twin Primes. A Twin… Read More »
Find the largest composite number that divides N but is strictly lesser than N
Given a composite number N, the task is to find the largest composite number that divides N and is strictly lesser than N. If there… Read More »
Sum of Maximum and Minimum prime factor of every number in the Array
Given an array arr[], the task is to find the sum of the maximum and the minimum prime factor of every number in the given… Read More »
Check if a number is Prime, Semi-Prime or Composite for very large numbers
Given a very large number N (> 150), the task is to check whether this number is Prime, Semi-Prime or Composite. Example: Input: N =… Read More »
Find three prime numbers with given sum
Given an integer N, the task is to find three prime numbers X, Y and Z such that the sum of these three numbers is… Read More »
How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
Pre-requisite: Sieve of Eratosthenes What is Sieve of Eratosthenes algorithm? In order to analyze it, let’s take a number n and the task is to… Read More »
Prime Numbers present at Kth level of a Binary Tree
Given a number K, the task is to print the prime numbers present at that level given all the prime numbers are represented in the… Read More »
Remove all the prime numbers from the given array
Given an array arr[] of N integers, the task is to remove all the prime numbers. Examples: Input: arr[] = {4, 6, 5, 3, 8,… Read More »
Check if there exists a prime number which gives Y after being repeatedly subtracted from X
Given two integers X and Y where X > Y, the task is to check if there exists an prime number P such that if… Read More »
