probablePrime()方法将返回一个为质数的bitLength位的Biginteger。将bitLength作为参数提供给方法probablePrime(),并且该方法将返回bitLength位的素数BigInteger。此方法返回的BigInteger的概率是复合的,并且不超过2^-100。
用法:
public static BigInteger probablePrime(int bitLength, Random rnd)
参数:此方法接受两个参数,如上面的语法所示,如下所述。
bitLength–返回的BigInteger的bitLength。
rnd–随机位源,用于选择要测试素性的候选者。
返回值:此方法返回的bitLength位的BigInteger可能是素数。
异常:
ArithmeticException–如果bitLength
以下示例程序旨在说明probablePrime()方法:
import java.math.*;
import java.util.Random;
import java.util.Scanner;
public class GFG {
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
// create a BigInteger object
BigInteger biginteger;
// create a integer value for bitLength
int length = 4;
// create a random object
Random random = new Random();
// call probablePrime method to find next probable prime
// whose bit length is equal to bitLength provided as parameter.
biginteger = BigInteger.probablePrime(length, random);
String result = "ProbablePrime whose bit length is "
+ length + " = " + biginteger;
// print result value
System.out.println(result);
}
}
输出:
ProbablePrime whose bit length is 4 = 13