You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.

Java Primality Test

Beeze Aal

Hackerrank Java Primality Test Solution

A prime number is a natural number greater than  whose only positive divisors are  and itself. For example, the first six prime numbers are , , , , , and . Given a large integer, , use the Java BigInteger class' isProbablePrime method to determine and print whether it's prime or  not prime. Input Format A single