Polynomial Fitting

Section 2.3 Polynomial Fitting

Investigate!

A standard

8 \times 8

chessboard contains 64 squares. Actually, this is just the number of unit squares. How many squares of all sizes are there on a chessboard? Start with smaller boards:

1 \times 1,

2 \times 2,

3 \times 3,

etc. Find a formula for the total number of squares in an

n \times n

board.

🔗

So far we have seen methods for finding the closed formulas for arithmetic and geometric sequences. Since we know how to compute the sum of the first

n

terms of arithmetic and geometric sequences, we can compute the closed formulas for sequences which have an arithmetic (or geometric) sequence of differences between terms. But what if we consider a sequence which is the sum of the first

n

terms of a sequence which is itself the sum of an arithmetic sequence?

🔗

Before we get too carried away, let’s consider an example: How many squares (of all sizes) are there on a chessboard? A chessboard consists of

64

squares, but we also want to consider squares of longer side length. Even though we are only considering an

8 \times 8

board, there is already a lot to count. So instead, let us build a sequence: the first term will be the number of squares on a

1 \times 1

board, the second term will be the number of squares on a

2 \times 2

board, and so on. After a little thought, we arrive at the sequence

1, 5, 14, 30, 55, \dots .

🔗

This sequence is not arithmetic (or geometric for that matter), but perhaps it’s sequence of differences is. For differences we get

4, 9, 16, 25, \dots .

🔗

Not a huge surprise: one way to count the number of squares in a

4 \times 4

chessboard is to notice that there are

16

squares with side length 1, 9 with side length 2, 4 with side length 3 and 1 with side length 4. So the original sequence is just the sum of squares. Now this sequence of differences is not arithmetic since it’s sequence of differences (the differences of the differences of the original sequence) is not constant. In fact, this sequence of second differences is

5, 7, 9, \dots,

which is an arithmetic sequence (with constant difference 2). Notice that our original sequence had third differences (that is, differences of differences of differences of the original) constant. We will call such a sequence

Δ^{3}

-constant. The sequence

1, 4, 9, 16, \dots

has second differences constant, so it will be a

Δ^{2}

-constant sequence. In general, we will say a sequence is a

Δ^{k}

-constant sequence if the

k

th differences are constant.

🔗

Example 2.3.1.

Which of the following sequences are

Δ^{k}

-constant for some value of

k ?

$2, 3, 7, 14, 24, 37, \dots .$

🔗
$1, 8, 27, 64, 125, 216, \dots .$

🔗
$1, 2, 4, 8, 16, 32, 64, \dots .$

🔗

🔗

Solution.

This is the sequence from Example 2.2.6, in which we found a closed formula by recognizing the sequence as the sequence of partial sums of an arithmetic sequence. Indeed, the sequence of first differences is $1, 4, 7, 10, 13, \dots,$ which itself has differences $3, 3, 3, 3, \dots .$ Thus $2, 3, 7, 14, 24, 37, \dots$ is a $Δ^{2}$ -constant sequence.

🔗
These are the perfect cubes. The sequence of first differences is $7, 19, 37, 61, 91, \dots;$ the sequence of second differences is $12, 18, 24, 30, \dots;$ the sequence of third differences is constant: $6, 6, 6, \dots .$ Thus the perfect cubes are a $Δ^{3}$ -constant sequence.

🔗
If we take first differences we get $1, 2, 4, 8, 16, \dots .$ Wait, what? That’s the sequence we started with. So taking second differences will give us the same sequence again. No matter how many times we repeat this we will always have the same sequence, which in particular means no finite number of differences will be constant. Thus this sequence is not $Δ^{k}$ -constant for any $k .$

🔗

🔗

The

Δ^{0}

-constant sequences are themselves constant, so a closed formula for them is easy to compute (it’s just the constant). The

Δ^{1}

-constant sequences are arithmetic and we have a method for finding closed formulas for them as well. Every

Δ^{2}

-constant sequence is the sum of an arithmetic sequence so we can find formulas for these as well. But notice that the format of the closed formula for a

Δ^{2}

-constant sequence is always quadratic. For example, the square numbers are

Δ^{2}

-constant with closed formula

a_{n} = n^{2} .

The triangular numbers (also

Δ^{2}

-constant) have closed formula

a_{n} = \frac{n (n + 1)}{2},

which when multiplied out gives you an

n^{2}

