# Help : greatest common factor

#### xuying1209

For any n,m are intergers, d_n and d_m are divisors of n and m,
respectively. If gcd(n,m)=1, gcd(i,n)=d_n , gcd(j,m)=d_m
sm=1(mod n) , tn=1(mod m),
z=smi+tnj (mod nm)
then gcd(z,nm)=d_nd_m.
I want to know the result is true or false, and how to prove it.

Thanks. #### malaygoel

xuying1209 said:
For any n,m are intergers, d_n and d_m are divisors of n and m,
respectively. If gcd(n,m)=1, gcd(i,n)=d_n , gcd(j,m)=d_m
sm=1(mod n) , tn=1(mod m),
z=smi+tnj (mod nm)
then gcd(z,nm)=d_nd_m.
I want to know the result is true or false, and how to prove it.

Thanks. I am not sure but the result depends on the value of s and t since they are not unique in a given problem

### The Physics Forums Way

We Value Quality
• Topics based on mainstream science
• Proper English grammar and spelling
We Value Civility
• Positive and compassionate attitudes
• Patience while debating
We Value Productivity
• Disciplined to remain on-topic
• Recognition of own weaknesses
• Solo and co-op problem solving