Long multiplication: Difference between revisions
Content added Content deleted
| Line 1,928: | Line 1,928: | ||
=={{header|Dc}}== |
=={{header|Dc}}== |
||
{{incorrect|Dc|Code does not explicitly implement long multiplication}} |
{{incorrect|Dc|Code does not explicitly implement long multiplication}} |
||
| ⚫ | |||
You would simulate having only fixed size integers just for implementing a multiplication simulating a bigger size? |
You would simulate having only fixed size integers just for implementing a multiplication simulating a bigger size? |
||
Simulate overflow errors with Dc's arithmetic just for the sake of circumcoding it in the next layer? |
Simulate overflow errors with Dc's arithmetic just for the sake of circumcoding it in the next layer? |
||
| Line 1,935: | Line 1,934: | ||
Since Dc has arbitrary precision built-in, the task is no different than a normal multiplication: |
Since Dc has arbitrary precision built-in, the task is no different than a normal multiplication: |
||
<lang Dc>2 64^ 2 64^ *p</lang> |
<lang Dc>2 64^ 2 64^ *p</lang> |
||
| ⚫ | |||
=={{header|EchoLisp}}== |
=={{header|EchoLisp}}== |
||