Posted by **Nisha** on Saturday, October 20, 2012 at 6:10am.

Let m,n,z belong to N such that m and n divide z and gcd(m,n) = 1. Prove that m.n divides z.

## Answer this Question

## Related Questions

- maths - Let m; n; z 2 N such that m and n divide z and gcd(m; n) = 1. Prove that...
- Math - This is a problem concerning GCD. I need to prove gcd(a,b) = gcd(a,b+a). ...
- Modern Algebra - Let F be a field and let f(x), g(x), h(x), and d(x) be ...
- discrete math - If a and b are positive integers, prove that: ab = gcd(a,b)*lcm(...
- maths --plse help me.. - Let a,b,c be positive integers such that a divides b^2...
- urgent -plsee - Let a,b,c be positive integers such that a divides b^2 , b ...
- maths --plse help me.. - Let a,b,c be positive integers such that a divides b^2...
- Advanced Math - Def: An interger "m" divides an integer "n" if there is an ...
- Discrete Math - Prove that if a and b are integers with a not equal to zero and ...
- maths - Let a,b,c be positive integers such that a divides b^2 , b divides c^2 ...