# maths

posted by
**Nithiya**
.

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

posted by
**Nithiya**
.

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