This paper will inform about a possibility for the computation of the rank of a cut in integer linear programming. Considering the general solution of the diophantine of existence of lattice-points in an attached simplex. It is shown that under weak conditions the question of the existence of lattice-points in a simplex is equivalent to the question of the existence of nonnegative solutions of only one diophantine equation with relative small coefficients.