term as well. It appears that every time we increase the complexity of the sequence, that is, increase the number of differences before we get constants, we also increase the degree of the polynomial used for the closed formula. We go from constant to linear to quadratic. The sequence of differences between terms tells us something about the rate of growth of the sequence. If a sequence is growing at a constant rate, then the formula for the sequence will be linear. If the sequence is growing at a rate which itself is growing at a constant rate, then the formula is quadratic. You have seen this elsewhere: if a function has a constant second derivative (rate of change) then the function must be quadratic.

🔗

This works in general:

🔗

Finite Differences.

The closed formula for a sequence will be a degree

k

polynomial if and only if the sequence is

Δ^{k}

-constant (i.e., the

k

th sequence of differences is constant).

🔗

This tells us that the sequence of numbers of squares on a chessboard,

1, 5, 14, 30, 55, \dots,

which we saw to be

Δ^{3}

-constant, will have a cubic (degree 3 polynomial) for its closed formula.

🔗

Now once we know what format the closed formula for a sequence will take, it is much easier to actually find the closed formula. In the case that the closed formula is a degree

k

polynomial, we just need

k + 1

data points to “fit” the polynomial to the data.

🔗

Example 2.3.2.

Find a formula for the sequence

3, 7, 14, 24, \dots .

Assume

a_{1} = 3 .

🔗

Solution.

First, check to see if the formula has constant differences at some level. The sequence of first differences is

4, 7, 10, \dots

which is arithmetic, so the sequence of second differences is constant. The sequence is

Δ^{2}

-constant, so the formula for

a_{n}

will be a degree 2 polynomial. That is, we know that for some constants

a,

b,

and

c,

a_{n} = a n^{2} + b n + c .

🔗

Now to find

a,

b,

and

c .

First, it would be nice to know what

a_{0}

is, since plugging in

n = 0

simplifies the above formula greatly. In this case,

a_{0} = 2

(work backwards from the sequence of constant differences). Thus

a_{0} = 2 = a \cdot 0^{2} + b \cdot 0 + c,

c = 2 .

Now plug in

n = 1

and

n = 2 .

We get

a_{1} = 3 = a + b + 2

a_{2} = 7 = a 4 + b 2 + 2 .

🔗

At this point we have two (linear) equations and two unknowns, so we can solve the system for

a

and

b

(using substitution or elimination or even matrices). We find

a = \frac{3}{2}

and

b = \frac{- 1}{2},

a_{n} = \frac{3}{2} n^{2} - \frac{1}{2} n + 2 .

🔗

Example 2.3.3.

Find a closed formula for the number of squares on an

n \times n

chessboard.

🔗

Solution.

We have seen that the sequence

1, 5, 14, 30, 55, \dots

Δ^{3}

-constant, so we are looking for a degree 3 polynomial. That is,

a_{n} = a n^{3} + b n^{2} + c n + d .

🔗

We can find

d

if we know what

a_{0}

is. Working backwards from the third differences, we find

a_{0} = 0

(unsurprisingly, since there are no squares on a

0 \times 0

chessboard). Thus

d = 0 .

Now plug in

n = 1,

n = 2,

and

n = 3 :

\begin{aligned} 1 = & a + b + c \\ 5 = & 8 a + 4 b + 2 c \\ 14 = & 27 a + 9 b + 3 c . \end{aligned}

🔗

If we solve this system of equations we get

a = \frac{1}{3},

b = \frac{1}{2}

and

c = \frac{1}{6} .

Therefore the number of squares on an

n \times n

chessboard is

a_{n} = \frac{1}{3} n^{3} + \frac{1}{2} n^{2} + \frac{1}{6} n = \frac{1}{6} n (n + 1) (2 n + 1) .

🔗

Note: Since the squares-on-a-chessboard problem is really asking for the sum of squares, we now have a nice formula for

\sum_{k = 1}^{n} k^{2} .

🔗

Not all sequences will have polynomials as their closed formula. We can use the theory of finite differences to identify these.

🔗

Example 2.3.4.

Determine whether the following sequences can be described by a polynomial, and if so, of what degree.

$1, 2, 4, 8, 16, \dots$

🔗
$0, 7, 50, 183, 484, 1055, \dots$

🔗
$1, 1, 2, 3, 5, 8, 13, \dots$

🔗

🔗

Solution.

As we saw in Example 2.3.1, this sequence is not $Δ^{k}$ -constant for any $k .$ Therefore the closed formula for the sequence is not a polynomial. In fact, we know the closed formula is $a_{n} = 2^{n},$ which grows faster than any polynomial (so is not a polynomial).
🔗

