contestada

The code snippet below checks whether a given number is a prime number. What will be the result of executing it? public static void main(String[] args) { int j = 2; int result = 0; int number = 0; Scanner reader = new Scanner(System.in); System.out.println("Please enter a number: "); number = reader.nextInt(); while (j <= number / 2) { if (number % j == 0) { result = 1; } j++; } if (result == 1) { System.out.println("Number: " + number + " is Not Prime."); } else { System.out.println("Number: " + number + " is Prime. "); }.A) The code snippet will not compile.
B) The code snippet will display the desired result.
C) The code snippet will display an incorrect result.
D) The code snippet will loop forever.

Respuesta :

ijeggs

Answer:

B) The code snippet will display the desired result.

Explanation:

The code Snippet will give the expected result.

Prime numbers are numbers that are have only two divisors... That is 1 and itself

The while block:    

   while (j <= number / 2) {

           if (number % j == 0) {

               result = 1;

           }

           j++;

       }

ensures that whenever there is a remainder of dividing the variable number by j, then it is not a prime number, since prime numbers are only divisible by 1 and themselves. The result =1 is then tested in an if statement to give the expected output

Otras preguntas