Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public boolean isPrime(int n)
- {
- for(int i = 1; i <= n; i= i+2)
- {
- if (n == 1)
- {
- return false;
- }
- else if (n % 2 == 0)
- {
- return false;
- }
- else if(n % i != 0)
- {
- return true;
- }
- else
- {
- return false;
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement