What's the syntax for mod in java

if ( (a mod 2) == 0)

{
    isEven = true
}

else

{
    isEven = false
}

if ( (a % 2) == 0)
{
    isEven = true
}
else
{
    isEven = false
}

boolean isEven = (a % 2 == 0);

// Option 1: Clearest way for beginners
boolean isEven;
if ((a % 2) == 0)
{
  isEven = true
}
else
{
  isEven = false
}

// Option 2: Clear, succinct, code
boolean isEven = ((a % 2) == 0);

// Option 3: Ternary operator
boolean isEven = ((a % 2) == 0) ? true : false;

// Option 4: Bitwise-and
boolean isEven = ((a & 1) == 0);

private int mod(int x, int y)
{
    int result = x % y;
    if (result < 0)
    {
        result += y;
    }
    return result;
}

private int mod(int x, int y)
{
    int result = x % y;
    return result < 0? result + y : result;
}

if (a % 2 == 0) {
} else {
}

// bad enough implementation of isEven method, for fun. so any worse?
boolean isEven(int num)
{
    num %= 10;
    if(num == 1)
       return false;
    else if(num == 0)
       return true;
    else
       return isEven(num + 2);
}
isEven = isEven(a);

int a = 7;
b = a % 2;

public boolean isEven(int a){
    return ( (a & 1) == 0 );
}

public boolean isOdd(int a){
    return ( (a & 1) == 1 );
}

bool isEven = (a % 2) == 0;

public int mod(int i, int j)
{
  int rem = i % j;
  if (j < 0 && rem > 0)
  {
    return rem + j;
  }
  if (j > 0 && rem < 0)
  {
    return rem + j;
  }
  return rem;
}