Arithmetic, geometric and other sequences

You all probably know what an arithmetic sequence is. It's a sequence of numbers such that consecutive terms always have the same difference. But, there is another, more general definition: An arithmetic sequence is a sequence of real numbers such that every term in the sequence is the arithmetic mean of the preceding and the following term.

But what if we take some other mean instead of the arithmetic mean?

Other well known means are the geometric mean, the harmonic mean and the quadratic mean.

Geometric mean

The geometric mean Mg M_g of two numbers a a and b b is Mg(a,b)=defab M_g(a,b) \stackrel{\text{def}}{=} \sqrt{ab} . Applied to our definition for a (now geometric) sequence {an} \{ a_n \} , this means

an=an1an+1an2=an1an+1an+1=an2an1 \begin{aligned} & a_n = \sqrt{a_{n-1}a_{n+1}} \\ \Leftrightarrow & a_n^2 = a_{n-1}a_{n+1} \\ \Leftrightarrow & a_{n+1} = \frac {a_n^2}{a_{n-1}} \end{aligned}

If we define r=defanan1 r \stackrel{\text{def}}{=} \frac {a_n}{a_{n-1}} , we see an+1=an2an1=ran a_{n+1} = \frac {a_n^2}{a_{n-1}} = ra_n , which is another known definition of a geometric series.

Harmonic mean

The harmonic mean Mh M_h of two numbers a a and b b is defined as Mh(a,b)=def21a+1b M_h(a,b) \stackrel{\text{def}}{=} \frac 2{\frac 1a + \frac 1b} . To get a recursive formula,

an=21an1+1an+11an=1an1+1an+11an+1=1an1an1an+1=11an1an1 \begin{aligned} & a_n = \frac 2{\frac 1{a_{n-1}} + \frac 1{a_{n+1}}} \\ \Leftrightarrow & \frac 1{a_n} = \frac 1{a_{n-1}} + \frac 1{a_{n+1}} \\ \Leftrightarrow & \frac 1{a_{n+1}} = \frac 1{a_n} - \frac 1{a_{n-1}} \\ \Leftrightarrow & a_{n+1} = \frac 1{\frac 1{a_n} - \frac 1{a_{n-1}}} \end{aligned}

But this is not what I am aiming for. These means are too restrictive. However, there js a generization that involves all of these means as special cases. This is called the Hölder mean and it generalizes by introducing a new parameter p p . In the case of 2 numbers a a and b b , their Hölder mean with parameter p p is defined as

Mp(a,b)=defap+bp2p M_p(a,b) \stackrel{\text{def}}{=} \sqrt[p]{\frac {a^p+b^p}{2}}

With these means, we can also generalize our sequences to general "p-mean sequences".

In such a sequence, the equation an=Mp(an1,an+1) a_n = M_p(a_{n-1},a_{n+1}) has to hold for all n n .

We can rearrange this equation to get a recursive equation for any p-mean sequence

an=an1p+an+1p2p2anp=an1p+an+1pan+1p=2anpan1pan+1=2anpan1pp \begin{aligned} & a_n = \sqrt[p]{\frac {a_{n-1}^p + a_{n+1}^p}{2}} \\ \Leftrightarrow & 2a_n^p = a_{n-1}^p + a_{n+1}^p \\ \Leftrightarrow & a_{n+1}^p = 2a_n^p - a_{n-1}^p \\ \Leftrightarrow & \boxed{a_{n+1} = \sqrt[p]{2a_n^p - a_{n-1}^p}} \end{aligned}

To get a feeling of these sequences, let's look at some examples. For simplicity, we will always take a1=1 a_1 = 1 and a2=2 a_2 = 2 .

pa1,a2,,a611,2,3,4,5,621,2,7,10,13,431,2,153,223,293,363 \begin{array}{cc} p & a_1, a_2, \ldots, a_6 \\ 1 & 1, 2, 3, 4, 5, 6 \\ 2 & 1, 2, \sqrt{7}, \sqrt{10}, \sqrt{13}, 4 \\ 3 & 1, 2, \sqrt[3]{15}, \sqrt[3]{22}, \sqrt[3]{29}, \sqrt[3]{36} \end{array}

Since these numbers aren't that "nice" (because they involve roots), let's define another sequence {bn}=def{anp} \{ b_n \} \stackrel{\text{def}}{=} \left\{ a_n^p \right\} to get rid of these roots.

We can adopt the definition of {an} \{ a_n \} to get a recursive equation for {bn} \{ b_n \}

an+1=2anpan1pp a_{n+1} = \sqrt[p]{2a_n^p - a_{n-1}^p}

bn+1=2bnbn1 b_{n+1} = 2b_n - b_{n-1}

The starting values are b1=a1p=1 b_1 = a_1^p = 1 and b2=a2p=2p b_2 = a_2^p = 2^p .

Let's look at the table again, this time also with {bn} \{ b_n \} .

pa1,a2,,a6b1,,b611,2,3,4,5,61,2,3,4,5,621,2,7,10,13,41,4,7,10,1331,2,153,223,293,3631,8,15,22,29,3641,2,314,464,614,7641,16,31,46,61,76 \begin{array}{cc} p & a_1, a_2, \ldots, a_6 & b_1, \ldots, b_6 \\ 1 & 1, 2, 3, 4, 5, 6 & 1, 2, 3, 4, 5, 6 \\ 2 & 1, 2, \sqrt{7}, \sqrt{10}, \sqrt{13}, 4 & 1, 4, 7, 10, 13 \\ 3 & 1, 2, \sqrt[3]{15}, \sqrt[3]{22}, \sqrt[3]{29}, \sqrt[3]{36} & 1, 8, 15, 22, 29, 36 \\ 4 & 1, 2, \sqrt[4]{31}, \sqrt[4]{46}, \sqrt[4]{61}, \sqrt[4]{76} & 1, 16, 31, 46, 61, 76 \end{array}

We observe something interesting; {bn} \{ b_n \} is always an arithmetic sequence. To get its general formula, let's find the formula for each p p individually

pformula1n23n237n6415n14 \begin{array}{cc} p & \text{formula} \\ 1 & n \\ 2 & 3n-2 \\ 3 & 7n-6 \\ 4 & 15n-14 \end{array}

It looks like the general equation is bn=(2p1)n(2p2) b_n = \left( 2^p-1 \right) n - \left( 2^p-2 \right) .

Let's prove this by induction

Base case 1: n=1 n=1

b1=(2p1)1(2p2)=2p12p+2=1 \begin{aligned} b_1 &= \left( 2^p-1 \right) \cdot 1 - \left( 2^p-2 \right) \\ &= 2^p-1-2^p+2 \\ &= 1 \end{aligned}

Base case 2: n=2 n=2

b2=(2p1)2(2p2)=22p212p+2=22p2p=2p \begin{aligned} b_2 &= \left( 2^p-1 \right) \cdot 2 - \left( 2^p-2 \right) \\ &= 2\cdot 2^p - 2\cdot 1 -2^p+2 \\ &= 2 \cdot 2^p - 2^p \\ &= 2^p \end{aligned}

Induction step

Suppose bk=(2p1)k(2p2) b_k = \left( 2^p-1 \right) k - \left( 2^p-2 \right) holds true for some k k . Then, by the induction hypothesis (i.h.), it must also be true for bk+1 b_{k+1} .

bk+1=formula for bn2bkbk1=i.h.2[(2p1)k(2p2)][(2p1)(k1)(2p2)]=2[2pkk2p+2][2pk2pk+12p+2]=2p+1k2k2p+1+42pk+2p+k1+2p2=2pkk+1=(2pkk+2p1)(2p2)=(2p1)(k+1)(2p2)=bk+1 \begin{aligned} b_{k+1} &\stackrel{\text{formula for }b_n}{=} 2 b_k - b_{k-1} \\ &\stackrel{\text{i.h.}}{=} 2 \left[ \left( 2^p-1 \right) k - \left( 2^p-2 \right) \right] - \left[ \left( 2^p-1 \right) (k-1) - \left( 2^p-2 \right) \right] \\ &= 2 \left[ 2^pk -k -2^p +2 \right] - \left[ 2^pk -2^p -k+1 - 2^p +2 \right] \\ &= 2^{p+1}k-2k-2^{p+1}+4 - 2^pk+2^p+k-1+2^p -2 \\ &= 2^pk-k +1 \\ &= \left(2^pk-k+2^p-1\right) -\left( 2^p-2 \right) \\ &= \left( 2^p-1 \right) (k+1) - \left( 2^p-2 \right) \\ &= b_{k+1} \end{aligned}

Since we end up with bk+1 b_{k+1} in the end and used the formula for bn b_n and the definition of a p-mean sequence, this completes our proof for the formula of such a p-mean sequence

bn=(2p1)n(2p2) \large\boxed{b_n = \left( 2^p-1 \right) n - \left( 2^p-2 \right)}

an=(2p1)n(2p2)p \large\boxed{a_n = \sqrt[p]{\left( 2^p-1 \right) n - \left( 2^p-2 \right)}}

Note by Henry U
1 year, 4 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. 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 1

paragraph 2

paragraph 1

paragraph 2

[example link]( 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×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}


Sort by:

Top Newest

I still want to get the formula for a p-mean sequence with arbitrary starting values a a and b b and I think it won't be that difficult since I only have to linearly transform the formula for 1,2 1,2 (at least I think so).

Then, maybe I will look at the asymptotic growth of such sequences.

Henry U - 1 year, 4 months ago

Log in to reply

Whoah........!!! This is nice!!!!! Never thought about generalizing the sequences.......!!! And yup........the p mean sequence with arbitrary starting values isn't that difficult..........You can derive that easily.......... Meanwhile, I am gonna proceed with the asymptotic growth while waiting for your next update!!!

Aaghaz Mahajan - 1 year, 4 months ago

Log in to reply

For starting values aa and bb I get bn=(bpap)n(bp2ap)b_n = (b^p - a^p)n - (b^p - 2a^p) and an=(bpap)n(bp2ap)pa_n = \sqrt[p]{(b^p - a^p)n - (b^p - 2a^p)}

David Vreken - 1 year, 4 months ago

Log in to reply

That looks reasonable! Thanks for your help; I will add this soon.

I think this also shows what one can conjecture before getting the exact formula, since larger p p values increase the influence of the larger term, which is the following term because the sequences are increasing, the diffetrence between consecutive terms should decrease more and more, and this matches the p \sqrt[p]{\cdot} .

Henry U - 1 year, 4 months ago

Log in to reply


Manolis Arseniou - 1 year, 4 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...