Could also be done recursive, I guess?

boolean isEven(int n) {
  if (n == 0) {
    return true;
  } else {
    return !isEven(Math.abs(n - 1));
  }
}

He loves me, he loves me not

No, no, I would convert the number to a string and just check the last char to see if it was even or not.