Boolean tasks

I added ackerman.py and series.py.
Hi Josh,

Thank you for the feedback!
I was trying to say that
"if it doesn't have (m,r) ,return fibonacci(n),
if (m,r) = (2,1), which is sum_series(0) and sum_series(1) respectively,
return rucas(n),
else, return sum_series(n-2) + sum_series(n-1) with arbituary
sum_series(0)and sum_series(1).

Thanks,
Saki

On Mon, Dec 8, 2014 at 7:56 PM, Joshua Frailey <notifications@github.com>
wrote:

> In Students/SakiFu/series.py:
>
> > +def lucas(n):
> > +    """Return lucas function. First two number of series has to be (2,1).
> > +    After that, return the sum of (n-2)th number and (n-1)th number."""
> > +
> > +    if n == 0:
> > +        return 2
> > +    if n == 1:
> > +        return 1
> > +    else:
> > +        return lucas(n - 2) + lucas(n - 1)
> > +
> > +
> > +def sum_series(n, m=0, r=1):
> > +    sum_series(n) == fibonacci(n)
> > +    sum_series(n, 2, 1) == lucas(n)
> > +    return sum_series(n - 2) + sum_series(n - 1)
>
> This definition for sum_series() is causing a RuntimeError because it's
> reaching the "maximum recursion depth." Can you explain what you are trying
> to accomplish with this function? We might be able to re-write this
> function so that it does what you intend without hitting the recursion
> limit. Alternatively, you could replace it with your previous version as I
> believe it worked correctly.
>
> —
> Reply to this email directly or view it on GitHub
> <https://github.com/codefellows/sea-c28-students/pull/62/files#r21505930>.
>