Find all ordered pairs of positive integers $(m, n)$ such that $2m$ divides the number $3n - 2$, and $2n$ divides the number $3m - 2$.
1. **Initial Setup:**
   We are given two conditions:
   \[
   2m \mid 3n - 2 \quad \text{and} \quad 2n \mid 3m - 2
   \]
   We need to find all ordered pairs of positive integers \((m, n)\) that satisfy these conditions.

2. **Substitution:**
   Let \(m = 2m_1\) and \(n = 2n_1\), where \(m_1\) and \(n_1\) are positive integers. Substituting these into the given conditions, we get:
   \[
   2(2m_1) \mid 3(2n_1) - 2 \quad \text{and} \quad 2(2n_1) \mid 3(2m_1) - 2
   \]
   Simplifying, we obtain:
   \[
   4m_1 \mid 6n_1 - 2 \quad \text{and} \quad 4n_1 \mid 6m_1 - 2
   \]

3. **Simplification:**
   Dividing both sides of each condition by 2, we get:
   \[
   2m_1 \mid 3n_1 - 1 \quad \text{and} \quad 2n_1 \mid 3m_1 - 1
   \]

4. **Oddness Condition:**
   For \(2m_1\) to divide \(3n_1 - 1\) and \(2n_1\) to divide \(3m_1 - 1\), \(m_1\) and \(n_1\) must be odd. This is because an even number cannot divide an odd number unless the odd number is zero, which is not possible here.

5. **Combining Conditions:**
   We now have:
   \[
   2m_1 \mid 3n_1 - 1 \quad \text{and} \quad 2n_1 \mid 3m_1 - 1
   \]
   This implies:
   \[
   4m_1n_1 \mid (3n_1 - 1)(3m_1 - 1)
   \]
   Expanding the product on the right-hand side:
   \[
   (3n_1 - 1)(3m_1 - 1) = 9m_1n_1 - 3m_1 - 3n_1 + 1
   \]
   Therefore:
   \[
   4m_1n_1 \mid 9m_1n_1 - 3m_1 - 3n_1 + 1
   \]

6. **Divisibility Condition:**
   Simplifying the divisibility condition:
   \[
   4m_1n_1 \mid 9m_1n_1 - 3m_1 - 3n_1 + 1
   \]
   This implies:
   \[
   m_1n_1 \mid 3(m_1 + n_1) - 1
   \]

7. **Bounding \(n_1\):**
   Without loss of generality, assume \(m_1 \geq n_1\). Then:
   \[
   m_1n_1 \leq 3(m_1 + n_1) - 1
   \]
   Since \(m_1 \geq n_1\), we have:
   \[
   m_1n_1 \leq 6m_1 - 1
   \]
   Dividing both sides by \(m_1\):
   \[
   n_1 \leq 6 - \frac{1}{m_1}
   \]
   Since \(n_1\) is an odd positive integer, the possible values for \(n_1\) are 1, 3, and 5.

8. **Checking Possible Values:**
   - For \(n_1 = 1\):
     \[
     2m_1 \mid 2 \implies m_1 = 1
     \]
     Thus, \((m, n) = (2, 2)\).

   - For \(n_1 = 3\):
     \[
     2m_1 \mid 8 \implies m_1 = 1, 2, 4
     \]
     Since \(m_1\) must be odd, \(m_1 = 1\) is the only possibility, but \(m_1 \geq n_1\) is not satisfied.

   - For \(n_1 = 5\):
     \[
     2m_1 \mid 14 \implies m_1 = 1, 7
     \]
     Since \(m_1\) must be odd, \(m_1 = 7\) is the only possibility. Thus, \((m, n) = (14, 10)\) and \((m, n) = (10, 14)\).

Conclusion:
The only pairs \((m, n)\) that satisfy the given conditions are \((2, 2)\), \((10, 14)\), and \((14, 10)\).

The final answer is \(\boxed{(2, 2), (10, 14), (14, 10)}\).