Anonymous user
Knuth's power tree: Difference between revisions
m
added whitespace, split long sentences.
m (→{{header|REXX}}: changed/added comments and whitespace, changed indentations, made other cosmetic changes.) |
m (added whitespace, split long sentences.) |
||
Line 1:
{{draft task|Knuth's power tree}}
(
;task requirements:
::* <big><big>X<sup>n</sup></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>X<sup>n</sup></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 ⟶ 17:
::* <big>3<sup>191</sup></big>
::* <big>1.1<sup>81</sup></big>
A zero power is often handled separately as a special case.
Optionally, support negative integers (for the power).
;example:
An example of a small power tree for some low integers:
Line 72 ⟶ 82:
See: link to Rosetta Code [http://rosettacode.org/wiki/Addition-chain_exponentiation addition-chain exponentiation].
<br><br>
=={{header|EchoLisp}}==
| |||