## Algorithm

Problem Name: Java Primality Test

In this HackerRank Functions in Java programming problem solution,

A prime number is a natural number greater than 1 whose only positive divisors are 1 and itself. For example, the first six prime numbers are 2, 3, 5, 6, 7, 11, and 13.

Given a large integer, n (the number to be checked).

Constraints

• n contains at most 100 digits.

Output Format

If n is a prime number, print `prime`; otherwise, print `not prime`.

Sample Input

``````13
``````

Sample Output

``````prime
``````

Explanation

The only positive divisors of 13 are 1 and 13,so we print `prime`.

## Code Examples

### #1 Code Example with Java Programming

```Code - Java Programming```

``````
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
BigInteger n = in.nextBigInteger();
in.close();

System.out.println(n.isProbablePrime(1) ? "prime" : "not prime");
}
}
``````
Copy The Code &