Find infinitely many triples $(a, b, c)$ of positive integers such that $a$, $b$, $c$ are in arithmetic progression and such that $ab+1$, $bc+1$, and $ca+1$ are perfect squares.
To find infinitely many triples \((a, b, c)\) of positive integers such that \(a\), \(b\), and \(c\) are in arithmetic progression and such that \(ab+1\), \(bc+1\), and \(ca+1\) are perfect squares, we can follow these steps:

1. **Substitute the Arithmetic Progression Condition:**
   Since \(a\), \(b\), and \(c\) are in arithmetic progression, we can write:
   \[
   b = a + d \quad \text{and} \quad c = a + 2d
   \]
   for some integer \(d\).

2. **Express the Conditions for Perfect Squares:**
   We need \(ab + 1\), \(bc + 1\), and \(ca + 1\) to be perfect squares. Substituting \(b\) and \(c\) from the arithmetic progression, we get:
   \[
   ab + 1 = a(a + d) + 1 = a^2 + ad + 1
   \]
   \[
   bc + 1 = (a + d)(a + 2d) + 1 = a^2 + 3ad + 2d^2 + 1
   \]
   \[
   ca + 1 = a(a + 2d) + 1 = a^2 + 2ad + 1
   \]

3. **Set Up the Equations for Perfect Squares:**
   Let:
   \[
   a^2 + ad + 1 = k^2
   \]
   \[
   a^2 + 3ad + 2d^2 + 1 = m^2
   \]
   \[
   a^2 + 2ad + 1 = n^2
   \]
   for some integers \(k\), \(m\), and \(n\).

4. **Simplify and Solve Using Pell's Equation:**
   To simplify, we can use the substitution \(a = 2u\) and \(d = v\). Then:
   \[
   (2u)^2 + 2u \cdot v + 1 = n^2
   \]
   \[
   4u^2 + 2uv + 1 = n^2
   \]
   Rearranging, we get:
   \[
   n^2 - 4u^2 = 2uv + 1
   \]
   Similarly, for the other equations, we can write:
   \[
   4u^2 + 6uv + 2v^2 + 1 = m^2
   \]
   \[
   4u^2 + 4uv + 1 = k^2
   \]

5. **Motivation for Pell's Equation:**
   Notice that the equation \(n^2 - 4u^2 = 2uv + 1\) can be transformed into a form of Pell's equation. By setting \(v = 2z\), we get:
   \[
   n^2 - 4u^2 = 4uz + 1
   \]
   This suggests that we can use the Pell's equation \(v^2 - 3u^2 = 1\) to find solutions.

6. **Solve the Pell's Equation:**
   The fundamental solution to the Pell's equation \(v^2 - 3u^2 = 1\) is \((v, u) = (2, 1)\). Using the recurrence relations for Pell's equation, we can generate infinitely many solutions:
   \[
   v_{n+1} = 2v_n + 3u_n
   \]
   \[
   u_{n+1} = v_n + 2u_n
   \]

7. **Generate the Triples:**
   Using the solutions to the Pell's equation, we can generate the triples \((a, b, c)\) as:
   \[
   a = 2u, \quad b = 2u + v, \quad c = 2u + 2v
   \]
   For example, starting with \((v, u) = (2, 1)\), we get:
   \[
   a = 2 \cdot 1 = 2, \quad b = 2 \cdot 1 + 2 = 4, \quad c = 2 \cdot 1 + 2 \cdot 2 = 6
   \]
   This gives the triple \((2, 4, 6)\).

8. **Verify the Conditions:**
   Check that \(ab + 1\), \(bc + 1\), and \(ca + 1\) are perfect squares:
   \[
   ab + 1 = 2 \cdot 4 + 1 = 9 = 3^2
   \]
   \[
   bc + 1 = 4 \cdot 6 + 1 = 25 = 5^2
   \]
   \[
   ca + 1 = 6 \cdot 2 + 1 = 13 = 3^2
   \]

Thus, we have found a valid triple \((2, 4, 6)\), and using the recurrence relations, we can generate infinitely many such triples.

The final answer is \( \boxed{ (2, 4, 6) } \) and infinitely many other triples generated by the recurrence relations.