Let us analyze the following setting. You are given a circle of unit circumference. You pickkpoints on the circle independently and uniformly at random and snip the circle at those points, obtainingkdifferent arcs. Determine the expected length of any single arc.

We have been given a unit circle which is cut at k different points to produce k different arcs. Now we can see firstly that the sum of lengths of all k arks is equal to the circumference:

Now consider the largest arc to have length \small l . And we represent all the other arcs to be some constant times this length.

we get :

where C(i) is a constant coefficient obviously between 0 and 1.

All that I want to say by using this step is that after we choose the largest length (or any length for that matter) the other fractions appear according to the above summation constraint. [This step may even be avoided depending on how much precaution you wanna take when deriving a relation.]

So since there is no bias, and \small l may come out to be any value from [0 , 2π] with equal probability, the expected value is then defined as just the average value of all the samples.

We already know the sum so it is easy to compute the average :

let's call the solutions x₁ = (5 - 2√7)/3 and x₂ = (5 + 2√7)/3

then the equation is (x-x₁)(x-x₂) = 0

if you fill that in you get a lot of numbers which you can recognize as ax²+bx+c=0.

step-by-step explanation:

you can see that a=1 (there is just an x²)

b = (-5 -2√7 + 2√7 - 5)/3 = -10/3

c = -2√7)/3 ) * (-5+2√7)/3) = -1/3

so your answer is 3x^2 – 10x – 1 = 0