🔗
The sequence of first differences is $7, 43, 133, 301, 571, \dots .$ The second differences are: $36, 90, 168, 270, \dots .$ Third difference: $54, 78, 102, \dots .$ Fourth differences: $24, 24, \dots .$ As far as we can tell, this sequence of differences is constant so the sequence is $Δ^{4}$ -constant and as such the closed formula is a degree 4 polynomial.
🔗

🔗
This is the Fibonacci sequence. The sequence of first differences is $0, 1, 1, 2, 3, 5, 8, \dots,$ the second differences are $1, 0, 1, 1, 2, 3, 5 \dots .$ We notice that after the first few terms, we get the original sequence back. So there will never be constant differences, so the closed formula for the Fibonacci sequence is not a polynomial.
🔗

🔗

🔗

Exercises Exercises

1.

Use polynomial fitting to find the formula for the

n

th term of the sequence

(a_{n})_{n \geq 0}

which starts,

🔗

0, - 1, 4, 15, 32, 55, \dots

🔗

a_{n} =

🔗

2.

Use polynomial fitting to find the formula for the

n

th term of the sequence

(a_{n})_{n \geq 0}

which starts,

🔗

- 4, 5, 20, 41, 68, 101, \dots

🔗

a_{n} =

🔗

3.

Use polynomial fitting to find the formula for the

n

th term of the sequence

(a_{n})_{n \geq 0}

which starts,

🔗

2, 7, 30, 89, 202, 387, \dots

🔗

a_{n} =

🔗

4.

Use polynomial fitting to find the formula for the

n

th term of the sequence

(a_{n})_{n \geq 1}

which starts,

🔗

6, 9, 16, 33, 66, \dots

Note the first term above is

a_{1},

not

a_{0} .

🔗

a_{n} =

🔗

5.

Make up sequences that have

3, 3, 3, 3, … as its second differences.

🔗
1, 2, 3, 4, 5, … as its third differences.

🔗
1, 2, 4, 8, 16, … as its 100th differences.

🔗

🔗

6.

Consider the sequence

1, 3, 7, 13, 21, \dots .

Explain how you know the closed formula for the sequence will be quadratic. Then “guess” the correct formula by comparing this sequence to the squares

1, 4, 9, 16, \dots

(do not use polynomial fitting).

🔗

7.

Use a similar technique as in the previous exercise to find a closed formula for the sequence

2, 11, 34, 77, 146, 247, \dots .

🔗

8.

Suppose Suppose

a_{n} = n^{2} + 5 n - 3 .

Find a closed formula for the sequence of differences by computing

a_{n} - a_{n - 1} .

Simplify your answer as much as posible.

🔗

a_{n} - a_{n - 1} =

🔗

9.

Generalize Exercise 2.3.8: Find a closed formula for the sequence of differences of

a_{n} = a n^{2} + b n + c .

That is, prove that every quadratic sequence has arithmetic differences.

🔗

10.

Can you use polynomial fitting to find the formula for the

n

th term of the sequence 4, 7, 11, 18, 29, 47, …? Explain why or why not.

🔗

11.

Will the

n

th sequence of differences of

2, 6, 18, 54, 162, \dots

ever be constant? Explain.

🔗

12.

In their down time, ghost pirates enjoy stacking cannonballs in triangular based pyramids (aka, tetrahedrons), like those pictured here:

🔗

$A single shaded circle (meant to represent a cannonball)$

$Four overlapping circles, drawn to represent cannonballs stacked with a layer of three in a triangle with a single cannonball resting on top.$

$Overlapping circles drawn to represent a three-dimensional tetrahedron of balls consisting of a triangle of 6 balls supporting a triangle of 3, with a single ball balanced on top.$

Note, these are solid tetrahedrons, so there will be some cannonballs obscured from view (the picture on the right has one cannonball in the back not shown in the picture, for example)

🔗

The pirates wonder how many cannonballs would be required to build a pyramid 15 layers high (thus breaking the world cannonball stacking record). Can you help?

Let $P (n)$ denote the number of cannonballs needed to create a pyramid $n$ layers high. So $P (1) = 1,$ $P (2) = 4,$ and so on. Calculate $P (3),$ $P (4)$ and $P (5) .$
🔗

🔗
Use polynomial fitting to find a closed formula for $P (n) .$ Show your work.
🔗

🔗
Answer the pirate’s question: how many cannonballs do they need to make a pyramid 15 layers high?
🔗

🔗
Bonus: Locate this sequence in Pascal’s triangle. Why does that make sense?
🔗

🔗