Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
how to find all the prime no. in 1000?
becasue prime no. is a no. aliquant by a no. among 2 and itself.
i want use a for statement, and use A to devide by (2,A), if A divisible by any no. in (2,a), A is not a prime.
int i,a,c;
for(a=2;a<1000;a+){
for(i=2;i<a; ){
while(c=a%i){i++}
}System.out.println();
}
it's wrong.
pls help. i don't know why, i have no clue. totely no clue!
help!
Related threads:
Re: how to find all the prime no. in 1000?
What's wrong about it?
PS- When posting code, please use the highlight tags and post code as an SSCCE.
Useful links: How to Ask Questions the Smart Way | Use Code Tags | Java Tutorials
Static Void Games - Play indie games, learn from game tutorials and source code, upload your own games!
Re: how to find all the prime no. in 1000?
I have repost the code.
Re: how to find all the prime no. in 1000?
What's wrong about it?
PS- When posting code, please use the highlight tags and post code as an SSCCE.
Useful links: How to Ask Questions the Smart Way | Use Code Tags | Java Tutorials
Static Void Games - Play indie games, learn from game tutorials and source code, upload your own games!
Reply With Quote