Question: Using c++in the following problems, you should use Modular Programming Write a function PRIME that takes an integer number and returns True if the number
Using c++in the following problems, you should use Modular Programming
Write a function PRIME that takes an integer number and returns True if the number is divisible by 1 and itself only, and False otherwise.
- For example, the number 11 is prime because it is not divisible by any number between 1 and 11, while the number 8 is not prime because it is divisible by 1, 2 and 4.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
