Wheel Factorization Algorithm
Last Updated :
26 Nov, 2021
Given a number N. The task is to check if the given number is Prime Number or not.
Examples:
Input: N = 987
Output: Not a Prime Number
Explanation:
As, 987 = 3*7*47. Therefore 987 is not a prime number.
Input: N = 67
Output: Prime Number
Wheel Factorization Method:
Wheel Factorization is the improvement of the method Sieve of Eratosthenes. For wheel factorization, one starts from a small list of numbers, called the basis — generally the first few prime numbers, then one generates the list, called the wheel, of the integers that are coprime with all numbers of the basis. Then to find the smallest divisor of the number to be factorized, one divides it successively by the numbers on the basis, and in the wheel.
Let say we select basis as {2, 3, 5} and the numbers which are coprime to the basis are {7, 11, 13, 17, 19, 23, 29, 31} are set as the wheel.
To understand it more, see the pattern in the above image that the numbers exhibit. The LCM of the first three Prime Numbers is 30. The numbers(less than 30) which are ending with 7, 1, and 3 and are not a multiple of 2, 3, and 5 and are always prime i.e {7, 11, 13, 17, 19, 23, 29}. Adding the no. 31 to this list and then if we add multiples of 30 to any of the numbers in the list, it gives us a Prime Number.
Algorithm for Wheel Factorization Method:
For the number N to be Prime or not:
bool isPrime(x) {
if (x < 2) {
return False;
}
for N in {2, 3, 5} {
return False;
}
for p= [0, sqrt(N)] such that p = p + 30: {
for c in [p+7, p+11, p+13, p+17, p+19, p+23, p+29, p+31] {
if c > sqrt(N)
break;
else if N % (c+p) = 0:
return False;
}
}
}
return True;
}
Approach:
Following is the approach for the above algorithm:
- For Primality Test of a given Number N, check if the given number is divisible by any of the number 2, 3, 5 or not.
- If the number is not divisible by any of 2, 3, 5, then check if the number formed by adding multiples of 30 in the list [7, 11, 13, 17, 19, 23, 29, 31] divides the given number N or not. If Yes then the given number is not Prime Number, else it is a Prime Number.
Below is the implementation of the above approach:
C++
// C++ program to check if the
// given number is prime using
// Wheel Factorization Method
#include "bits/stdc++.h"
using namespace std;
// Function to check if a given
// number x is prime or not
void isPrime(int N)
{
bool isPrime = true;
// The Wheel for checking
// prime number
int arr[8] = { 7, 11, 13, 17,
19, 23, 29, 31 };
// Base Case
if (N < 2) {
isPrime = false;
}
// Check for the number taken
// as basis
if (N % 2 == 0 || N % 3 == 0
|| N % 5 == 0) {
isPrime = false;
}
// Check for Wheel
// Here i, acts as the layer
// of the wheel
for (int i = 0; i < sqrt(N); i += 30) {
// Check for the list of
// Sieve in arr[]
for (int c : arr) {
// If number is greater
// than sqrt(N) break
if (c > sqrt(N)) {
break;
}
// Check if N is a multiple
// of prime number in the
// wheel
else {
if (N % (c + i) == 0) {
isPrime = false;
break;
}
}
// If at any iteration
// isPrime is false,
// break from the loop
if (!isPrime)
break;
}
}
if (isPrime)
cout << "Prime Number";
else
cout << "Not a Prime Number";
}
// Driver's Code
int main()
{
int N = 121;
// Function call for primality
// check
isPrime(N);
return 0;
}
// Java program to check if the
// given number is prime using
// Wheel Factorization Method
import java.util.*;
class GFG{
// Function to check if a given
// number x is prime or not
static void isPrime(int N)
{
boolean isPrime = true;
// The Wheel for checking
// prime number
int []arr = { 7, 11, 13, 17,19, 23, 29, 31 };
// Base Case
if (N < 2) {
isPrime = false;
}
// Check for the number taken
// as basis
if (N % 2 == 0 || N % 3 == 0
|| N % 5 == 0) {
isPrime = false;
}
// Check for Wheel
// Here i, acts as the layer
// of the wheel
for (int i = 0; i < Math.sqrt(N); i += 30) {
// Check for the list of
// Sieve in arr[]
for (int c : arr) {
// If number is greater
// than sqrt(N) break
if (c > Math.sqrt(N)) {
break;
}
// Check if N is a multiple
// of prime number in the
// wheel
else {
if (N % (c + i) == 0) {
isPrime = false;
break;
}
}
// If at any iteration
// isPrime is false,
// break from the loop
if (!isPrime)
break;
}
}
if (isPrime)
System.out.println("Prime Number");
else
System.out.println("Not a Prime Number");
}
// Driver's Code
public static void main(String args[])
{
int N = 121;
// Function call for primality
// check
isPrime(N);
}
}
// This code is contributed by Surendra_Gangwar
// C# program to check if the
// given number is prime using
// Wheel Factorization Method
using System;
class GFG{
// Function to check if a given
// number x is prime or not
static void isPrime(int N)
{
bool isPrime = true;
// The Wheel for checking
// prime number
int []arr = { 7, 11, 13, 17,19, 23, 29, 31 };
// Base Case
if (N < 2) {
isPrime = false;
}
// Check for the number taken
// as basis
if (N % 2 == 0 || N % 3 == 0
|| N % 5 == 0) {
isPrime = false;
}
// Check for Wheel
// Here i, acts as the layer
// of the wheel
for (int i = 0; i < (int)Math.Sqrt(N); i += 30) {
// Check for the list of
// Sieve in arr[]
foreach (int c in arr) {
// If number is greater
// than sqrt(N) break
if (c > (int)Math.Sqrt(N)) {
break;
}
// Check if N is a multiple
// of prime number in the
// wheel
else {
if (N % (c + i) == 0) {
isPrime = false;
break;
}
}
// If at any iteration
// isPrime is false,
// break from the loop
if (!isPrime)
break;
}
}
if (isPrime)
Console.WriteLine("Prime Number");
else
Console.WriteLine("Not a Prime Number");
}
// Driver's Code
public static void Main(String []args)
{
int N = 121;
// Function call for primality
// check
isPrime(N);
}
}
// This code is contributed by Yash_R
# Python3 program to check if the
# given number is prime using
# Wheel Factorization Method
import math
# Function to check if a given
# number x is prime or not
def isPrime( N):
isPrime = True;
# The Wheel for checking
# prime number
arr= [ 7, 11, 13, 17,
19, 23, 29, 31 ]
# Base Case
if (N < 2) :
isPrime = False
# Check for the number taken
# as basis
if (N % 2 == 0 or N % 3 == 0
or N % 5 == 0):
isPrime = False
# Check for Wheel
# Here i, acts as the layer
# of the wheel
for i in range(0,int(math.sqrt(N)), 30) :
# Check for the list of
# Sieve in arr[]
for c in arr:
# If number is greater
# than sqrt(N) break
if (c > int(math.sqrt(N))):
break
# Check if N is a multiple
# of prime number in the
# wheel
else :
if (N % (c + i) == 0) :
isPrime = False
break
# If at any iteration
# isPrime is false,
# break from the loop
if (not isPrime):
break
if (isPrime):
print("Prime Number")
else:
print("Not a Prime Number")
# Driver's Code
if __name__ == "__main__":
N = 121
# Function call for primality
# check
isPrime(N)
# This code is contributed by chitranayal
<script>
// JavaScript program to check if the
// given number is prime using
// Wheel Factorization Method
// Function to check if a given
// number x is prime or not
function isPrime(N)
{
let isPrime = true;
// The Wheel for checking
// prime number
let arr = [ 7, 11, 13, 17,
19, 23, 29, 31 ];
// Base Case
if (N < 2) {
isPrime = false;
}
// Check for the number taken
// as basis
if (N % 2 == 0 || N % 3 == 0
|| N % 5 == 0) {
isPrime = false;
}
// Check for Wheel
// Here i, acts as the layer
// of the wheel
for (let i = 0; i < Math.sqrt(N); i += 30) {
// Check for the list of
// Sieve in arr[]
for (let c of arr) {
// If number is greater
// than sqrt(N) break
if (c > Math.sqrt(N)) {
break;
}
// Check if N is a multiple
// of prime number in the
// wheel
else {
if (N % (c + i) == 0) {
isPrime = false;
break;
}
}
// If at any iteration
// isPrime is false,
// break from the loop
if (!isPrime)
break;
}
}
if (isPrime)
document.write("Prime Number");
else
document.write("Not a Prime Number");
}
// Driver's Code
let N = 121;
// Function call for primality
// check
isPrime(N);
// This code is contributed by _saurabh_jaiswal
</script>
Output: Not a Prime Number
Time Complexity: O(N3/2)
Auxiliary Space: O(1)
Similar Reads
Check for Prime Number Given a number n, check whether it is a prime number or not.Note: A prime number is a number greater than 1 that has no positive divisors other than 1 and itself.Input: n = 7Output: trueExplanation: 7 is a prime number because it is greater than 1 and has no divisors other than 1 and itself.Input: n
11 min read
Primality Test Algorithms
Introduction to Primality Test and School MethodGiven a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive divisors other than 1 and itself. Examples of the first few prime numbers are {2, 3, 5, ...}Examples : Input: n = 11Output: trueInput: n = 15Output: falseInput: n = 1Output:
10 min read
Fermat Method of Primality TestGiven a number n, check if it is prime or not. We have introduced and discussed the School method for primality testing in Set 1.Introduction to Primality Test and School MethodIn this post, Fermat's method is discussed. This method is a probabilistic method and is based on Fermat's Little Theorem.
10 min read
Primality Test | Set 3 (Miller–Rabin)Given a number n, check if it is prime or not. We have introduced and discussed School and Fermat methods for primality testing.Primality Test | Set 1 (Introduction and School Method) Primality Test | Set 2 (Fermat Method)In this post, the Miller-Rabin method is discussed. This method is a probabili
15+ min read
Solovay-Strassen method of Primality TestWe have already been introduced to primality testing in the previous articles in this series. Introduction to Primality Test and School MethodFermat Method of Primality TestPrimality Test | Set 3 (Miller–Rabin)The Solovay–Strassen test is a probabilistic algorithm used to check if a number is prime
13 min read
Lucas Primality TestA number p greater than one is prime if and only if the only divisors of p are 1 and p. First few prime numbers are 2, 3, 5, 7, 11, 13, ...The Lucas test is a primality test for a natural number n, it can test primality of any kind of number.It follows from Fermat’s Little Theorem: If p is prime and
12 min read
Sieve of Eratosthenes Given a number n, find all prime numbers less than or equal to n.Examples:Input: n = 10Output: [2, 3, 5, 7]Explanation: The prime numbers up to 10 obtained by Sieve of Eratosthenes are [2, 3, 5, 7].Input: n = 35Output: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31]Explanation: The prime numbers up to 35 o
5 min read
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 print the prime numbers less than n. Therefore, by definition of Sieve of Eratosthenes, for every prime number, it has to check the multiples of the prime an
3 min read
Sieve of Eratosthenes in 0(n) time complexity The classical Sieve of Eratosthenes algorithm takes O(N log (log N)) time to find all prime numbers less than N. In this article, a modified Sieve is discussed that works in O(N) time.Example : Given a number N, print all prime numbers smaller than N Input : int N = 15 Output : 2 3 5 7 11 13 Input :
12 min read
Programs and Problems based on Sieve of Eratosthenes
C++ Program for Sieve of EratosthenesGiven a number n, print all primes smaller than or equal to n. It is also given that n is a small number. For example, if n is 10, the output should be "2, 3, 5, 7". If n is 20, the output should be "2, 3, 5, 7, 11, 13, 17, 19".CPP// C++ program to print all primes smaller than or equal to // n usin
2 min read
Java Program for Sieve of EratosthenesGiven a number n, print all primes smaller than or equal to n. It is also given that n is a small number. For example, if n is 10, the output should be "2, 3, 5, 7". If n is 20, the output should be "2, 3, 5, 7, 11, 13, 17, 19". Java // Java program to print all primes smaller than or equal to // n
2 min read
Scala | Sieve of EratosthenesEratosthenes of Cyrene was a Greek mathematician, who discovered an amazing algorithm to find prime numbers. This article performs this algorithm in Scala. Step 1 : Creating an Int Stream Scala 1== def numberStream(n: Int): Stream[Int] = Stream.from(n) println(numberStream(10)) Output of above step
4 min read
Check if a number is Primorial Prime or notGiven a positive number N, the task is to check if N is a primorial prime number or not. Print 'YES' if N is a primorial prime number otherwise print 'NO.Primorial Prime: In Mathematics, A Primorial prime is a prime number of the form pn# + 1 or pn# - 1 , where pn# is the primorial of pn i.e the pro
10 min read
Sum of all Primes in a given range using Sieve of EratosthenesGiven a range [l, r], the task is to find the sum of all the prime numbers in the given range from l to r both inclusive.Examples: Input : l = 10, r = 20Output : 60Explanation: Prime numbers between [10, 20] are: 11, 13, 17, 19Therefore, sum = 11 + 13 + 17 + 19 = 60Input : l = 15, r = 25Output : 59E
1 min read
Prime Factorization using Sieve O(log n) for multiple queriesWe can calculate the prime factorization of a number "n" in O(sqrt(n)) as discussed here. But O(sqrt n) method times out when we need to answer multiple queries regarding prime factorization.In this article, we study an efficient method to calculate the prime factorization using O(n) space and O(log
11 min read
Java Program to Implement Sieve of Eratosthenes to Generate Prime Numbers Between Given RangeA number which is divisible by 1 and itself or a number which has factors as 1 and the number itself is called a prime number. The sieve of Eratosthenes is one of the most efficient ways to find all primes smaller than n when n is smaller than 10 million or so. Example: Input : from = 1, to = 20 Out
3 min read
Segmented Sieve Given a number n, print all primes smaller than n. Input: N = 10Output: 2, 3, 5, 7Explanation : The output “2, 3, 5, 7†for input N = 10 represents the list of the prime numbers less than or equal to 10. Input: N = 5Output: 2, 3, 5 Explanation : The output “2, 3, 5†for input N = 5 represents the li
15+ min read
Segmented Sieve (Print Primes in a Range) Given a range [low, high], print all primes in this range? For example, if the given range is [10, 20], then output is 11, 13, 17, 19. A Naive approach is to run a loop from low to high and check each number for primeness. A Better Approach is to precalculate primes up to the maximum limit using Sie
15 min read
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: arr[] = {3, 5, 2, 66, 7, 11, 8} Output: 3 Explanation: Maximum contiguous prime number sequence is {2, 3, 5} Input: arr[] = {1, 2, 11, 32, 8, 9} Output: 2 Expla
13 min read
Sieve of Sundaram to print all primes smaller than n Given a number n, print all primes smaller than or equal to n.Examples: Input: n = 10Output: 2, 3, 5, 7Input: n = 20Output: 2, 3, 5, 7, 11, 13, 17, 19We have discussed Sieve of Eratosthenes algorithm for the above task. Below is Sieve of Sundaram algorithm.printPrimes(n)[Prints all prime numbers sma
10 min read