Unit 2- Inverse Functions, Complete Square and Sequences

Review unit 1

Precalculus
domains of functions
log-rules
lines

2 / 48
Unit 2

Inverse Functions
Complete Square
Sequences

3 / 48
Inverse Functions

4 / 48
5 / 48
Question 1 a
Find a formula for the inverse of the function:
√
f (x) = 1 + 2 + 3x

6 / 48
Question 1 b
Find a formula for the inverse of the function without switching x and y :
√
f (x) = 1 + 2 + 3x

7 / 48
Question 2

Find the inverse function of y = e 7−4x (without switching x and y ).

Select the correct answer:

8 / 48
Question 2

Find the inverse function of y = e 7−4x (without switching x and y ).

Select the correct answer:

1
(a) x = (7 − ln y )
4
1
(b) x = (7 − e y )
4
1 y
(c) x= 7−
4 e
1
(d) x = − (6 − e y )
4

8 / 48
Question 3: Solving a Logarithmic Equation

Solve for x:
ln x + ln(x − 1) = 1

9 / 48
Question 3: Solving a Logarithmic Equation

Solve for x:
ln x + ln(x − 1) = 1

√
1± 1 + 4e
(a) x=
√2
1 + 1 + 4e
(b) x=
√2
1 − 1 + 4e
(c) x=
2√
−1 ± 1 + 4e
(d) x=
2

9 / 48
Complete Square

Examples:

10 / 48
Complete Square

Examples:

10 / 48
Complete Square

Examples:

10 / 48
Complete Square

Examples:

10 / 48
Sequences

We focus on two types of sequences:

A sequence is a list of numbers written in a definite order

a1 , a2 , a3 , . . . , an , . . .

Explicit sequences: We have a formula for the nth term of the sequence.
Recursive sequences: (also known as difference equations): The nth term of the sequence
depends on some of the terms that precede it.

11 / 48
Examples of Explicit Sequences

n
(a) an = n+1 , n ≥ 1:

12 / 48
Examples of Explicit Sequences

n
(a) an = n+1 , n ≥ 1:

12 / 48
Examples of Explicit Sequences

n
(a) an = n+1 , n ≥ 1:
(b) an = (−1)n−1 , n ≥ 1:

12 / 48
13 / 48
Question 1: Terms in a sequence
List the first five terms of the sequence, starting with n = 1:

(−1)n−1
an =
5n

14 / 48
Question 1: Terms in a sequence
List the first five terms of the sequence, starting with n = 1:

(−1)n−1
an =
5n
 
1 −1 1 −1 1
(a) , , , , ,...
5 25 125 625 3125
 
−1 1 −1 1 −1
(b) , , , , ,...
5 25 125 625 3125
 
1 −1 1 −1 1
(c) , , , , ,...
5 10 15 20 25
 
−1 1 −1 1 −1
(d) , , , , ,...
5 10 15 20 25

14 / 48
Examples of Recursive Sequences

a1 = 1, an+1 = 5an − 3

15 / 48
Examples of a Recursive Sequence

Fibonacci Sequence: F1 = 1, F2 = 1, Fn = Fn−1 + Fn−2 for n ≥ 3

16 / 48
17 / 48
Question 2: List Recursive Sequence Terms

Find the first six terms of the recursive sequence:

a1 = 2, a2 = 1, an+1 = an − an−1

18 / 48
Question 2: List Recursive Sequence Terms

Find the first six terms of the recursive sequence:

a1 = 2, a2 = 1, an+1 = an − an−1

(a) {2, 1, −1, 0, −1, 1, . . .}

(b) {2, 1, −1, −2, −1, 1, . . .}
(c) {2, 1, 1, 0, −1, 1, . . .}
(d) {2, 1, 1, −1, −2, −1, . . .}

18 / 48
First-Order Difference Equations

These take the form

an+1 = f (an ).
Given an initial condition a0 , this equation generates the recursive sequence

a0 , a1 = f (a0 ), a2 = f (a1 ), . . . .

When the sequence is ordered by time, t is often used instead of n.

19 / 48
First-Order Difference Equations
Example: Geometric population growth
Nt+1 = 2Nt , N0 = 1 :

Nt+1 = RNt , N0 given :

20 / 48
Question 3: Population Growth

Consider representing the growth of a population using the difference equation

N0 = 100, Nt+1 = RNt

For which values of R > 0 will the population grow?

21 / 48
22 / 48
(a) R>1
(b) R<1
(c) R=1
(d) R≥1

23 / 48
We focus on two types of sequences:
A sequence is a list of numbers written in a definite order

a1 , a2 , a3 , . . . , an , . . .

Explicit sequences: We have a formula for the nth term of the sequence.
Recursive sequences: (also known as difference equations): The nth term of the sequence
depends on some of the terms that precede it.

24 / 48
Examples of Explicit Sequences

n
(a) an = n+1 , n ≥ 1:

(b) a1 = 2, a2 = 1, an+1 = an − an−1

25 / 48
limits of Sequences

lim an = L or an → L as n → ∞
n→∞
If the limn→∞ an exists, we say the sequence converges.
Otherwise it diverges.

26 / 48
Examples of Explicit Sequences

n
an = n+1 , n ≥ 1:

27 / 48
an = (−1)n−1 , n ≥ 1:

28 / 48
Question 4: Convergent or Divergent?

Determine whether the sequence is convergent or divergent. If it is convergent, find the limit.
3 + 5n
an =
2 + 7n

29 / 48
Question 4: Convergent or Divergent?

Determine whether the sequence is convergent or divergent. If it is convergent, find the limit.
3 + 5n
an =
2 + 7n

(a) Converges to 5/7

(b) Diverges
(c) Converges to 2/3
(d) Converges to 8/9

29 / 48
Question 5: Convergent or Divergent?

Determine whether the sequence is convergent or divergent. If it is convergent, find the limit.

n2
an = √
n3 + 4n

30 / 48
Question 5: Convergent or Divergent?

Determine whether the sequence is convergent or divergent. If it is convergent, find the limit.

n2
an = √
n3 + 4n

(a) Diverges
(b) Converges to 0
(c) Converges to 1
(d) Converges to 1/2

30 / 48
Question 6: Convergent or Divergent?

Determine whether the sequence is convergent or divergent. If it is convergent, find the limit.

−n4 + 1
an = √
n2 − 4n + 5

31 / 48
Question 6: Convergent or Divergent?

Determine whether the sequence is convergent or divergent. If it is convergent, find the limit.

−n4 + 1
an = √
n2 − 4n + 5

(a) Diverges
(b) Converges to 0
(c) Converges to -1
1
(d) Converges to 2

31 / 48
Question 7: Convergent or Divergent?

Determine whether the following two sequences are convergent or divergent.

  
1
an = cos(nπ/2), bn = cos π n +
2

32 / 48
Question 7: Convergent or Divergent?

Determine whether the following two sequences are convergent or divergent.

  
1
an = cos(nπ/2), bn = cos π n +
2

(a) convergent, divergent

(b) divergent, convergent
(c) convergent, convergent
(d) divergent, divergent

32 / 48
33 / 48
Question 8: True/False Convergence

Consider the following recursive sequence

a1 = 2, an+1 = 2an − 1

Determine whether the following statement is true or false:

The sequence converges to 1.

(a) True
(b) False

34 / 48
35 / 48
Question 9: Recursive Sequence Convergence

Consider the recursive sequence

√
a1 = 1, an+1 = 2 + an

Which of the following is true?

(a) The sequence diverges

(b) The sequence converges to a = 2
(c) The sequence converges to a = −1
(d) The sequence converse to both a = 2 and a = −1

36 / 48
37 / 48
Review recursive sequences

A recursive sequence also is called a difference equation.

Examples of first-order difference equations are

Nt+1 = RNt

bn+1 = c + rbn
xt+1 = cxt (1 − xt )
The first two of these examples are linear; the third is nonlinear.

38 / 48
Review recursive sequences

A recursive sequence also is called a difference equation.

Examples of first-order difference equations are

Nt+1 = RNt

bn+1 = c + rbn
xt+1 = cxt (1 − xt )
The first two of these examples are linear; the third is nonlinear.

When the function f in a difference equation is a linear function, we can use mathematics
to rewrite the recursive sequence as an explicit sequence (that is, in terms of n or t). The
explicit form of the sequence is called the solution to the linear difference equation.

38 / 48
Geometric Series

A Geometric Series takes the form:

sn = a + ar + ar 2 + . . . + ar n−1 + ar n

39 / 48
40 / 48
Question 10:
A patient takes 150 mg of a drug at the same time every day. Just before each tablet is taken
5% of the drug present in the preceding time step remains in the body.
The amount of drug in the patient after the first tablet is s0 = 150 mg
After the second tablet it is

s1 = 150 + 150(0.05) mg = 157.5 mg

After the third tablet it is

s2 = 150 + 150(0.05) + 150(0.05)2 mg = 157.875 mg

After the (n + 1)th tablet it is

sn = 150 + 150(0.05) + 150(0.05)2 . . . + 150(0.05)n mg

This is a geometric series with a = 150 and r = 0.05

41 / 48
42 / 48
Geometric Series
Graphically the drug concentration is:

43 / 48
Geometric Series
In the pre-class video we learned that the geometric series can be summed

1 − r n+1
sn = a + ar + ar 2 + . . . + ar n−1 + ar n = a .
1−r

The amount of drug in the patient after the (n + 1)th tablet is a geometric series with
a = 150 and r = 0.05
1 − r n+1 1 − 0.05n+1
sn = a mg = 150 mg.
1−r 1 − 0.05
In the long term, the amount of drug in the patient is

1 − 0.05n+1 150
lim 150 mg = mg = 157.895 mg,
n→∞ 1 − 0.05 1 − 0.05
only slight more than after the second tablet.
44 / 48
Linear Difference Equation

The drug tablet model is an example of a linear difference equation:

bn+1 = c + rbn , b0 = a,

where c is the amount of new medication introduced each time step, r is the amount of
medication remaining from the last time step and a is the amount of medication in the
patient before treatment
The solution from the video (and given in the text page 95) is

1 − rn
 
n
bn = r a + c .
1−r

45 / 48
In the example before: a = 0, c = 150 and r = 0.05 so
1 − 0.05n
bn+1 = 150 + 0.05bn , b0 = 0, bn = 150 .
1 − 0.05

46 / 48
Question 11: The Logistic Equation

We can try the same idea to find the limit for the logistic equation, which is a nonlinear,
first-order difference equation (we will not be able to obtain the solution for this
sequence),
xt+1 = cxt (1 − xt ).
Let us choose c = 2.8 and x0 = 0.8, and generate the sequence using Wolfram Alpha
Link to see if the sequence converges.

We observe that the sequence converges to approximately 0.65.

Let’s find the exact value with a limit calculation . . .

47 / 48
Finding the Limit for the Logistic Equation
Recall
xt+1 = 2.8xt (1 − xt ).

48 / 48