<pre><code>(define (repeated f n)
   if (= n 0)
   f
   ((compose repeated f) (lambda (x) (- n 1))))
</code></pre>

<p>I wrote this function, but how would I express this more clearly, using simple recursion with repeated?</p>

<p>I'm sorry, I forgot to define my compose function.</p>

<pre><code>(define (compose f g) (lambda (x) (f (g x))))
</code></pre>

<p>And the function takes as inputs a procedure that computes f and a positive integer n and returns the procedure that computes the nth repeated application of f.</p>

What
is
your function trying to do, just out of curiosity? Is it to run
```
f
```
,
```
n
```
times? If so, you can do this.
```
```
(define (repeated f n)
  (for-each (lambda (i) (f)) (iota n)))
```
```