Search:

Er, the capital J is a typo, its supposed to be a lowercase J.

Then I realized I needed the division part by N to be with the factorial so I edited it a bit when conpiled.

So I tried running...

After poking around this some more, it appears that this is done by using the following.


for (int J=0; J<8; J++)
{
if (J<7)
{
a[j+1]+=(a[j]%n)*10000
}

Well, I need to expand euler's number for this so not using them is not really an option.
And by 30~35 digits I mean accuracy.
This is just one of the last-year problems that I randomly found at my...

Thats what it says,
Im supposed to make something that does different calculations and makes them up into one whole 30~35 digit number

This is supposed to make you use series like x[n] in order to divide a result into multiple parts and use functions to calculate the results and such.

According to it,
I need to find the specific...

This was supposed to be achievable by only having knowledge about series, but I dont understand how the hell to split these

Thanks for the answer,

Basically I need to split the already calculated result into different variables.

The fact that I used INT is because of the following.

Lets say that I have declared...

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.
...

So, I am required to make something that adds and substracts two 16 digit numbers, each of them composed of two 8 digit numbers respectively.
This needs to be done using integers only and using only...