Divisible by 3 or 5, in lisp

(lambda (n) (or (= 0 (mod n 3)) (= 0 (mod n 5))))

how on earth do you write this in lisp, I mean better than I have here.. surely it must be possible?

Rube Goldberg devices are definitely acceptable if it makes the final code better.. hope you have some ideas /prog/

LOL Lisp.
int f(n){(!(n%3) || !(n%5))}

LOL De Morgan.
int f(n){!(n%3 && n%5)}

>>7
LOL some sort of newfag college undergrad who just finished discrete math. My version is clearly more readable, hence it is superior to yours in every way possible.