Induction & Recursion
I am doing some work on induction and recursion and am a little stuck on some questions. They are regarding a sequence of numbers, where i need to find an inductive defination. I have no problem with determining the basis the easier part, but am unsure to whether i have the correct answer for the induction part.
If someone has a good knowledge on this area, perhaps i could email them the question to see if they can help me on my way. I would prefer to have help on understanding the method rather than just the answer.
Assume that a number list can have one element or more. head(L) is the first number of the list L, and tail(L) is the obtained by removing the firdt element from L.
The sum of a number list, sum (L), means the value obtained by adding all numbers together. For example, sum () = 3, and sum ([2, 5, 9]) = 2+5+9=16.
Define 'the sum of a number list' inductively.
why not just post the problem here? then there is the potential of several people helping you understand
Originally Posted by wwhiting