I answered one of these once. A week later I got this e-mail. Since
In article <34eac7a9.0@alius>, Ulrich Nilsson <na95...
>Does anyone have the solution to this problem:
>Write a funktion that answers this question
>(binary-to-decimal '(1 1 0 1)) --> 13
then I let students do their own homework and use this example in my
classes as a bad example of how to do homework.
Subject: easy money for you
I'm looking for a lisp programmer to help me complete my project.
If you decide to accept, a mail-order-check will by made out to you and
mailed to your home
address. You can reply with your home address if you decide to complete
this project. I am willing to pay $60.00 for fully functional codes.
Must have all of the code by september 28, 1997.
1. (use recursion for these, no iterative function)
a). Define a function nth-element that returns the nth element from
an arbitrary list. For example
(nth-element 2' (lisp (is really) ((fun))
should return (is really). assume correct expression, but
(nth-element 0 anylist) should return nil, also if number is larger than
length list, shoul return nil.
b). Define a function every-other-number that take a list and return a
list with every other number from the original list. for example:
(every-other-number '(this 5 is really 2 insane 3 41 28))
should return this list (2 41). If there is less than two number
in the list, return nil. You can write more than one function (another
function) to call from
every-other-number that does part of the work for you.