Advertisement
prem

Untitled

Oct 20th, 2014
250
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.46 KB | None | 0 0
  1. public boolean isPrime(int n)
  2. {
  3. for(int i = 1; i <= n; i= i+2)
  4. {
  5. if (n == 1)
  6. {
  7. return false;
  8. }
  9. else if (n % 2 == 0)
  10. {
  11. return false;
  12. }
  13. else if(n % i != 0)
  14. {
  15. return true;
  16. }
  17. else
  18. {
  19. return false;
  20. }
  21. }
  22.  
  23. }
  24. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement