Tuesday
September 30, 2014

Homework Help: maths

Posted by Nithiya on Friday, October 19, 2012 at 3:05pm.

Let m; n; z 2 N such that m and n divide z and gcd(m; n) = 1. Prove that m  n divides z.

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

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

Search
Members