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