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. The program should ask the user to enter a number for primality test or a negative number to exit. 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. I do not want a goodbye system out in the program and it has to pass all the test cases.
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. The program should ask the user to enter a number for primality test or a negative number to exit. 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. I do not want a goodbye system out in the program and it has to pass all the test cases.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Java Program
Chapter 5. PC #13. is Prime Method
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. The program should ask the user to enter a number for primality test or a negative number to exit.
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. I do not want a goodbye system out in the program and it has to pass all the test cases.
Test Case 1
Please enter a number to check for primality or -1 to exit:\n
2ENTER
2 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
3ENTER
3 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
4ENTER
4 is not a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
25ENTER
25 is not a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
101ENTER
101 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
-1ENTER
2ENTER
2 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
3ENTER
3 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
4ENTER
4 is not a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
25ENTER
25 is not a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
101ENTER
101 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
-1ENTER
Test Case 2
Please enter a number to check for primality or -1 to exit:\n
-10ENTER
Invalid input.\n
Please enter a number to check for primality or -1 to exit:\n
0ENTER
Invalid input.\n
Please enter a number to check for primality or -1 to exit:\n
2ENTER
2 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
-1ENTER
-10ENTER
Invalid input.\n
Please enter a number to check for primality or -1 to exit:\n
0ENTER
Invalid input.\n
Please enter a number to check for primality or -1 to exit:\n
2ENTER
2 is a prime number.\n
Please enter a number to check for primality or -1 to exit:\n
-1ENTER
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education