Given a positive integer
k > 1 and a non-negative integer
i, generate a
k-dimensional vector) of non-negative integers. For every
k, the map from ℕ to ℕk, must be bijective. That is, every input
i should produce a different tuple, and every possible tuple must be produced by some input
You may write a program or function, taking input via STDIN (or closest alternative), command-line argument or function argument and outputting the result via STDOUT (or closest alternative), function return value or function (out) parameter.
You may use any convenient, unambiguous, flat list format for the output.
Your solution should impose no artificial limits on
i but you may assume that they fit into your language's native integer size. At the very least, you must support values up to
255, though, even your native integer size is smaller than that.
1 < k < 32,
i < 231, your code should produce a result in a matter of seconds (of course, if your answer doesn't support
i that large due to the previous rule, the limit is adjusted accordingly). This should be no issue: it's possible to solve this challenge such that it works up to 2128 in a few seconds, but the limit is there to avoid answers which actually iterate from
i to find the result.
Please include in your answer a description of your chosen mapping and a justification for why it's bijective (this doesn't need to be a formal proof).
This is code golf, the shortest answer (in bytes) wins.