The recurrence relation is given as: \( x_{n+1} = x_n + n - 1 \). The initial condition is \( x_1 = -1 \).
Calculating the first few terms:
The general form can be expressed as a sum:
\[ x_{n} = x_1 + \sum_{k=1}^{n-1}(k - 1) \]
The sum simplifies to:
\[ \sum_{k=1}^{n-1}(k - 1) = \frac{(n - 1)(n - 2)}{2} \]
Thus, the explicit formula for \( x_n \) is:
\[ x_n = x_1 + \frac{(n - 1)(n - 2)}{2} \]
Substituting \( x_1 = -1 \) and \( n = 100 \):
\[ x_{100} = -1 + \frac{(99)(98)}{2} = -1 + 4851 = 4850 \]
Final Answer: \( \boxed{x_{100} = 4850} \)