The java.math.BigInteger.nextProbablePrime() is used to find the first integer greater than this BigInteger that is probably prime. If this method returns ‘p’ then there is no prime number ‘q’ between this Biginteger and ‘p’ (this < q < p ) i.e. it never skips any prime number greater than BigInteger that is used to call the method.
public BigInteger nextProbablePrime()
Parameters: The method doesn’t accept any Parameters.
Return: This method returns a Biginteger which holds the first integer greater than this BigInteger that is probably prime number.
Exception: The number must be non – negative and not too large otherwise Arithmetic Exception is thrown.
Below programs illustrate nextProbablePrime() method of BigInteger class
The next probable Prime number is 1516153
Example 2: Printing all Prime number below 100
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Example 3: Program showing exception when value is negative.
java.lang.ArithmeticException: start < 0: -5
To know about checking current BigInteger is prime or not, visit isProbablePrime() Method in Java page.
Attention reader! Don’t stop learning now. Get hold of all the important Java Foundation and Collections concepts with the Fundamentals of Java and Java Collections Course at a student-friendly price and become industry ready.