Win a copy of The Way of the Web Tester: A Beginner's Guide to Automating Tests this week in the Testing forum!

# prime numbers

Brandi Love
Ranch Hand
Posts: 133
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?

grr frr
Greenhorn
Posts: 1
Hello,
I'm sorry my English is very bad, but here is a possible solution :
package Uebungen.Methoden;
import ntb.*;
public class U2{

// code removed by Marilyn
}
Manu
[ November 03, 2003: Message edited by: Marilyn de Queiroz ]

William Barnes
Ranch Hand
Posts: 986
There is someone else here doing the exact same homework assignment. I would suggest you find that thread and check out what people have alreay said on this subject.

William Barnes
Ranch Hand
Posts: 986
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.

Gregg Bolinger
Ranch Hand
Posts: 15304
6
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.