Answer:
isSquare = true;
for (int i = 0; i < a2d.length && isSquare; i++)
if (a2d[i].length != a2d.length)
isSquare = false;
Explanation:
Answer:
FALSE....john has no idea what hes talking about. i knew this was false yet i looked it up and got it wrong anyway because of john its freaking false
Explanation:
First of all, we will need a function that checks if a number is prime or not:
boolean isPrime(int n){
for(int i=2; i<=math.sqrt(n); i++){
if(n % i == 0) return false;
}
return true;
}
Then, in the main program, we will call this function with all the desired inputs, and we will print the prime numbers:
for(int n=100; n<= 1000; n++){
if(isPrime(n)) print(n);
}
