Determine if an integer is divisible by 3
C - 2 tokens

int div3(int x) {
    return x * 0xAAAAAAAB &lt;= x;
}


Seems to work up to 231-1.

Credits to zalgo("nhahtdh") for the multiplicative inverse idea.