Hello, I have a question whether it is possible to uss the CRT to multiply modulo a prime d. \phi(d) = d-1, choose k so that there are primes p_1 .. p_n where (p_1 -1)*..*(p_n-1) = k*(d-1). Now the system of congruences (mod p_i), i=1..n, will have a cardinality that is a multiple of phi(d). Is there a function f(m) = (m_1, ..., m_n) that gives us an isomorphism between the multiplicative group (mod d) and the groups (mod p_i)? Thanks, Ciao, Alex. _________________________________________________________________________ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
