本文讨论一类数的整除问题,即讨论n的多项式f(n)能否被m!或k·m!整除的问题(n、k∈J,m∈N)。定理 m个连续整数的乘积能被m!整除。对这一定理,所见书刊常限于自然数范围内论证。事实上,在整数范围内也是很容易证明的。 This paper discusses the problem of divisibility of a class of numbers, ie, the problem of whether the polynomial f(n) of n is divided by m! or k.m! (n, k∈J, m∈N). Theorem The product of m consecutive integers can be divisible by m! For this theorem, the publications seen are often limited to arguments in the natural number range. In fact, it is easy to prove in the range of integers.