Write an emacs/lisp program (Provide proof it works)

Implement a function in Lisp called checking if a number is prime. Use the dotimes loop. What limit can you use for the loop to make the function efficient?

Examples of results: (prime 0) ; nil (prime 1) ; nil (prime 2 ) ; t (prime 17)) ; t (prime 24)) ; nil