1 of 16

Geometric Sequence

2 of 16

Objective

  • Review over arithmetic sequence
  • Review over how to find the explicit and recursive rules
  • Go over geometric sequence
  • Go over how to find the explicit and recursive rules
  • Do some examples
  • Homework

3 of 16

OKAY, SO THEN WHAT’S A SEQUENCE?

A sequence is just an ordered list of numbers.

Something like:

4

7

10

13

16

19

22

25

1

2

3

4

5

6

7

8

n

f(n)

Something important to note, each number in the list is called a term of the sequence.

So, for example, the first term of this sequence is 4.

Now we care about this because it allows us to take this basic sequence, and turn it into a function.

For example, we can see that as we move up the sequence

We are adding 3 to the term before.

+3

+3

+3

+3

+3

+3

+3

This is what we would call a recursive pattern.

4 of 16

Determining the Recursive Pattern

So how do we actually take a recursive pattern and determine it as a function?

Well, to be honest, we take what we are given, and plug them in for x and y.

It sounds worse than it is, so let’s do an example:

5 of 16

Example 1:

Convert the following sequence to a function:

n

1

2

3

4

5

f(n)

5

7

9

11

13

To start, let’s look at this sequence in terms of x and y:

X

0

1

2

3

4

Y

5

7

9

11

13

Now, that we can see our sequence in a way we can recognize, we need to figure out what this looks like as a function.

First, let’s see what recursive pattern we can find in this sequence.

So, looking at the y’s, we can see that when x = 0, y = 5.

So, our function is going to look something like:

 

Now we need to look at the pattern we can see from the sequence.

As we can see, the sequence is adding 2 to each of the y’s.

This actually translates as multiplying the x by 2.

Like so:

 

And now, we convert back to function notation:

 

And there is our function!

6 of 16

Explicit versus Recursive

So now that we know of a way to determine a function when given just a sequence.

We need to tell the difference between an explicit rule, and a recursive rule.

An explicit rule defines the term of n as a function of n, where as a recursive rule defines the term in position n by relating it to one or more previous terms.

So for example, using our last sequence:

n

1

2

3

4

5

f(n)

5

7

9

11

13

Now we know, from what we saw before, our function is:

 

But, since this is the function that defines the term n, as a function of n, this is the explicit rule.

The recursive rule deals with former terms.

So, we can see looking at previous terms, that we are just adding 2 each time.

So the recursive rule would look something like:

 

So, how do we know this works?

Well because if we try out what it says for, let’s say, the 4th term:

 

 

 

 

So, the difference between the explicit and recursive rule, is with the explicit rule, you don’t need the sequence to find it.

For the recursive, you have to have the sequence to find it.

Let’s do a few more examples so you can get the picture:

7 of 16

Example 2:

Determine the explicit and recursive rules for this sequence.

n

5

6

7

8

9

f(n)

22

29

36

43

50

First things first, let’s find the pattern:

We can see that we are adding 7 each time

So, recursive rule is going to be:

 

Now we need to find our explicit rule.

We know we’re adding 7 each time

And that adding translates to multiplying

So, our explicit rule is going to look something like:

Now, we plug in our n, and f(n) to see what we need to add/subtract.

So, let’s start with n = 5

Like so:

 

 

Now we need to figure out what c is.

To do that, we need to solve for c:

 

-35 -35

 

So, our explicit rule is:

 

8 of 16

SO THEN, WHAT’S A GEOMETRIC SEQUENCE?

Well, a geometric sequence deals with exponential functions instead of linear ones.

Basically, where an arithmetic sequence deals with adding to the former (recursive)

The geometric sequence deals with multiplying to the former (still recursive)

So, to figure out what to do, we need to use the method of finite differences.

9 of 16

THE METHOD OF FINITE DIFFERENCES

To use the method of finite differences, we need to first start with a sequence first:

X

Y

0

1

1

3

2

9

3

27

4

81

Next, we need to add “levels” to it to figure out what the power is:

Level 1

The way we use the levels, is we figure out what we need to add to the sequence to get the next number.

For example:

+2

+6

+18

+54

Now, since we didn’t find a pattern, we go to the next level:

Level 2

+4

+12

+36

Looking at level 2, it looks like we’re seeing a pattern here.

It would seem each number is being multiplied by 3.

So, this would mean our function is:

 

