How to solve the general formula by the recursive formula in MMA? – mathematica.stackexchange.com 01:11 Posted by Unknown No Comments I want to solve this problem $T(n)=\sum_{i=1}^{n-1} 2T(i),T(1)=1$, I want to know how to solve this in MMA? My thinking: I have tried RSolve command, but the output is the same as the input. $$... from Hot Questions - Stack Exchange OnStackOverflow via Blogspot Share this Google Facebook Twitter More Digg Linkedin Stumbleupon Delicious Tumblr BufferApp Pocket Evernote Unknown Artikel TerkaitDraw with latex – tex.stackexchange.comCan my character build an atom bomb? – worldbuilding.stackexchange.comWhy is the movie titled The Phantom Menace? – movies.stackexchange.comjokes played or cracked – ell.stackexchange.comRecursive file search using LINQ – codereview.stackexchange.comIs this an issue with the law of the excluded middle, or an issue with the proof? – math.stackexchange.com
0 Comment to "How to solve the general formula by the recursive formula in MMA? – mathematica.stackexchange.com"
Post a Comment