I have another problem which I cant seem to figure out,

I was wondering how it would be possible to calculate a Euler's number using maclaurin's series up to 30~35 digits, until the 30th power.

f(x)=f(0)+f'(0)+f''(0)*x^2/2!+f'''(0)*x^3/3!+f''''(0)*x^4/4!+...+f^n(0)*x^n/n!

Is the basic formula, but as the integers in c++ have a certain digit limit It cannot show until up to 30~35 digits.

That is kinda hard to understand but as i cannot post urls now youd have to google a better one

I was thinking to split up the value storing the digits by 5 each using series [x] but I cannot figure out how the hell to split up something inside there. As for the calculation of the formula, its not hard as a outer function lets me calculate the factorials.

as an example,

for the power being 1,

i would need a variable x to store the number of that certain power in the expansion. Since the power is 1,

x=f'(0)=1.0000000000~

and a variable e which stores the total number calculated thus far.

As a general form it should go like this.

pow=1, x=1.000000000~ e=2.0000000000~

pow=2, x=0.500000000~ e=2.5000000000~

pow=3, x=1.666666666~ e=2.6666666666~

So yeah, I know how to use the split storage in order to make the operation between 2 16 digit numbers split into 8 each but in that case, you input the values by yourself, while in this the program should run by itself storing the result of the division.

Any help would be appreciated.