All the prime numbers are written in order, $p_1 = 2, p_2 = 3, p_3 = 5, ...$
Find all pairs of positive integers $a$ and $b$ with $a - b \geq 2$, such that $p_a - p_b$ divides $2(a-b)$.
1. **Express \(a\) in terms of \(b\):**
   Since \(a - b \geq 2\), we can write \(a = b + k\) for some \(k \geq 2\). Therefore, \(2(a - b) = 2k\).

2. **Consider the case when \(b \geq 3\):**
   - For \(b \geq 3\), we have \(p_b \geq 5\).
   - Since two primes cannot be consecutive, the difference between any two primes \(p_a\) and \(p_b\) must be at least 2. Therefore, \(p_a - p_b \geq 2k\).

3. **Divisibility condition:**
   - We need \(p_a - p_b\) to divide \(2(a - b) = 2k\).
   - This implies \(p_a - p_b \leq 2k\) because \(p_a - p_b\) must be a divisor of \(2k\).

4. **Equality condition:**
   - Combining the inequalities, we get \(p_a - p_b = 2k\).
   - This means the sequence \(p_b, p_{b+1}, \ldots, p_{b+k}\) forms an arithmetic progression (AP) with a common difference of 2.

5. **Impossibility of AP with common difference 2 for \(b \geq 3\):**
   - For \(p_b \geq 5\) and \(k \geq 2\), such an AP is not possible because one of the terms in the sequence would be divisible by 3, which contradicts the property of primes (except for the prime 3 itself).

6. **Check for smaller values of \(b\):**
   - For \(b = 1\):
     - \(p_1 = 2\), and we need \(p_a - 2\) to divide \(2(a - 1)\).
     - Checking small values of \(a\), we find no valid pairs \((a, 1)\) that satisfy the condition.
   - For \(b = 2\):
     - \(p_2 = 3\), and we need \(p_a - 3\) to divide \(2(a - 2)\).
     - Checking small values of \(a\), we find that \(a = 4\) works because \(p_4 = 7\) and \(7 - 3 = 4\) divides \(2(4 - 2) = 4\).

7. **Conclusion:**
   - The only valid pair \((a, b)\) that satisfies the given conditions is \((4, 2)\).

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