Over a million developers have joined DZone.

IsPrime

·
// finding whether 'n' is prime or not


private boolean isPrime (int n)
{
   if (n<=1) return false;
   if (n==2) return true;
   if (n%2==0) return false;
   int m=(int)Math.round(Math.sqrt(n));

   for (int i=3; i<=m; i+=2)
      if (n%i==0)
         return false;

   return true;
}
Topics:

Opinions expressed by DZone contributors are their own.

The best of DZone straight to your inbox.

SEE AN EXAMPLE
Please provide a valid email address.

Thanks for subscribing!

Awesome! Check your inbox to verify your email so you can start receiving the latest in tech news and resources.
Subscribe

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}