Timeline for How to deal with recursion formula in Mathematica?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2014 at 12:20 | comment | added | Igor Rivin | @Tangshutao see the edit... | |
| Oct 2, 2014 at 12:20 | history | edited | Igor Rivin | CC BY-SA 3.0 |
gave explanation
|
| Oct 2, 2014 at 3:20 | vote | accept | xyz | ||
| Oct 1, 2014 at 13:34 | comment | added | xyz |
+1,As the n becoming larger and larger ,like 1000000,your alogrithm is fastest.:-),BTW, could you give a explanation to your algorithm? Thanks !!
|
|
| Oct 1, 2014 at 13:27 | history | edited | Igor Rivin | CC BY-SA 3.0 |
fixed typo
|
| Oct 1, 2014 at 12:57 | history | edited | Igor Rivin | CC BY-SA 3.0 |
added matrix implementation, discussed performance
|
| Oct 1, 2014 at 9:27 | history | answered | Igor Rivin | CC BY-SA 3.0 |