This is a Java Program to Implement Solovay Strassen Primality Test Algorithm. Solovay Strassen 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 Solovay Strassen 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 SolovayStrassen Primality Test Algorithm **/ import java.util.Scanner; import java.util.Random; /** Class SolovayStrassen **/ public class SolovayStrassen { /** Function to calculate jacobi (a/b) **/ public long Jacobi(long a, long b) { if (b <= 0 || b % 2 == 0) return 0; long j = 1L; if (a < 0) { a = -a; if (b % 4 == 3) j = -j; } while (a != 0) { while (a % 2 == 0) { a /= 2; if (b % 8 == 3 || b % 8 == 5) j = -j; } long temp = a; a = b; b = temp; if (a % 4 == 3 && b % 4 == 3) j = -j; a %= b; } if (b == 1) return j; return 0; } /** 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; Random rand = new Random(); for (int i = 0; i < iteration; i++) { long r = Math.abs(rand.nextLong()); long a = r % (n - 1) + 1; long jacobian = (n + Jacobi(a, n)) % n; long mod = modPow(a, (n - 1)/2, n); if(jacobian == 0 || mod != jacobian) 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; } /** Main function **/ public static void main (String[] args) { Scanner scan = new Scanner(System.in); System.out.println("SolovayStrassen Primality Algorithm Test\n"); /** Make an object of SolovayStrassen class **/ SolovayStrassen ss = new SolovayStrassen(); /** 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 = ss.isPrime(num, k); if (prime) System.out.println("\n"+ num +" is prime"); else System.out.println("\n"+ num +" is composite"); } }
Output:
SolovayStrassen Primality Algorithm Test Enter number 9997777 Enter number of iterations 1 9997777 is prime
Related posts:
Java 8 Predicate Chain
Java Program to Implement Quick Sort with Given Complexity Constraint
Allow user:password in URL
Hướng dẫn Java Design Pattern – Memento
Uploading MultipartFile with Spring RestTemplate
Tạo chương trình Java đầu tiên sử dụng Eclipse
Guide to java.util.concurrent.BlockingQueue
How to Add a Single Element to a Stream
Spring Boot - Eureka Server
Guide to System.gc()
Adding Shutdown Hooks for JVM Applications
How to Read a File in Java
Finding Max/Min of a List or Collection
Java Program to Generate All Possible Combinations of a Given List of Numbers
Consumer trong Java 8
Thao tác với tập tin và thư mục trong Java
Hướng dẫn Java Design Pattern – DAO
Spring Boot - Web Socket
Java Program to Implement Disjoint Sets
Java Program to Implement Sieve Of Eratosthenes
Different Ways to Capture Java Heap Dumps
Spring Cloud Series – The Gateway Pattern
ETags for REST with Spring
Jackson vs Gson
Java Program to Solve Set Cover Problem assuming at max 2 Elements in a Subset
Spring Autowiring of Generic Types
Java Program to Implement Kosaraju Algorithm
Java Program to Implement AA Tree
Mệnh đề if-else trong java
Using a List of Values in a JdbcTemplate IN Clause
Guide to java.util.concurrent.Locks
Lớp Collections trong Java (Collections Utility Class)