libraries are generally going to use much more complex tricks to calculate it quickly and precisely but a quick + reasonably precise method is to use (1 + x/a), a being a multiple of 2 and x being the number you’re finding. then multiply the result with itself until you get back up to a, which can be done quite quickly as it doubles with each iteration. taylor can also be used if you use range reduction.
taylor does grow faster but it is less useful because approximation is more efficient to quickly calculate with a computer than taylor
Hmmmm... But how does a computer calculate e^n?
libraries are generally going to use much more complex tricks to calculate it quickly and precisely but a quick + reasonably precise method is to use (1 + x/a), a being a multiple of 2 and x being the number you’re finding. then multiply the result with itself until you get back up to a, which can be done quite quickly as it doubles with each iteration. taylor can also be used if you use range reduction.