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

[lifom]

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)

 

[robert2734]

Can I conclude that x=c (mod m) is a solution of x^k=b (mod m) ?

Yes.