LOST-Chall
http://lost-chall.wechall.net/forum/

S5MT Hard To Prove
http://lost-chall.wechall.net/forum/viewtopic.php?f=13&t=358		 Page 1 of 1
Author:  Drewdad [ Tue Aug 04, 2009 4:30 am ]
Post subject:  S5MT Hard To Prove
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 ?
Author:  monnino [ Tue Aug 04, 2009 12:34 pm ]
Post subject:  Re: S5MT Hard To Prove
Drewdad wrote: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 ^^
Author:  Drewdad [ Tue Aug 04, 2009 1:23 pm ]
Post subject:  Re: S5MT Hard To Prove
monnino wrote: 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.
Author:  Drewdad [ Tue Aug 04, 2009 7:54 pm ]
Post subject: 
Thanks monnino for the explanation.

Good to remember basic algebra skills, instead of thinking in computer programs all the time.
Author:  pixelie [ Tue Sep 01, 2009 4:02 pm ]
Post subject: 
About the second part :
how many decimals should we use ?

Or am I going in a wrong direction ? :?
Author:  monnino [ Tue Sep 01, 2009 6:31 pm ]
Post subject: 
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 ^^
Author:  thefinder [ Fri Dec 15, 2017 6:40 pm ]
Post subject:  Re: S5MT Hard To Prove
Hi, as it noticed up there is an error on this one:
T(n) = 3T(n-1)+(n+1)-3
obviously.
Page 1 of 1 All times are UTC
Powered by phpBB® Forum Software © phpBB Group
http://www.phpbb.com/