Skip to main content
19 events
when toggle format what by license comment
Oct 12, 2014 at 5:45 answer added xyz timeline score: 2
Oct 2, 2014 at 15:15 answer added Mr.Wizard timeline score: 2
Oct 2, 2014 at 11:42 history edited xyz CC BY-SA 3.0
added 75 characters in body
Oct 2, 2014 at 11:33 history edited xyz CC BY-SA 3.0
added 624 characters in body
Oct 2, 2014 at 3:20 vote accept xyz
Oct 1, 2014 at 12:43 answer added ubpdqn timeline score: 6
Oct 1, 2014 at 11:01 vote accept xyz
Oct 1, 2014 at 13:05
Oct 1, 2014 at 9:27 answer added Igor Rivin timeline score: 14
Oct 1, 2014 at 7:40 comment added Artes Have a look at this approach if it can help How to find the sum all even numbers of this sequence?.
Oct 1, 2014 at 6:29 comment added xyz @BobHanlon, OK,:-)
Oct 1, 2014 at 5:58 comment added Bob Hanlon I recommend that you look at the function RSolve which can determine closed form representations for many recursive equations.
Oct 1, 2014 at 3:44 answer added m_goldberg timeline score: 17
Oct 1, 2014 at 3:40 history tweeted twitter.com/#!/StackMma/status/517157076787662848
Oct 1, 2014 at 3:32 comment added xyz @m_goldberg,V8, input: $RecursionLimit,output: 256
Oct 1, 2014 at 3:15 comment added m_goldberg What version of Mathematica are you using? In V10 on OS X and, I think V9 as well, the default value for $RecursionLimit is 1024.
Oct 1, 2014 at 2:48 comment added Dr. belisarius But of course en.wikipedia.org/wiki/Fibonacci_number#Closed-form_expression
Oct 1, 2014 at 2:42 comment added Dr. belisarius With enough beer, you can tweak any recursive or iterative construct to do what you want. But why? The most reasonable structure to represent the Fib. progression is the recursive one.
Oct 1, 2014 at 2:37 comment added paw You could simply set the RecursionLimit to a higher value. For example $RecursionLimit = 1000
Oct 1, 2014 at 2:33 history asked xyz CC BY-SA 3.0