Rosetta Code

Rosetta Code:Village Pump/Suggest a programming task: Difference between revisions

Project page Discussion

Rosetta Code:Village Pump/Suggest a programming task (view source)

Revision as of 03:23, 5 May 2014

27 bytes added ,  10 years ago
m
→‎Mathematical Operations
Line 171:
===Mathematical Operations===
* 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,xn) , 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) , ... think it is correct now
Conjecture: R(x+z,y)>R(x,y) and R(x,y+z)>R(x,y) for all positive integer z and all positive integer x where R is the function returning the number of recursions in the corresponding call to the Ackermann function. Can anyone prove this please?
* Write a programm in our programming language, that showns the numerical limits of all available datatypes for numbers. The limits of datatypes could be max number, min number, bit precission, decimal precission, etc.
* [[Convert a decimal number to fraction ]]Convert a decimal number to fraction.
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/4730"