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. Demonstrate the method in a complete program.
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. Demonstrate the method in a complete
program.
Tip: Recall that the % operator divides one number by another, and returns the remainder
of the division. In an expression such as num1 % num2, the % operator will return 0 if
num1 is evenly divisible by num2.
can you please write it in java.util.scanner form
and can you make it so i can copy and past it
thank you in advance
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
