View Single Post
Old 2007-12-03, 16:29   #1
Dec 2007

2 Posts
Default Solving linear systems modulo n

i need to solve a linear system modulo a composite number.

if this number is n = p*q where p and q are prime, i know i have to
solve the system modulo p and modulo q and combine the solutions
with the chinese remainder theorem.

but what if this number is a power of a prime (n = p^k) or a composition
of powers (n = p1^k1 * p2^k2) ?

How should i proceed?
drido is offline   Reply With Quote