For any n,m are intergers, d_n and d_m are divisors of n and m,(adsbygoogle = window.adsbygoogle || []).push({});

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.

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Help : greatest common factor

Loading...

Similar Threads for Help greatest common | Date |
---|---|

B Help understanding a proof | Jun 8, 2017 |

I Problem understanding the SPAN | May 1, 2017 |

A Linearised N.S.E - advection operator help | Mar 16, 2017 |

Frequency of Greatest Integer quotients | Oct 29, 2010 |

**Physics Forums - The Fusion of Science and Community**