Discrete Mathematics

posted by .

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.

Respond to this Question

First Name
School Subject
Your Answer

Similar Questions

  1. discrete math

    If a and b are positive integers, prove that: ab = gcd(a,b)*lcm(a,b). Can visualize this being true and easily create examples just don't know how to prove algebraically. well the gcd of any two number can be found by multiplying the …
  2. Advanced Math

    Def: An interger "m" divides an integer "n" if there is an integer "q" such that n=mq. ?
  3. Math

    This is a problem concerning GCD. I need to prove gcd(a,b) = gcd(a,b+a). I always get like like halfway then hit a roadblock (e.g. i can prove gcd(a,b) <= gcd(a,b+a) but not gcd(a,b) >= gcd(a,b+a).
  4. Modern Algebra

    Let F be a field and let f(x), g(x), h(x), and d(x) be polynomials in F[x]. Prove that if d(x)=gcd(f(x),g(x)) and both f(x) and g(x) divide h(x), then f(x)g(x) divides h(x)d(x).
  5. Discrete Math

    Prove that if a and b are integers with a not equal to zero and x is a real number such that ax^2-bx-b-a=0, then a | b. Note a | b means that a divides b.
  6. maths

    Let m; n; z 2 N such that m and n divide z and gcd(m; n) = 1. Prove that m  n divides z.
  7. maths --plse help me..

    Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)7 .
  8. urgent -plsee

    Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)7 .
  9. maths --plse help me..

    Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)^7 .
  10. maths

    Let a,b,c be positive integers such that a divides b^2 , b divides c^2 and c divides a^2 . Prove that abc divides (a + b + c)^7 .

More Similar Questions