Waste less time on Facebook — follow Brilliant.

A Not So Simple Proof Problem

Consider a set of \(n\) consecutive terms from an arithmetic progression. Take any 2 terms and replace them by their average. Continue this until only one number remains. Prove that the mean of all end numbers (they need not be distinct) is equal to the median and, for \(n \geq 4\), the mode.

Note by Sharky Kesa
1 year, 12 months ago

No vote yet
1 vote


Sort by:

Top Newest

Oh wow, wasn't expecting the mean, mode and median to be the same.

I guess that the first step is: "How many different ways are they to do this for \(n\) consecutive terms?" Calvin Lin Staff · 1 year, 12 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...