title: How can Scheme's Map function be used to pass two lists to a single function?
body: <p>I have a question about Scheme.  I am fairly new to the language, and my question is fairly general:</p>
  
  <p>Is it possible, without defining a recursive function, to use Map (or something like it) to feed two lists of parameters into a function, producing a single new list from the outputs?</p>
  
  <p>For instance, suppose I had:</p>
  
  <pre><code>(define lst1 (list 1 2 3 4 5))
  (define lst2 (list 2 4 6 8 10))
  </code></pre>
  
  <p>And I wanted to then somehow map the + function, supplying each list as a parameter such that the output would be a new list, lst3:</p>
  
  <pre><code>&gt;lst3
  (3 6 9 12 15)
  </code></pre>
  
  <p>To state the question somewhat more succinctly: how might one <em>most efficiently</em> map a binary function when both parameters are lists?</p>
  
  <p>Thanks for any and all help!</p>