title: Sum a list without recursion/looping in Scheme/Racket
body: <p>I'm working on an assignment involving Racket and I was hoping somebody could lead me into the right direction.</p>
  
  <p>I must calculate the norm of a list without recursion or using a loop and without defining any helper functions.</p>
  
  <p>Is this possible? The only thing that comes to mind is to somehow use the built-in map functions</p>