A way to determine if a number is prime

Give a number and decide if it is prime:

#include <cmath>
bool isPrime(int n) {
  int i;
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}