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:
Registration – Password Strength and Rules
Refactoring Design Pattern với tính năng mới trong Java 8
Concrete Class in Java
Java Program to Implement Triply Linked List
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
Java Program to Perform Polygon Containment Test
Collect a Java Stream to an Immutable Collection
Java Program to Implement Fisher-Yates Algorithm for Array Shuffling
Java Program to implement Bi Directional Map
Java Program to find the maximum subarray sum O(n^2) time(naive method)
Spring 5 Functional Bean Registration
Transactions with Spring and JPA
Biến trong java
Spring Boot Change Context Path
Hướng dẫn Java Design Pattern – Adapter
Map to String Conversion in Java
Case-Insensitive String Matching in Java
Spring Boot with Multiple SQL Import Files
Java Timer
Java Program to Implement RoleUnresolvedList API
Một số từ khóa trong Java
Java Switch Statement
Java Program to Implement the Monoalphabetic Cypher
Hướng dẫn sử dụng lớp Console trong java
Constructor Injection in Spring with Lombok
Autoboxing và Unboxing trong Java
Lập trình đa luồng với Callable và Future trong Java
Java Program to Implement Sorted Singly Linked List
ThreadPoolTaskExecutor corePoolSize vs. maxPoolSize
How to Set TLS Version in Apache HttpClient
Java Program to Implement JobStateReasons API
So sánh Array và ArrayList trong Java