Thursday
June 20, 2013

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.

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). ...
Discrete Mathematics - Let m,n,z belong to N such that m and n divide z and gcd...
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 ...
maths - Find g := gcd(389; 222) and a; b 2 Z such that g = a  389 + b  ...
college math question - Find the GCD of 24 and 49 in the integers of Q[sqrt(3...
college math - Prove: there exists x and y for c=ax+by iff gcd(a,b)/c.
discrete math - If a and b are positive integers, prove that; ab = gcd(a,b)*lcm(...
maths - prove that there are no integars p and q such that: (p/q)squared =2
Maths - X and Y are points on the sides BC and AC of a triangle ABC respectively...

For Further Reading

Search
Members
Community