On 21 Aug 2009, at 01:24, meekerdb @dslextreme.com wrote:
> > On Thu, Aug 20, 2009 at 12:32 PM, Bruno Marchal<[email protected]> > wrote: >> >> >> Hi, >> >> I give the solution of the first of the last exercises. > ... >> This motivates the definition of the following function from N to N, >> called factorial. >> factorial(0) = 1, and factorial(n) = n*(n-1)*(n-2)*(n-3) * ... *1, if >> is n is different from 0. >> >> Note this: if n is different from 0, for each n we have that >> fact(n) = >> n*fact(n). > > Of course you meant fact(n)=n*fact(n-1). Yes, indeed. Note that later we will see stronger form of recursion, but here it is just a "typo" mistake. Bruno http://iridia.ulb.ac.be/~marchal/ --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Everything List" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/everything-list?hl=en -~----------~----~----~----~------~----~------~--~---
