A Solution on the Permutation Number of the n - th Numerals for the Fixed Converse Ordinal Number
Jinhua Wang · 2003
The converse ordinal number of the n - th numerals' fixed permutation is obtained easily while the problem is very difficult that how much is the n - th permutation when we know the converse ordinal number. This paper provides a new method to solve this problem that we call it the fixed position of the minimum number and we obtain a recurrence formula as follows; where k is the converse ordinal number and n shows the n - th numerals.