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:
Basic Authentication with the RestTemplate
Java Program to Check Whether a Given Point is in a Given Polygon
How to Define a Spring Boot Filter?
Java Program to Implement Bit Array
Comparing Strings in Java
Rest Web service: Filter và Interceptor với Jersey 2.x (P2)
Database Migrations with Flyway
Jackson – JsonMappingException (No serializer found for class)
Apache Commons Collections SetUtils
SOAP Web service: Upload và Download file sử dụng MTOM trong JAX-WS
Interface trong Java 8 – Default method và Static method
Spring Boot Configuration with Jasypt
Handling Errors in Spring WebFlux
The DAO with JPA and Spring
Tìm hiểu cơ chế Lazy Evaluation của Stream trong Java 8
HttpClient 4 Cookbook
Java Program to Perform Postorder Non-Recursive Traversal of a Given Binary Tree
Batch Processing with Spring Cloud Data Flow
Một số nguyên tắc, định luật trong lập trình
Create Java Applet to Simulate Any Sorting Technique
Case-Insensitive String Matching in Java
Java Program to Find the Longest Subsequence Common to All Sequences in a Set of Sequences
Using a Mutex Object in Java
The Spring @Controller and @RestController Annotations
Lớp Collections trong Java (Collections Utility Class)
Sending Emails with Java
Java Program to Perform Deletion in a BST
Sử dụng JDBC API thực thi câu lệnh truy vấn dữ liệu
Java Program to Generate a Graph for a Given Fixed Degree Sequence
Java Collections Interview Questions
Jackson Ignore Properties on Marshalling
Java Program to Implement Attribute API