If you have a simple linear congruent generator for which you have several values, this gives a system of equations:
v1 = ( seed * a + b ) % m
v2 = ( v1 * a + b ) % m;
v3 = ( v2 * a + b ) % m;
...
, :
seed = (v1 - b)/a (mod m)
, mod m ( , (0 < seed < m) ). v1 - b , m, .
, .