Wilson’s theorem
(n - 1)! + 1 is divisible by n if n is prime or 1
EDIT: therefore floor ( cos pi ((n-1)!+1)/n )² is a boolean prime detector :3