Solution to x^k=b mod m Using Prime Factors and Mod Congruence

  • Thread starter Thread starter lifom
  • Start date Start date
lifom
Messages
14
Reaction score
0
Let m be a product of distinct primes p1,p2,...pr.
Assume x=c (mod pi) is a solution of x^k=b (mod pi) for all i =1,2,3,...r.
Can I conclude that x=c (mod m) is a solution of x^k=b (mod m) ?

(I think that if a=b mod x and a=b mod y then a=b mod(xy), provided that gcd(x,y)=1)
 
Physics news on Phys.org
lifom said:
Can I conclude that x=c (mod m) is a solution of x^k=b (mod m) ?

Yes.
 
##\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...
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...
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...
Back
Top