Mathematical-Reasoning Β· Unit 21 Β· Video 3 Β· Interactive Practice

Derivatives, Averages and Sequences as Functions

IKey Formulas

FormulaNameDomain and codomain
D(f)=f′D(f) = f'Derivative function D:F→TD : F \to TFF = all differentiable real functions, TT = all real functions; inputs and outputs are functions
avg(A)=a1+a2+β‹―+ann\text{avg}(A) = \dfrac{a_1 + a_2 + \cdots + a_n}{n}Average function avg:F(R)β†’R\text{avg} : \mathcal{F}(\mathbb{R}) \to \mathbb{R}A={a1,a2,…,an}A = \{a_1, a_2, \dots, a_n\} a nonempty finite set of reals with nn distinct elements
⟨an⟩\langle a_n \rangle, a(n)=ana(n) = a_nSequenceA function whose domain is N\mathbb{N} or an infinite subset of Nβˆͺ{0}\mathbb{N} \cup \{0\}

Key Insight: A process becomes a function once its domain and codomain are named and each input has exactly one output in the codomain. The domain leaves out the inputs on which the rule fails: non-differentiable functions for DD, the empty set and infinite sets for avg\text{avg}.

IIVisualization 1 β€” Functions as Inputs and Outputs

The derivative function D:F→TD : F \to T takes a whole function as its input and returns another whole function.

IIIVisualization 2 β€” Which Sets Can Be Averaged?

The average function accepts a set only when it is nonempty and finite, and counts each element once.

IVVisualization 3 β€” A Sequence Is a Function of Its Index

A sequence is a function on N\mathbb{N} or an infinite subset of Nβˆͺ{0}\mathbb{N} \cup \{0\}, so its domain decides which terms exist.

VQuiz Questions

Problem 1 Β· Averaging a Set Written with a Repeat

Given: B={2,βˆ’4,2,6,5}B = \{2, -4, 2, 6, 5\} β€” find avg(B)\text{avg}(B).

βœ… Correct! As a set, B={βˆ’4,2,5,6}B = \{-4, 2, 5, 6\} has 44 elements with sum 99, so avg(B)=94\text{avg}(B) = \tfrac{9}{4}.
❌ Not quite. Writing 22 twice does not make two elements: you added 22 twice and divided by 55, but BB has only 44 elements.
❌ Close. The sum 99 is right, but nn is the number of elements of the set, which is 44, not the 55 entries written.
❌ Close. Dividing by 44 is right, but the sum 1111 still counts the repeated 22 twice; the sum of the elements is 99.
Show solution

A set contains each element once, however it is written, so B={2,βˆ’4,6,5}B = \{2, -4, 6, 5\}, with n=4n = 4 elements.

avg(B)=2+(βˆ’4)+6+54=94=2.25\text{avg}(B) = \frac{2 + (-4) + 6 + 5}{4} = \frac{9}{4} = 2.25

Since BB is nonempty and finite, B∈F(R)B \in \mathcal{F}(\mathbb{R}), and the average function gives it exactly one output.

Problem 2 Β· Which Process Is a Function?

Given: four processes, each with a proposed domain and codomain. Here PP is the set of all polynomial functions with real coefficients and F(R)\mathcal{F}(\mathbb{R}) is the set of nonempty finite subsets of R\mathbb{R}. Which one is a function from the stated domain to the stated codomain?

βœ… Correct! Every polynomial is differentiable and its derivative is again a polynomial, so each p∈Pp \in P has exactly one output pβ€²βˆˆPp' \in P.
❌ Not quite. The empty set is a finite subset of R\mathbb{R}, and it has no average: n=0n = 0 would mean dividing by zero. That is why F(R)\mathcal{F}(\mathbb{R}) contains only nonempty sets.
❌ Not quite. An infinite set such as N\mathbb{N} is a subset of R\mathbb{R}, and its number of elements is not an element of Nβˆͺ{0}\mathbb{N} \cup \{0\}. Counting is a function only on finite sets.
❌ Not quite. N\mathbb{N} is a nonempty subset of R\mathbb{R} with no largest element, so max⁑(N)\max(\mathbb{N}) does not exist. On F(R)\mathcal{F}(\mathbb{R}), where every set is finite, max⁑\max is a function.
Show solution

