[CAS] PART FUNCTION on sum of n terms

07092016, 10:13 AM
Post: #5




RE: [CAS] PART FUNCTION on sum of n terms
(07092016 08:03 AM)parisse Wrote: Correct. That's precisely because I knew the limitations of having binary + and * that I designed Giac with nary + and *. One of the limitation (that is perhaps not obvious on a calc) is to be able to handle sums with a very large number of arguments (for example 1 million). With binary + the last argument would be so much embedded that many symbolic operations would segfault because of stack overflow during recursion. I agree. Symbolics in newRPL also have nary + and * (there's no CAS yet, but the expression format and compiler/decompiler is finished). Much easier to scan for terms or factors in a flattened tree than a binary tree. 

« Next Oldest  Next Newest »

Messages In This Thread 
[CAS] PART FUNCTION on sum of n terms  compsystems  07042016, 01:18 AM
RE: [CAS] PART FUNCTION on sum of n terms  parisse  07042016, 11:00 AM
RE: [CAS] PART FUNCTION on sum of n terms  compsystems  07092016, 02:10 AM
RE: [CAS] PART FUNCTION on sum of n terms  parisse  07092016, 08:03 AM
RE: [CAS] PART FUNCTION on sum of n terms  Claudio L.  07092016 10:13 AM

User(s) browsing this thread: 1 Guest(s)