# Error bound in the sum of chords approximation to arc length

We are currently covering arc length in the calculus class I'm teaching, and since most of the integrals involved are impossible to solve analytically, I'd like to have my students do some approximations instead. Of course we could use the usual rectangle-based methods on the integral $$\int_a^b \sqrt{1 + f'(x)^2}\,dx$$ but this is somewhat unnatural compared to the "sum-of-chords" approximation using evenly-spaced points $(x_i,f(x_i))$ along the curve:

$$\sum_{i=1}^n \sqrt{(x_{i+1} - x_i)^2 + (f(x_{i+1}) - f(x_i))^2}$$

(Not to mention that computing the maximum value of the second derivative of $\sqrt{1 + f'(x)^2}$ along $[a,b]$ would be incredibly time-consuming for my students.)

The problem with this approximation is that I don't know a bound on the error. This question (and the papers referenced there) suggests that the order of the error is $o(1/n^2)$, but the exact form of the bound isn't mentioned, and my (rudimentary) calculations only gave an error bound on the order of $o(1/n)$.

So: is there an order-$o(1/n^2)$ bound on the error from the sum-of-chords approximation? What form does it take?