Solvability of Independent Systems of Equations in Finitely Generated Nilpotent Groups

It is proved that the solvability problem for a finite independent system of equations in a finitely generated nilpotent group can effectively be reduced to a similar problem in some finite quotient group of this group. Therefore, this problem is algorithmically solvable. This strengthens a theorem of A. G. Makanin on the residual finiteness and algorithmic solvability of a regular splittable equation in a finitely generated nilpotent group.