6.21: isPrime Function A prime number is an integer that is greater than 1 and t

Question

6.21: isPrime Function
A prime number is an integer that is greater than 1 and that is only evenly divisible by itself and 1. For example, the number 5 is prime because it can only be evenly divided 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 function name isPrime, which takes an integer as an argument and returns true if the argument is a prime number, or false otherwise. Demonstrate the function in a complete program that prompts for a number and indicates whether or not it is prime.

Explanation / Answer

01 #include 02using namespace std; 03 04bool isPrime(int prime) 05 06{ 07 cout > prime; 09 10 for (int counter = 2; counter

Related Questions

Navigate

• Browse (All)
• Browse 6
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.