Calculating e^x1 on classic HPs

01122016, 05:13 AM
(This post was last modified: 01122016 05:13 AM by Claudio L..)
Post: #3




RE: Calculating e^x1 on classic HPs
(01112016 10:20 PM)Dieter Wrote: What do you think? I just checked at 2000 digits precision and the result was good. I always thought e^x1 was the easiest of all to implement, since the power series expansion at 0 starts with a 1. All you have to do is skip the first term and with relatively few terms in the summation you get the answer. No need to worry about argument reduction because the whole point is to use it around zero. Question is: would a program computing terms of the power series in a loop be faster? 

« Next Oldest  Next Newest »

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