Talk:Addition-chain exponentiation: Difference between revisions
Talk:Addition-chain exponentiation (view source)
Revision as of 02:32, 28 August 2011
, 12 years agono edit summary
No edit summary |
|||
Line 112:
83 8 4</lang> First column is the prime number, second column is sequence length, third column is the number of possibilities to compute that exponent in minimal length based on a minimal length chain. I just do not see any good way of managing the complexity of this system. --[[User:Rdm|Rdm]] 22:43, 27 August 2011 (UTC)
::::::: I'm not sure why you think prime numbers are more troublesome than composites: if you are doing factorization, your method is doomed. Check the output for 77, none of the sequences contains either 7 or 11. --[[User:Ledrug|Ledrug]] 23:27, 27 August 2011 (UTC)
:::::::: Yes, 33 was enough to show that factorization can be worse than addition chain (length binary chain for 3 + 1 + length binary chain 11 is longer than binary chain for 33). --[[User:Rdm|Rdm]] 02:32, 28 August 2011 (UTC)
| |||