The Chinese Remainder Theorem for moduli that aren't relatively prime

audiowize
Messages
6
Reaction score
0
Hello,
I am looking into proving that the Chinese Remainder Theorem will work for two pairs of congruences IFF a congruent to b modulo(gcd(n,m)) for

x congruent to a mod(n) and x congruent to b mod(m).

I have gotten one direction, that given a solution to the congruences mod(m*n), then a congruent to b mod(gcd(m,n)).

My issue is going the other way, given a congruent to b mod(gcd(m,n)), show a solution to the congruences exists mod(m*n).

Can anybody help me with a start? I tried expressing the relationship between a and b and using that to determine what x would have to be, but I'm not convinced of the results.
 
Physics news on Phys.org
OK, I got that the gcd(n,m)|(a-b)-> x==a mod(n) and x==b mod(m) will have a solution, but showing that that solution is restricted to the modulus of m*n is giving me troubles...
 
AFAIK, the solution (if it exists) is unique modulo lcm(m,n), not modulo m*n.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Modulo and Modulus in math and computer programming
Replies
5
Views
3K
Yes, that was exactly what I couldn't get. Thank you for clarifying it for me!
Replies
10
Views
6K
Chinese Remainder Theorem, Solving For Multiplicative Inverses
Replies
2
Views
6K
How do I use Chinese remainder theorem to solve for x mod 683 in Cryptography?
Replies
12
Views
4K
Find and Test Primes using the Chinese Remainder Theorem and Binary Search
Replies
2
Views
6K
Chinese Remainder theorem for 2 congruences
Replies
2
Views
1K
MHB About a variant of the Chinese Remainder Theorem
Replies
5
Views
2K
Solving Systems of Congruences when mods not pairwise relatively prime
Replies
1
Views
5K
Number of quadratic residues mod N>1
Replies
3
Views
3K
How Do You Determine the Maximum Order of an Element Modulo n?
Replies
10
Views
8K

Hot Threads

Recent Insights

Back
Top