Ali Asadullah said:
But this is also a irrational exponent of an irrational number. How we calculate it. I heard we can find it using limits but how i don't know.
Okay!
Essentially, what you need to do will always involve:
1. Set up a procedure of nested limiting process, so that you at each step only use
rational numbers.
2. Make theoretical investigations to ascertain:
a) That the procedure made in 1
converges theoretically
b) Find a way to estimate the maximal error any finite step in your algorithm is going to make
c) Decide upon the level of accuracy you want.
These points can be said to hold for
every algorithm you might choose from.
In order to decide which algorithm you should choose, it is rational to choose the most cost-effective one, i.e, the one that yields greatest accuracy for fewest steps.
Much of what we call computational/applied maths is concerned with developing/improving such algorithms.
In your <i>particular</i> case, involving nested limiting procedures, remember that an "outer" algorithm cannot hope to achieve a greater accuracy than the maximal error already present in the inner algorithm!
This will, essentially, set a bound on the number of finite steps it will be meaningful to compute in the outer algorithm, whereas the number of steps in the inner algorithm will be chosen to suit overall speed&accuracy requiremements.
One such way to do this, is to compute your exponential by the identities:
[tex]2^{\pi}=e^{\pi\ln(2)}[/tex] (*)
[tex]e^{x}=\sum_{n=0}^{\infty}\frac{x^{n}}{n!}(**)[/tex]
Here, your inner algorithm must compute [itex]\pi\ln(2)[/tex] to a good level of accuracy.<br />
Since both [itex]\pi[/itex] and [itex]\ln(2)[/itex] are irrational numbers, most likely, you must approximath separately, prior to computing an approximate product.<br />
<br />
Then, you put that into (**), and cut off the infinite series at a suitable term.<br />
Note that this process will always involve only rational numbers.[/itex]