(Prime Numbers) An integer is said to be prime if it\'s divisible by only 1 and

Question

(Prime Numbers) An integer is said to be prime if it's divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not. A) Write a function that determines whether a number is prime. B) Use this function is a program that determines and prints all the prime numbers between 2 and 10,000. How many of these numbers do you really have to test before being sure that you've found all the primes? C) Initially, you might think that n/2 is the upper limit for which you must test to see whether a number is prime,
USE C++ (Prime Numbers) An integer is said to be prime if it's divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime, but 4, 6, 8 and 9 are not. A) Write a function that determines whether a number is prime. B) Use this function is a program that determines and prints all the prime numbers between 2 and 10,000. How many of these numbers do you really have to test before being sure that you've found all the primes? C) Initially, you might think that n/2 is the upper limit for which you must test to see whether a number is prime,
USE C++

Explanation / Answer

#include #include #include using namespace std; bool isPrime(int); int main() {int number,n=0; bool prime; cout

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---