Java Program to Perform Fermat Primality Test

This is a Java Program to Implement Fermat Primality Test Algorithm. Fermat 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 Fermat 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 Fermat Primality Test Algorithm

```
 **/
```
```
 
```
```
import java.util.Scanner;
```
```
import java.util.Random;
```
```
 
```
```
/** Class FermatPrimality **/
```
```
public class FermatPrimality
```
```
{
```

    /** 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;
```

            if (modPow(a, n - 1, n) != 1)

```
                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("Fermat Primality Algorithm Test\n");

        /** Make an object of FermatPrimality class **/

        FermatPrimality fp = new FermatPrimality();

```
        /** 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 = fp.isPrime(num, k);

```
        if (prime)
```

            System.out.println("\n"+ num +" is prime");

```
        else
```

            System.out.println("\n"+ num +" is composite");

```
    }
```
```
}
```

Fermat Primality Algorithm Test
 
Enter number
 
999983
 
Enter number of iterations
2
 
999983 is prime

Sanfoundry Global Education & Learning Series – 1000 Java Programs.

Note: Join free Sanfoundry classes at Telegram or Youtube

If you wish to look at all Java Programming examples, go to Java Programs.

« Prev - Java Program to Implement Ternary Search Algorithm

» Next - Java Program to Implement Manacher Algorithm

Next Steps:

Get Free Certificate of Merit in Java Programming
Participate in Java Programming Certification Contest
Become a Top Ranker in Java Programming
Take Java Programming Tests
Chapterwise Practice Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
Chapterwise Mock Tests: Chapter 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Related Posts:

Recommended Articles: