Timeline for Recursion evaluate Table power exceeded limit
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 9, 2013 at 10:55 | history | tweeted | twitter.com/#!/StackMma/status/321577079172911104 | ||
| Apr 9, 2013 at 9:26 | answer | added | Jacob Akkerboom | timeline score: 2 | |
| Apr 9, 2013 at 9:23 | comment | added | npap | Thank you. I'll check the previous message a little later. | |
| Apr 9, 2013 at 9:06 | comment | added | Jacob Akkerboom | Note that pol4[A_, 1] := A and pol4[A_, n_Integer?Positive] := A.pol4[A, n - 1] (with the underscores) is probably closer to what you want | |
| Apr 9, 2013 at 8:55 | comment | added | Jacob Akkerboom | You can find more information here: stackoverflow.com/questions/4481301/…. The main thing is to realize that functions like these "are" replacement rules. | |
| Apr 9, 2013 at 8:47 | review | First posts | |||
| Apr 9, 2013 at 11:21 | |||||
| Apr 9, 2013 at 8:32 | history | asked | npap | CC BY-SA 3.0 |