Now let’s check to see if this is true:

 

 

 

 

 

So our method works!

However, there is another way to do this:

10 of 16

FINDING THE RATIO

Another way to find the function we are looking for is to take the ratio.

The issue with using this way, is that you need to know for a fact that you are dealing with a geometric sequence and not an arithmetic one.

So to use the ratio method, you take one of the sequences terms

And divide it by its former term.

Like so:

n

f(n)

0

1

1

4

2

16

3

64

4

256

 

 

 

 

So, our explicit rule is:

 

Now that we know how to find the geometric functions

Let’s look at a few examples:

11 of 16

EXAMPLE 1:

Determine the explicit and recursive rules for this sequence.

n

f(n)

0

1

1

7

2

49

3

343

4

2401

Level 1

+6

+42

+294

+2058

So, looking at this we can see this is going to be a geometric sequence.

But, to really find out what we are missing let’s make sure to look at the levels to determine what the function is.

So level 1:

Well, that didn’t help much, so let’s continue:

Level 2

+36

+252

+1764

Well, it would seem we’re multiplying by 7 each time.

Although this one is harder to see.

Either way, we can see that our explicit rule will be:

 

And our recursive rule will be:

 

12 of 16

That seemed unnecessarily harder.�Why not use the other way?

Well, to be fair, we used the method of finite differences on an easier problem than what we are used to.

Many times we’ll face something a little more complicated.

Like this one:

13 of 16

Example 2:

Determine the explicit and recursive rules for this sequence.

n

f(n)

0

3

1

9

2

51

3

345

4

2403

Level 1

+6

+42

+294

+2058

So, looking at this we can see this is going to be a geometric sequence.

But, to really find out what we are missing let’s make sure to look at the levels to determine what the function is.

So level 1:

Well, that didn’t help much, so let’s continue:

Level 2

+36

+252

+1764

Well, it would seem we’re multiplying by 7 each time.

Although this one is harder to see.

Either way, it looks like our explicit rule is:

 

However, let’s check to see if this actually works.

We can do that by plugging in one of the terms.

Let’s start with the zero term:

 

 

Hmmm, that didn’t work.

Well we know by using the method of finite differences that we are multiplying by 7.

But let’s see if we need to add something.

Let’s try to add c:

 

Now let’s find c:

 

 

 

 

So our explicit rule is:

 

And our recursive rule is:

 

14 of 16

Wow that sucked

But that’s Algebra 2

So, here are a few more examples to make sure you got it.

15 of 16

Example 3:

Determine the explicit and recursive rules for this sequence.

n

f(n)

0

5

1

6

2

8

3

12

4

20

Level 1

+1

+2

+4

+8

So, looking at this we can see this is going to be a geometric sequence.

But, to really find out what we are missing let’s make sure to look at the levels to determine what the function is.

So level 1:

Well, that didn’t help much, so let’s continue:

Level 2

+1

+2

+4

Well, it would seem we’re multiplying by 2 each time.

So, it would seem our explicit rule is:

 

However, let’s check to see if this actually works.

We can do that by plugging in one of the terms.

Let’s start with the zero term:

 

 

Hmmm, that didn’t work.

Well we know by using the method of finite differences that we are multiplying by 2.

But let’s see if we need to add something.

Let’s try to add c:

 

Now let’s find c:

 

 

 

 

So our explicit rule is:

 

And our recursive rule is:

 

16 of 16

Example 4:

Determine the explicit and recursive rules for this sequence.

n

f(n)

0

-1

1

4

2

34

3

214

4

1294

Level 1

+5

+30

+180

+1080

So, looking at this we can see this is going to be a geometric sequence.

But, to really find out what we are missing let’s make sure to look at the levels to determine what the function is.

So level 1:

Well, that didn’t help much, so let’s continue:

Level 2

+25

+150

+900

Well, it would seem we’re multiplying by 6 each time.

Although this one is harder to see.

Either way, it looks like our explicit rule is:

 

However, let’s check to see if this actually works.

We can do that by plugging in one of the terms.

Let’s start with the zero term:

 

 

Hmmm, that didn’t work.

Well we know by using the method of finite differences that we are multiplying by 6.

But let’s see if we need to add something.

Let’s try to add c:

 

Now let’s find c:

 

 

 

 

So our explicit rule is:

 

And our recursive rule is: