Search:

Thanks a lot, I will begin deciphering it in the next few days.

I'd already seen that page. Those methods seemed much too complex to implement. Or if not, could you enlighten me?

Thanks everyone.

As a sidenote, could anyone suggest an algorithm to calculate 2^(-1/2) with more than 18 digits precision? In general, is there a formula for calculating the root of 2?

Could you show me how? Of course, I'm not allowed to use structures, only arrays.

I've written a small code to calculate the constant e with 40 digits precision, but, apparently due to the limitations of long double, it's not accurate. Here's the code:



#include <stdio.h>
...