SETL Programming Assignment


This project is due, along with your Prolog project, at the end of the semester, no later than May 10.

This program should take you about an hour. Please get it over with as soon as possible.

Write the procedure fib_subset(S) which returns the set of all subsets of set S that represent a "fibonacci set". For our purposes, we'll call a fibonacci set a set of numbers {N₀ ... N_k}, k > 1 such that N₁ > N₀ and N_i = N_i-1 + N_i-2, 2 ≤ i ≤ k. Being a set, a fibonacci set is unordered, of course. An example of a fibonacci set is{29, 4, 3, 11,18, 7}.