Plase help me thank you

Recommended Answers

All 3 Replies

Read the rules. We don't do homework.

  1. An integer greater than 1 is said to be prime if it is divisible by only 1 and itself. For example, 2, 3, 5 and 7 are prime numbers, 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 program that determines and prints all the prime numbers between 2 and 1,000.
    c) Initially, you might think that n/2 is the upper limit for which you must test to see whether a number is prime, but you need go only as high as the square root of n. Rewrite the program and run it both ways to show that you get the same result.
commented: VIP MOBILE +0
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.