S5MT Hard To Prove

[Drewdad]

OK, I got past the first section, although it appears that the next-to-last item is not solvable:

T(n) = 3T(n)+(n+1)-3
F(n) = (n+1)n
T(0) = 1
T(n)==F(n) when n ≥ 0 ?

[monnino]

T(n) = 3T(n)+(n+1)-3

Why isn't this one solvable? O.o''

If G(x)=2G(x)-1, what's the value of the G function?

I hope that this helped... I don't know whether I can be more specific without telling you how to solve the equation ^^

[Drewdad]

Why isn't this one solvable? O.o

Looks like an infinite recursion to me.

I solved the puzzle; I just didn't see how that one equation worked.

[Drewdad]

Thanks monnino for the explanation.

Good to remember basic algebra skills, instead of thinking in computer programs all the time.

[pixelie]

About the second part :
how many decimals should we use ?

Or am I going in a wrong direction ?

[monnino]

Mmm, if you get either a, b or c with decimals you did some errors when calculating their values.

Just recheck the operations you made and you'll find the error

Or try to find a simpler method to get the values you need ^^

[thefinder]

Hi, as it noticed up there is an error on this one:
T(n) = 3T(n-1)+(n+1)-3
obviously.