题目
代码
import java.math.BigInteger;
public class Test19 {
public static void main(String[] args) {
// 获取小于100的所有素数(int数组即可)
int[] arr = new int[50];
int count = 0;
for (int i = 2 ; i < 100 ; i++){
if (isPrimeNumber(i)){
arr[count] = i;
count++;
}
}
int[] arr1 = new int[count];
for (int i = 0 ; i < count ; i++){
arr1[i] = arr[i];
}
arr = arr1;
// 遍历数组获取Mersenne素数,输出、并放在BigInteger数组中
System.out.println("p\t2^p-1");
BigInteger[] bi_arr = new BigInteger[