Using the Chinese remainder theorem, we can prove that implementing as
•
By an ingenious use of Chinese remainder theorem, we can define constructively such a recursive function (using simple number-theoretical functions, all of which can be defined in a total recursive way) fulfilling the "specifications" given above.
•
Using the fundamental theorem of arithmetic is a straightforward way, but there are also more economic approaches, e.g. using pairing function combined with Chinese remainder theorem in a sophisticated way.
Catalog numbering systems for single records | Kurt Gödel | Gödel | North American Numbering Plan | A roads in Zone 5 of the Great Britain numbering scheme | Telephone numbering plan | Great Britain road numbering scheme | Godel's theorem | Gödel's incompleteness theorems | Godel's incompleteness theorem | Gödel metric | Gödel, Escher, Bach | Bit numbering | astronomical year numbering |