Talk:Addition-chain exponentiation: Difference between revisions
Content added Content deleted
| Line 102: | Line 102: | ||
::::: Never seen that error before. Blame windows. Anyway, output is<lang>[(23, 13, 10, 5, 3, 2, 1), (23, 14, 9, 5, 4, 2, 1), |
::::: Never seen that error before. Blame windows. Anyway, output is<lang>[(23, 13, 10, 5, 3, 2, 1), (23, 14, 9, 5, 4, 2, 1), |
||
(23, 18, 9, 5, 4, 2, 1), (23, 20, 10, 5, 3, 2, 1)]</lang> --[[User:Ledrug|Ledrug]] 21:11, 27 August 2011 (UTC) |
(23, 18, 9, 5, 4, 2, 1), (23, 20, 10, 5, 3, 2, 1)]</lang> --[[User:Ledrug|Ledrug]] 21:11, 27 August 2011 (UTC) |
||
:::::: Ok... looking at the prime numbers less than 100 where my approach was inadequate (which was just binary chain for prime numbers), I can see a rapidly increasing problem: <lang j>23 6 4 |
|||
31 7 42 |
|||
43 7 4 |
|||
47 8 63 |
|||
59 8 24 |
|||
61 8 72 |
|||
79 9 185 |
|||
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) |
|||