Knuth's power tree: Difference between revisions

Line 1:

(~~Used~~ for computing   <big>xn</big>   efficiently using Knuth's power tree.)

(Knuth's power tree is used for computing   <big><big>xn</big></big>   efficiently using Knuth's power tree.)

;task requirements:

Compute and show the list of Knuth's power tree integers necessary for the computation of:

::*   <big><big>Xn</big></big>   for any real   <big><big>X</big></big>   and any non-negative integer   <big>n</big>.

~~The requirements of this draft task are to compute~~ and show the list of Knuth's power tree integers necessary for the computation of ~~ ~~

<big>Xn</big>   for any real   <big>X</big>   and any non-negative integer   n.

Then, using those integers, calculate and show the exact (not approximate) value of (at least) the integer powers below:

Line 11:

Line 17:

::*   <big>3191</big>

::*   <big>1.181</big>

A zero power is often handled separately as a special case.

Optionally, support negative integers (for the power).

Optionally, support negative integers   (for the power).

;example:

An example of a small power tree for some low integers:

Line 72:

Line 82:

See:   link to Rosetta Code   [http://rosettacode.org/wiki/Addition-chain_exponentiation addition-chain exponentiation].

=={{header|EchoLisp}}==