Second problem here. I am interested in solving systems of modular equations, along the lines of:
m mod n = 3
2m mod n-1 = 2
3m mod n-2 = 1
and so on.
This looks and smells like a Chinese Remainder problem. The book blathers about Chinrem, and beats around modular euations, byt I don't find anything like this. 'Solve' and 'Reduce' won't touch this stuff.