找出能被5或6整除的大于Long.MAX_VALUE的前10个数字。
package pack2;
import java.math.BigInteger;
public class FinfNumber {
public static void main(String[] args) {
BigInteger bigInteger = new BigInteger("" + Long.MAX_VALUE);
int count = 0;
while(true) {
bigInteger = bigInteger.add(BigInteger.ONE);
if(divided(bigInteger, 5, 6)) {
System.out.println(bigInteger);
count++;
}
if(count == 10) break;
}
}
/**整数能被整除?*/
public static boolean divided(BigInteger bigInteger, int...integers) {
for (int i = 0; i < integers.length; i++)
if(bigInteger.mod(new BigInteger("" + integers[i])).equals(BigInteger.ZERO))
return true;
return false;
}
}