I am stuck on this one too........let m,n be integers such that gcd(m,n)=1. prove that if a equivalent to b mod m and a equivalent to b mod n, then a equivalent to b mod (mn)

thanks

Results 1 to 6 of 6

- Apr 15th 2010, 07:59 PM #1

- Joined
- Apr 2010
- Posts
- 11

- Apr 15th 2010, 08:19 PM #2

- Apr 15th 2010, 08:26 PM #3

- Joined
- Apr 2010
- Posts
- 11

- Apr 15th 2010, 09:02 PM #4

- Apr 15th 2010, 09:08 PM #5

- Joined
- Apr 2010
- Posts
- 11

- Apr 16th 2010, 08:27 AM #6