Cantor expansion自然数n的是
n = ak * k!+a(k − 1) *(k −1)!+.... + a2 * 2!+a1 *1!
其中所有的ai(数字)满足0≤ai≤i
我知道它可以用来生成全排列，甚至在采访中也会出现一些关于它的问题，但我还没有看到它在计算机技术中的应用。有人对此有任何线索吗？
最佳答案
在谷歌专利中用关键字“cantor expansion”搜索，我找到了一个 example它使用 cantor 扩展来编码信息。
...... the recipient will extract an arrangement which g a head keywords: H '1; H' 2, ..., H 'g. Next, we can further expansion by Cantor:
[0034] k = a [l] * (g_l)! + A [2] * (g_2)! + ... + A [g] * 0! + L
[0035] The calculation of the arrangement is that the partial ordering of the k-th order, then the HTTP request is encoded n_segk fragments. Wherein, a [u] represents the arrangement satisfies H '' number H' j of u's. Then the packet format HTTP Ci requests sent to fixedly hold the partial order of the i-th order, so as to achieve the purpose of transferring data distributed fragmentation. Such analytical methods can hide and maintain maximum independence and encoding and retrieval accuracy. Wherein, l <= i, j, u, k <= 2n.
关于algorithm - "Cantor expansion"是否应用于任何计算机技术？，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/33329279/