Three Headed Monkey said:
^^^^^^^^^^^^^^^
What does that mean?
It means "not seriously" or "as a joke".
So some people say it's to big for C, other people say bigger numbers
have been used on computers.
You can handle any number provided you have a representation for it
that fits in the computer and suits the problem at hand. I can print
a half of pi with absolute accuracy if I am allowed to print "pi/2".
I can write a lightening fast program to print e to as many digits as
you like if I can choose the number system:
#include <stdio.h>
int main(void)
{
putchar('1');
putchar('.');
while (1) putchar('1');
return 0;
}
(the n'th fractional digit has value 1/n!.)
So you C program can express it with a string: "9^8^7^6^5^4^3^2^1"
(exponentiation usually associates to the right).
All this is just to point out that you have not stated the problem.
If the problem is to print, from high-order to low-order the decimal
digits of this number then you are out of luck.
Can problem be expressed in "spinoza" programming language?
It does not exist yet. Look up some other posts by the author a
decide for yourself if you think it will suit you needs when it is
done.
There are other symbolic manipulation languages available now, but I
doubt they can do very much with this expression (Mathematica is the
most famous).
(Author says it can handle unlimited numbers and unlimited strings)
So can C, but unlimited means there is no "arbitrary" limit. If all
the memory chips in all the world were pooled together, for this one C
program there would still be a limit in practice.
Another idea, if I rearrange above expression so it calculate
n-th digit of result, like
int n_th_digit(int n);
can this be done so formula is not to big for C language?
That a very good way to be thinking, but (a) I can't help with any
ideas and (b) you still can't print it -- only little bits of it.