Question: Plz use visual studio 2010 c++ 4. An integer is said to be prime if it is divisible by only 1 and itself. For example,
4. An integer is said to be prime if it is divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not. Write a function that determines whether a number is prime or not. Use this function in a program that determines e numbers betwee Given the following prototype: bool prime (int x)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
