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:
How to Return 404 with Spring WebFlux
Introduction to Spring MVC HandlerInterceptor
Quick Intro to Spring Cloud Configuration
How To Serialize and Deserialize Enums with Jackson
Jackson – Bidirectional Relationships
Introduction to the Java NIO Selector
ETL with Spring Cloud Data Flow
Java Program to Generate a Graph for a Given Fixed Degree Sequence
Java Program to Implement AVL Tree
A Guide to Concurrent Queues in Java
Java Program to Generate Random Hexadecimal Byte
Predicate trong Java 8
RestTemplate Post Request with JSON
TreeSet và sử dụng Comparable, Comparator trong java
Enum trong java
Java Program to Find Nearest Neighbor Using Linear Search
JUnit 5 @Test Annotation
How to Get All Dates Between Two Dates?
Java Program to Implement Self Balancing Binary Search Tree
Build a REST API with Spring and Java Config
Handling Errors in Spring WebFlux
Spring MVC Async vs Spring WebFlux
Biểu thức Lambda trong Java 8 – Lambda Expressions
Map Interface trong java
Spring Boot Actuator
Add Multiple Items to an Java ArrayList
Primitive Type Streams in Java 8
Spring 5 Functional Bean Registration
Java Program to Implement Max Heap
Jackson Date
Spring Security 5 for Reactive Applications
How to Store Duplicate Keys in a Map in Java?