University of Alabama
Department of Computer Science
). When , the behavior of
sigmais unspecified; your implementation may do anything you like.
)is the least integer such that .
kis the number of ways of selecting items from a collection of items, without repetitions, and non-negative integers. This quantity is called a binomial coefficient and is notated . It can be defined as , but the following identities are more helpful computationally: , , and .
)is the th Fibonacci number. The Fibonacci numbers are defined by the identities:
), and for ,
C:\MSC_EXE>impcore -> (+ 2 3) 5 quitor you can create a file
mp1.txtwith the text:
(+ 2 3) quitand use IO redirection:
C:\MSC_EXE>chap1 < mp1.txt -> 5 ->
MP1.imp. In your email, set the subject line to ``CS603MP1''. The attachment should contain your name, set out as a comment. For example:
; Joel Jones (define add1 (x) (+ x 1))
This document was generated using the LaTeX2HTML translator Version 2K.1beta (1.61)
Copyright © 1993, 1994, 1995, 1996,
Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999, Ross Moore, Mathematics Department, Macquarie University, Sydney.
The command line arguments were:
latex2html -split 0 -nonav MP1.tex
The translation was initiated by on 2004-01-16