A process is a function only if every element of the domain has exactly one output in the codomain. Test each with one input:

  • (a) The input βˆ…\emptyset has no average, since sum0\tfrac{\text{sum}}{0} is undefined.
  • (b) The input N\mathbb{N} does not have a number of elements in Nβˆͺ{0}\mathbb{N} \cup \{0\}.
  • (c) The input N\mathbb{N} has no largest element (the input R\mathbb{R} fails too).
  • (d) If p(x)=ckxk+β‹―+c1x+c0p(x) = c_k x^k + \cdots + c_1 x + c_0, then pβ€²(x)=kckxkβˆ’1+β‹―+c1p'(x) = k c_k x^{k-1} + \cdots + c_1, which is again a polynomial (a constant polynomial gives the zero polynomial). So DP:Pβ†’PD_P : P \to P is a function.

Like D:F→TD : F \to T, the function DPD_P has functions as inputs and as outputs; it simply has a smaller domain and codomain.

Problem 3 Β· Starting the Index at Zero

Given: the odd natural numbers 11, 33, 55, 77, … are listed as a sequence ⟨bn⟩\langle b_n \rangle with domain Nβˆͺ{0}\mathbb{N} \cup \{0\}, so the first term is b0=1b_0 = 1. Find a formula for bnb_n and the value of b10b_{10}.

Which formula gives bnb_n?

What is b10b_{10}?

βœ… Correct! bn=2n+1b_n = 2n + 1 gives b0=1b_0 = 1, b1=3b_1 = 3, b2=5b_2 = 5, …, and b10=21b_{10} = 21 is the eleventh term of the list.
❌ Not quite. 2nβˆ’12n - 1 is the formula when the index starts at n=1n = 1. With domain Nβˆͺ{0}\mathbb{N} \cup \{0\} it gives b0=βˆ’1b_0 = -1, which is not the first term 11.
❌ Not quite. 2n2n gives b0=0b_0 = 0 and b1=2b_1 = 2: those are the even numbers.
❌ Not quite. 2n+32n + 3 gives b0=3b_0 = 3, so the list would skip the first term 11.
❌ Not quite. Check your formula at n=0n = 0, 11, 22 against the terms 11, 33, 55.
❌ Close. 1919 is the tenth odd number, but with the index starting at 00 the tenth term is b9b_9. The index 1010 gives b10=2β‹…10+1b_{10} = 2 \cdot 10 + 1.
❌ Not quite. Every term of this sequence is odd; substitute n=10n = 10 into bn=2n+1b_n = 2n + 1.
❌ Not quite. 23=2β‹…11+123 = 2 \cdot 11 + 1 is b11b_{11}; the index here is 1010.
❌ Not quite. Substitute n=10n = 10 into the formula for bnb_n.
Show solution

Consecutive odd numbers differ by 22, so bn=2n+cb_n = 2n + c for some constant cc. The first term is b0=2β‹…0+c=cb_0 = 2 \cdot 0 + c = c, and it must equal 11, so c=1c = 1:

bn=2n+1(n∈Nβˆͺ{0})b_n = 2n + 1 \quad (n \in \mathbb{N} \cup \{0\})

Check: b1=3b_1 = 3, b2=5b_2 = 5, b3=7b_3 = 7. Then

b10=2β‹…10+1=21.b_{10} = 2 \cdot 10 + 1 = 21.

Because the index starts at 00, the inputs 0,1,…,100, 1, \dots, 10 are eleven inputs, so b10b_{10} is the eleventh term. The same list with domain N\mathbb{N} would need the formula 2nβˆ’12n - 1.

Problem 4 Β· Ranges and Equal Sequences

