Find all integers $ n\ge 2$ with the following property:

There exists three distinct primes $p,q,r$ such that
whenever $ a_1,a_2,a_3,\cdots,a_n$ are $ n$ distinct positive integers with the property that at least one of $ p,q,r$ divides $ a_j - a_k \ \forall 1\le j\le k\le n$,
one of $ p,q,r$ divides all of these differences.
1. **Consider the case \( n = 3 \):**

   Let \( a_1 = p(q + r) \), \( a_2 = q(r + p) \), and \( a_3 = r(p + q) \). We need to check the differences:
   \[
   a_2 - a_1 = q(r + p) - p(q + r) = qr + qp - pq - pr = (q - p)(r + p)
   \]
   \[
   a_3 - a_1 = r(p + q) - p(q + r) = rp + rq - pq - pr = (r - p)(p + q)
   \]
   \[
   a_3 - a_2 = r(p + q) - q(r + p) = rp + rq - qr - qp = (r - q)(p + q)
   \]

   Each of these differences is divisible by one of \( p, q, r \), but none of \( p, q, r \) divides all the differences. Therefore, for \( n = 3 \), the condition is not satisfied.

2. **Consider the case \( n \geq 4 \):**

   Take the first three numbers as above: \( a_1 = p(q + r) \), \( a_2 = q(r + p) \), \( a_3 = r(p + q) \). For the remaining numbers, let \( a_m = a_1 + k_m qr \) for \( 4 \leq m \leq n \) and arbitrary integers \( k_m \).

   We need to check the differences:
   \[
   a_m - a_1 = (a_1 + k_m qr) - a_1 = k_m qr
   \]
   \[
   a_m - a_2 = (a_1 + k_m qr) - a_2 = a_1 - a_2 + k_m qr
   \]
   \[
   a_m - a_3 = (a_1 + k_m qr) - a_3 = a_1 - a_3 + k_m qr
   \]

   Each difference \( a_m - a_1 \) is divisible by \( qr \), and similarly, the other differences involve terms that are divisible by one of \( p, q, r \). However, none of \( p, q, r \) divides all the differences.

   Therefore, for \( n \geq 4 \), the condition is also not satisfied.

3. **Conclusion:**

   Since the condition is not satisfied for \( n = 3 \) and \( n \geq 4 \), there are no integers \( n \geq 2 \) that satisfy the given property.

The final answer is \( \boxed{\text{None}} \)