Department of Computer Science

Principles of Functional Languages

Fall Semester 2010

Dr. Maury Eggen

Homework Laboratory Assignment 3:

It has been reported that Scheme is not as capable as some other languages. To partially test that hypothesis, we will do a homework assigned in a different language. If we look at the website:

http://www.cs.trinity.edu/~meggen/Classes/1320P/Homework/homeworkfive.html

we see a homework problem assigned to PAD I to do some elementary exercises involving positive integers. You are to research the problems and provide a scheme function for each of the exercises there.

Function calls:
(prime? n)
(divisors n) (can return a list)
(sum-divisors n)
(count-divisors n)
(perfect? n)
(abundant? n)
(deficient? n)
(digits n) (can return a list)
(sum-digits n)
Note that we are returning a list rather than printing on the screen as indicated in the assignment on the web!!!
You must also provide a driver

Homework due date: Wednesday, 29 Sept 2010