下限距组合问题再探讨

A Further Probe Into Lower Bound Combination Problem

用组合方法证明了从n个不同数中取出k个数且下限距为m的组合数公式为C（n,k,m）＝C■（k-1）（m-1），并用线性变换的方法将其进行推广，得出了下限距为m1,m2…。

It is Proved that the combination number formual is C(u,k,m) = C■(k-1)(m-1) by using combinated method,in which the different number group k are taken out of the different number group n, and the lower bound is m,and generalizes the formula further by the way of linear transformation,then proves that the combination number formula is C(n,k,m,m2…mk-1 ) = C■ when the lower bound is m1, m2, mk-1.