×

# Prime or not (Java) (doubt)

Hey guys it have been around 8 - 10 months since I started learning Java.I understand most of the basic concepts and programs written by others. But I can't figure out how to findout that a number is prime or not. So I surfed net mainly Stackoverflow to find out . But after several attempts I wasn't able to. Please can anybody give the answer as well as explanation.

PS - It may sound stupid sorry for that...

Note by Tanmay Jain
1 year, 10 months ago

## Comments

Sort by:

Top Newest

To find out whether a number is prime or not, you need to find out whether it is divisible by natural numbers greater than 1 and less than the number. Here is the easiest algorithm to find out if a number is prime or not -

 1 2 3 4 5 6 7 8 private boolean prime(int n){ for(int i = 2; i < n; i++){ if(n % i == 0){ return false; } } return true; } 

Consider any natural number $$n$$. In the above code, you loop from $$2$$ to $$n-1$$. If any number divides $$n$$ completely, you return false as the number is divisible by some number and it is composite. If no number divides $$n$$ then you return true as the number is prime.

Note : The % sign means modulo. It finds out the remainder when a number is divided by another number. For eg, 9 mod 3 or 9 % 3 is 0 as when 9 is divided by 3, remainder is 0.

The code given by me is certainly very inefficient. Can you figure out a way to make the code faster? Also remember to read this post - Prime Test. · 1 year, 10 months ago

Log in to reply

Thank You so much that helped me a lot !! · 1 year, 10 months ago

Log in to reply

You are welcome · 1 year, 10 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...