This week's book giveaway is in the Mac OS forum. We're giving away four copies of a choice of "Take Control of Upgrading to Yosemite" or "Take Control of Automating Your Mac" and have Joe Kissell on-line! See this thread for details.
I need to write a program that finds the prime numbers between 1 and 50, but I'm not quite sure how to do it. I know that an even number is prime if it is two, and an odd is prime if it isn't divisible by any of the odd integers less than the square root of the number. Should I be using a for loop? How should I start it off?
I'm confused. You posted all this code and now you are not posting any code and are asking the question like you haven't done anywork, yet, on the problem. The best way of getting good answers around here is to post some code and poeple can help you out with it.
I'm confused too. I think I am going to ask that this thread be removed for 2 reasons. You have already asked this question and recieved some answers. Second, grr frr, while trying to help, has violated one of Javaranch's prime directives. And that is not just handing the answers over to people trying to get their homework completed.