Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions
Content added Content deleted
Line 286: | Line 286: | ||
===Mathematical Operations=== |
===Mathematical Operations=== |
||
* Calculate the first 2001 digits of the square root of two. |
|||
* Task: bAckermann. The idea is to take the Ackermann function and find the sequence of all possible calls to the function sorted by number of recursions. The output would begin: |
* Task: bAckermann. The idea is to take the Ackermann function and find the sequence of all possible calls to the function sorted by number of recursions. The output would begin: |
||
A(0,n) , A(1,0) , A(1,1) , A(2,0) , A(1,2) , A(1,3) , A(1,4) , A(1,5) , A(2,1) , A(1,6) , A(3,0) , A(1,7) , ... |
A(0,n) , A(1,0) , A(1,1) , A(2,0) , A(1,2) , A(1,3) , A(1,4) , A(1,5) , A(2,1) , A(1,6) , A(3,0) , A(1,7) , ... |