java program to find prime numbers

Answer 1

I guess you mean: you need help creating one...

I'm not telling you the solution just a few hints, so you can try it your self, since it's not that hard ...

a prime number only has two divisors 1 and itself.
you can test if a number is a divisor of another using the modulo operator (%), which returns the remainder of an hole-division. (if the remainder is not 0, the number is not divisor)

Answer 2

thanks