Question

Problem 4/4 (20 points) A prime number is a number that is evenly divisible only by itself and 1. For example, the number 5 is prime because it can be evenly divided only by 1 and 5. The number 6, however, is not prime because it can be divided evenly by 1, 2, 3, and 6. Write a method named isPrime, which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. In the main method, get two positive integers (their values are at least 2, input validation should be conducted) from keyboard. Suppose these two integers denote a number range, call the isPrime method and print out all prime numbers within the above range. Note that the two entered positive integers are in random order, such as the first one might be less than the second one, they might be equal or the first one might be larger than the second one.

          Problem 4/4 (20 points)
A prime number is a number that is evenly divisible only by itself and 1. For example, the number 5 is prime because
it can be evenly divided only by 1 and 5. The number 6, however, is not prime because it can be divided evenly by 1,
2, 3, and 6.
Write a method named isPrime, which takes an integer as an argument and returns true if the argument is a prime
number, or false otherwise.
In the main method, get two positive integers (their values are at least 2, input validation should be conducted)
from keyboard. Suppose these two integers denote a number range, call the isPrime method and print out all prime
numbers within the above range. Note that the two entered positive integers are in random order, such as the first one
might be less than the second one, they might be equal or the first one might be larger than the second one.

Problem 4/4 (20 points)
A prime number is a number that is evenly divisible only by itself and 1. For example, the number 5 is prime because
it can be evenly divided only by 1 and 5. The number 6, however, is not prime because it can be divided evenly by 1,
2, 3, and 6.
Write a method named isPrime, which takes an integer as an argument and returns true if the argument is a prime
number, or false otherwise.
In the main method, get two positive integers (their values are at least 2, input validation should be conducted)
from keyboard. Suppose these two integers denote a number range, call the isPrime method and print out all prime
numbers within the above range. Note that the two entered positive integers are in random order, such as the first one
might be less than the second one, they might be equal or the first one might be larger than the second one.

Added by Tamara M.

Question

Please give Ace some feedback