Sunday
May 19, 2013

Homework Help: Discrete Mathematics

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.

No one has answered this question yet.

Answer this Question

First Name:
School Subject:
Answer:

Related Questions

Math - This is a problem concerning GCD. I need to prove gcd(a,b) = gcd(a,b+a). ...
maths - Let m; n; z 2 N such that m and n divide z and gcd(m; n) = 1. Prove that...
discrete math - If a and b are positive integers, prove that: ab = gcd(a,b)*lcm(...
Discrete Mathematics - Find g := gcd(389,222) and a,b belongs to Z such that g...
discrete math - If a and b are positive integers, prove that; ab = gcd(a,b)*lcm(...
Modern Algebra - Let F be a field and let f(x), g(x), h(x), and d(x) be ...
discrete mathematics - Prove that a square of an integer ends with a 0, 1, 4, 5 ...
Discrete Mathematics - Prove that if n is an odd positive integer, then 1 &#...
discrete mathematics - prove the euclid division given and int j and k>0 ...
Discrete Math - Prove that if a and b are integers with a not equal to zero and ...

For Further Reading

Search
Members
Community