There are $n \geq 2$ coins numbered from $1$ to $n$. These coins are placed around a circle, not necesarily in order.  

In each turn, if we are on the coin numbered $i$, we will jump to the one $i$ places from it, always in a clockwise order, beginning with coin number 1. For an example, see the figure below.

Find all values of $n$ for which there exists an arrangement of the coins in which every coin will be visited.
1. **Claim**: Only even \( n \) works.
   
2. **Reasoning**: We must visit all \( n \) coins exactly once before repeating any coin. This implies that the total number of moves must be \( n \). 

3. **Sum of Moves**: The sum of the first \( n-1 \) natural numbers is given by:
   \[
   1 + 2 + \dots + (n-1) = \frac{n(n-1)}{2}
   \]
   This sum must be divisible by \( n \) for us to return to the starting point after visiting all coins.

4. **Divisibility Condition**: For \( \frac{n(n-1)}{2} \) to be an integer, \( n(n-1) \) must be divisible by 2. Since \( n \) and \( n-1 \) are consecutive integers, one of them is always even, making \( n(n-1) \) always even. However, for \( \frac{n(n-1)}{2} \) to be divisible by \( n \), \( n-1 \) must be even, implying \( n \) must be even.

5. **Construction for Even \( n \)**: For \( n = 2k \), we can construct the sequence as follows:
   \[
   1, 2k-2, 2k-4, \dots, 4, 2, 2k, 2k-1, 2k-3, \dots, 5, 3
   \]
   This sequence ensures that we visit all coins exactly once. 

6. **Verification**: Let's verify the sequence:
   \[
   1 \rightarrow 2k-2 \rightarrow 3 \rightarrow 2k-4 \rightarrow 5 \rightarrow \dots \rightarrow 2 \rightarrow 2k-1 \rightarrow 2k
   \]
   This sequence covers all the coins from 1 to \( 2k \) without repetition, ensuring that every coin is visited exactly once.

7. **Conclusion**: Therefore, the only values of \( n \) for which there exists an arrangement of the coins in which every coin will be visited are the even values of \( n \).

\(\blacksquare\)

The final answer is \( \boxed{ n } \) must be even.