// Pseudo-random number generator
// using Lehmer's linear congruential method:
// X[n+1] = (aX[n] + c)mod m ; n >= 0

~lehmer  = { arg a, c, m, n=50; 
	var x = 7;
	n.do({ arg i;
		x = ((a * x) + c).mod(m);
		// post normalized value
		(x/m).postln;
	});		
}		

// short cycle
~lehmer.value(7, 7, 10);

// longer cycle
~lehmer.value(7, 7, 2 ** 31);