Let positive integer k satisfies 1<k<100. For the permutation of 1,2,...,100 be a1,a2,...,a100, take the minimum m>k such that am is at least less than (k−1) numbers of a1,a2,...,ak. We know that the number of sequences satisfies am=1 is 4100!. Find the all possible values of k. combinatoricsSequencealgebra