title: Check if a number is prime
body: <p>I am writing a small function that checks whether a number is prime. I am trouble converting how I would check it in C++ to scheme. Mainly the <strong>or</strong> operator. </p>
  
  <pre><code>if( ( (n % 2) == 0) || (n != 1) )
     ***recursive again***
  else
      "Done";
  
  
  (define prime
    (lambda (n)
      (if (= n 1) n
          (if (or (= (modulo n 2) 0) (not ( = n 1))) prime(n)
              (display "Done")
              )
          )
      )
    )
  </code></pre>
  
  <p>Thank you</p>