#Java - isPrime


SUBMITTED BY: Guest

DATE: May 21, 2014, 12:30 p.m.

FORMAT: Java

SIZE: 614 Bytes

HITS: 1004

  1. public static boolean isPrime(long i) {
  2. if (i < 2)
  3. return false;
  4. if (i == 2 | i == 3) {
  5. return true;
  6. }
  7. if (i % 2 == 0 || i % 3 == 0)
  8. return false;
  9. String asS = String.valueOf(i);
  10. if (asS.endsWith("5") | asS.endsWith("0"))
  11. return false;
  12. long sqrtN = (long) Math.sqrt(i) + 1;
  13. for (long j = 6L; j <= sqrtN; j += 2) {
  14. if (i % (j - 1) == 0 || i % (j + 1) == 0)
  15. return false;
  16. }
  17. return true;
  18. }

comments powered by Disqus