title: Implement in Scheme a recursive function computing binomial coefficients
body: <p>I need to take this recursive function and convert it into scheme</p>
  
  <pre><code>int B(int n, int k)
  
  { if ((n &gt;= 0) &amp;&amp; (k &gt;= 0) &amp;&amp; (n &gt;= k))
  
  if ((k == 0) || (k == n)) return 1;
  
  else return B(n-1, k-1) + B(n-1, k);
  
  else return 0; /∗ actually undefined here ∗/
  }
  </code></pre>
  
  <p>I wrote this in scheme is this correct?</p>
  
  <pre><code>Define B (n, k)
  
   if(((&gt;= n 0)&gt;= k 0) &gt;= n k))
  
      B(n-1, k-1) + B(n-1, k)
  </code></pre>