- 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.
0914541592
0
Newbie Poster
Recommended Answers
Jump to PostThis question has been asked and answered over a million times. Why don't you just use google to get your homework done.
All 2 Replies
Ancient Dragon
5,243
Achieved Level 70
Team Colleague
Featured Poster
This question has been asked and answered over a million times. Why don't you just use google to get your homework done.
humorousone
This is a very simple problem.
A while loop - that is my only clue.
This isn't a website where we do your homework for you :)
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.