Given: the sequences a,c,d:Nβ†’Ra, c, d : \mathbb{N} \to \mathbb{R} defined by an=(βˆ’1)nβ‹…na_n = (-1)^n \cdot n, cn=nn+1c_n = \dfrac{n}{n + 1} and dn=1βˆ’1n+1d_n = 1 - \dfrac{1}{n + 1}. Find the range of ⟨an⟩\langle a_n \rangle and decide whether ⟨cn⟩=⟨dn⟩\langle c_n \rangle = \langle d_n \rangle.

What is the range of ⟨an⟩\langle a_n \rangle?

Is ⟨cn⟩=⟨dn⟩\langle c_n \rangle = \langle d_n \rangle?

βœ… Correct! The terms of ⟨an⟩\langle a_n \rangle are βˆ’1-1, 22, βˆ’3-3, 44, …, and 1βˆ’1n+1=nn+11 - \tfrac{1}{n+1} = \tfrac{n}{n+1} for every nn, so the two sequences are the same function.
❌ Not quite. Not every nonzero integer is a term: 11 would need (βˆ’1)nβ‹…n=1(-1)^n \cdot n = 1, which forces n=1n = 1, but a1=βˆ’1a_1 = -1. Likewise βˆ’2-2 never occurs.
❌ Not quite. {βˆ’1,1}\{-1, 1\} is the range of ⟨(βˆ’1)n⟩\langle (-1)^n \rangle. Here the factor nn makes ∣an∣=n|a_n| = n, so the range is infinite.
❌ Check the signs. Odd nn give (βˆ’1)n=βˆ’1(-1)^n = -1, so the odd values are negative: a1=βˆ’1a_1 = -1, a3=βˆ’3a_3 = -3; even nn give positive values.
❌ Not quite. List the first few terms a1a_1, a2a_2, a3a_3, a4a_4 and look at their signs.
❌ Not quite. Two sequences are equal when they have the same domain and the same output at every input; different formulas can give the same outputs. Simplify 1βˆ’1n+11 - \tfrac{1}{n+1}.
❌ Not quite. They are not merely close: 1βˆ’1n+1=n+1βˆ’1n+1=nn+11 - \tfrac{1}{n+1} = \tfrac{n+1-1}{n+1} = \tfrac{n}{n+1} exactly, for every nn.
❌ Recompute d1d_1. d1=1βˆ’11+1=12d_1 = 1 - \tfrac{1}{1 + 1} = \tfrac{1}{2}, which equals c1c_1.
❌ Not quite. Compare cnc_n and dnd_n at a general nn, not only at a few values.
Show solution

Range. For odd nn, (βˆ’1)n=βˆ’1(-1)^n = -1, so an=βˆ’na_n = -n; for even nn, (βˆ’1)n=1(-1)^n = 1, so an=na_n = n. The terms are βˆ’1-1, 22, βˆ’3-3, 44, βˆ’5-5, 66, …, so

range={βˆ’1,βˆ’3,βˆ’5,… }βˆͺ{2,4,6,… }.\text{range} = \{-1, -3, -5, \dots\} \cup \{2, 4, 6, \dots\}.

The values 11, βˆ’2-2, 33, … never occur, so the range is not all of Zβˆ’{0}\mathbb{Z} - \{0\}.

Equality. Both sequences are functions from N\mathbb{N} to R\mathbb{R}. For every n∈Nn \in \mathbb{N},

dn=1βˆ’1n+1=(n+1)βˆ’1n+1=nn+1=cn.d_n = 1 - \frac{1}{n + 1} = \frac{(n + 1) - 1}{n + 1} = \frac{n}{n + 1} = c_n.

Same domain, same codomain and the same output at every input, so ⟨cn⟩=⟨dn⟩\langle c_n \rangle = \langle d_n \rangle: the first terms are 12\tfrac{1}{2}, 23\tfrac{2}{3}, 34\tfrac{3}{4}, … for both.

Solved: 0 / 4