#lang racket

; This is the usual way we think of defining factorial recursively:
; factorial(n) = n * factorial(n-1)

(define factorial
  (lambda (n)
    (if (zero? n)
        1
        (* n (factorial (- n 1))))))