auravulpes/FENIX_libc
1
0
Fork 0
Code Issues 2 Pull requests Projects Releases Wiki Activity

Comment tweak, we still have exp

Browse source
This commit is contained in:
Kat R. 2022-10-27 23:27:03 -05:00
parent e45b9e8788
commit e813668878
1 changed files with 3 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

5
math/exp.c
View file

@ -9,8 +9,9 @@
I was stuck on how to actually implement the Taylor series without it
getting far too big for even a long double, and I'm not sure I ever would
have thought to just break it out recursively like this. Instead of each
term being x^n/n!, this says that it's (x/n+1)*(nth term), with a base case
of x/1! = x. Pretty clever, really.
term being x^n/n!, where we have to figure out both x^n and n!, both of which
could be massive, we instead say that it's (x/n+1)*(nth term), with a base
case (1st term) of x/1! = x. Pretty clever, really.
Also, really glad I know how to at least read a basic FORTRAN program. This
probably would have been a little more annoying if I didn't.