This is a Java Program to Implement Miller Rabin Primality Test Algorithm. Miller Rabin Primality Test is an algorithm which is used to determine if a given number is prime or not.
Here is the source code of the Java Program to Implement Miller Rabin Primality Test Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.
/** ** Java Program to Implement Miller Rabin Primality Test Algorithm **/ import java.util.Scanner; import java.util.Random; import java.math.BigInteger; /** Class MillerRabin **/ public class MillerRabin { /** Function to check if prime or not **/ public boolean isPrime(long n, int iteration) { /** base case **/ if (n == 0 || n == 1) return false; /** base case - 2 is prime **/ if (n == 2) return true; /** an even number other than 2 is composite **/ if (n % 2 == 0) return false; long s = n - 1; while (s % 2 == 0) s /= 2; Random rand = new Random(); for (int i = 0; i < iteration; i++) { long r = Math.abs(rand.nextLong()); long a = r % (n - 1) + 1, temp = s; long mod = modPow(a, temp, n); while (temp != n - 1 && mod != 1 && mod != n - 1) { mod = mulMod(mod, mod, n); temp *= 2; } if (mod != n - 1 && temp % 2 == 0) return false; } return true; } /** Function to calculate (a ^ b) % c **/ public long modPow(long a, long b, long c) { long res = 1; for (int i = 0; i < b; i++) { res *= a; res %= c; } return res % c; } /** Function to calculate (a * b) % c **/ public long mulMod(long a, long b, long mod) { return BigInteger.valueOf(a).multiply(BigInteger.valueOf(b)).mod(BigInteger.valueOf(mod)).longValue(); } /** Main function **/ public static void main (String[] args) { Scanner scan = new Scanner(System.in); System.out.println("Miller Rabin Primality Algorithm Test\n"); /** Make an object of MillerRabin class **/ MillerRabin mr = new MillerRabin(); /** Accept number **/ System.out.println("Enter number\n"); long num = scan.nextLong(); /** Accept number of iterations **/ System.out.println("\nEnter number of iterations"); int k = scan.nextInt(); /** check if prime **/ boolean prime = mr.isPrime(num, k); if (prime) System.out.println("\n"+ num +" is prime"); else System.out.println("\n"+ num +" is composite"); } }
Output:
Miller Rabin Primality Algorithm Test Enter number 5510389 Enter number of iterations 2 5510389 is prime
Related posts:
Java Program to find the number of occurrences of a given number using Binary Search approach
Guide to BufferedReader
New Features in Java 11
Giới thiệu Json Web Token (JWT)
Spring Security Basic Authentication
Iterable to Stream in Java
Java Program to Implement LinkedHashMap API
Java Program to Construct K-D Tree for 2 Dimensional Data
Java Program to Compute Discrete Fourier Transform Using the Fast Fourier Transform Approach
Java Timer
Converting String to Stream of chars
Limiting Query Results with JPA and Spring Data JPA
Java Program to Implement the One Time Pad Algorithm
Collection trong java
Đồng bộ hóa các luồng trong Java
Java Program to Check whether Directed Graph is Connected using DFS
Jackson Ignore Properties on Marshalling
Mockito and JUnit 5 – Using ExtendWith
Build a REST API with Spring and Java Config
Spring Boot Gradle Plugin
Java Program to Perform Uniform Binary Search
Java Program to Show the Duality Transformation of Line and Point
Hướng dẫn Java Design Pattern – Visitor
Java NIO2 Path API
Java Program to Implement CopyOnWriteArrayList API
Flattening Nested Collections in Java
How to Convert List to Map in Java
Một số từ khóa trong Java
Java Program to Implement Adjacency List
Java Program to Implement Hamiltonian Cycle Algorithm
Runnable vs. Callable in Java
How To Serialize and Deserialize Enums with Jackson