Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

using html 9.19 An integer is said to be prime if its greater than 1 and divisible only by 1 and itself. For example, 2,

using html

9.19 An integer is said to be prime if its greater than 1 and divisible only by 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 in a script that determines and prints all the prime numbers between 1 and 10,000. How many of these 10,000 numbers do you really have to test before being sure that you have found all the primes? Display the results in a