Talk:Addition-chain exponentiation: Difference between revisions
Talk:Addition-chain exponentiation (view source)
Revision as of 20:48, 27 August 2011
, 12 years ago→wikipedia content
(→wikipedia content: ref results for task) |
|||
Line 97:
print chain(23)</lang>--[[User:Ledrug|Ledrug]] 19:36, 27 August 2011 (UTC)
:::: How does your notation work? In <code>L*M*M=:L*L =:G*I*J*K*K*K=:J*J=:I*I=:H*H=:G*G =:A*B*C*F*F*F=:E*E=:D*D=:C*C=:B*B=:A*A</code>, what does <code>G=:A*B*C*...</code> even mean? --[[User:Ledrug|Ledrug]] 20:09, 27 August 2011 (UTC)
::::: <code>=:</code> is an assignment operation in J, and precedence is the same for multiplication and assignment, with long right scope. So that expression is equivalent to <code>L*(M*(M=(L*(L=(G*(I*(J*(K*(K*(K=(J*(J=(I*(I=(H*(H=(G*(G=(A*(B*(C*(F*(F*(F=(E*(E=(D*(D=(C*(C=(B*(B=(A*A)))))))))))))))))))))))))))))))))</code> in C-like languages. --[[User:Rdm|Rdm]] 20:48, 27 August 2011 (UTC)
| |||