# 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
3 years, 5 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

## Comments

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?"

Staff - 3 years, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...