Anonymous user
Talk:Knuth's power tree: Difference between revisions
m
→duplicate of addition-chain exponentiation?: added underscoring.
m (→duplicate of addition-chain exponentiation?: adjusted the count of example provided by the (see also) links.) |
m (→duplicate of addition-chain exponentiation?: added underscoring.) |
||
| (2 intermediate revisions by 2 users not shown) | |||
Line 27:
The ''factor method'' or ''binary factor method'' or more simply ''binary method'', is as follows (as mentioned in Knuth's book):
(Note that this <u>isn't</u> a description of Knuth's power tree method)
For a positive integer ''n'' (for an exponent):
Line 70 ⟶ 73:
<br><br> -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 19:33, 2 June 2015 (UTC)
:: Yes, but it's the power tree algorithm which we need here. Actually, I found https://comeoncodeon.wordpress.com/2009/03/02/evaluation-of-powers/ which indicates that the factor method is different from the binary method. I'm studying its description of the power tree algorithm now. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 21:59, 2 June 2015 (UTC)
| |||