Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Help : greatest common factor

  1. May 30, 2006 #1
    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. :smile:
  2. jcsd
  3. May 30, 2006 #2
    I am not sure but the result depends on the value of s and t since they are not unique in a given problem
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?

Similar Discussions: Help : greatest common factor
  1. Factoring Help (Replies: 2)