Do Exercises 1-4 on page 18 of the textbook.
These four exercises define some number-theoretic functions for you to
program.
Try to use recursion; it will be good practice for when we cover LISP.

(sigmam n)

(expm n).
(logm n) = the least integer such that
.

(choosen k) is the number of ways of
selecting items from a collection of items, without
repetitions, and nonnegative integers.
This quantity is called a binomial coefficient, and is
notated .
It can be defined as
, but the following
identities are more useful computationally:
, and
.

(fib) is the th Fibonacci number.
The Fibonacci numbers are defined by the identities:
(fib ), (fib ), and for ,
(fib )(fib )(fib ).