Skip to content

Chapter 2 — Functions

2.11 — Closing: Review Problems

The problems below do not repeat the examples solved in the chapter: each one requires, at some point, a decision the reader must make alone, whether which technique to apply, in what order, or why a tool is not enough. They are organized in the three levels of the competency checklist of §2.10. The reference in brackets indicates the section where the necessary tools are found; several problems require combining more than one.

We use the chapter’s notation: Dom⁡(f)\operatorname{Dom}(f) is the domain of ff, Img⁡(f)\operatorname{Img}(f) its image and Gr⁡(f)\operatorname{Gr}(f) its graph. When a function is given only by its formula, its domain is the implicit one and its codomain is R\mathbb{R}, following the convention of §2.2.


1. [§2.2] Determine the implicit domain of f(x)=x+5x2−9f(x) = \dfrac{\sqrt{x+5}}{x^2-9}.

2. [§2.1, §2.3] Let f(x)=3x−1f(x)=3x-1, with explicit domain [0,4][0,4]. Using that ff is increasing, find Img⁡(f)\operatorname{Img}(f).

3. [§2.3] Determine whether f(x)=x4−3x2f(x)=x^4-3x^2 is even, odd, or neither.

4. [§2.4] Without recomputing from scratch, state the domain, image and monotonicity of f(x)=∣x∣f(x)=|x|, relying on the catalog.

5. [§2.5] Describe in words the transformation that takes y=x2y=x^2 to y=−3(x+2)2−1y=-3(x+2)^2-1, identifying aa, hh, cc and kk.

6. [§2.6] Given f(x)=x+2f(x)=x+2 and g(x)=xg(x)=\sqrt{x}, find (f+g)(x)(f+g)(x), (f⋅g)(x)(f\cdot g)(x) and the domain of each.

7. [§2.6] With the same ff and gg as in the previous problem, find (g∘f)(x)(g\circ f)(x) and its domain.

8. [§2.7] Determine whether f(x)=x2+1f(x)=x^2+1, with domain [0,∞)[0,\infty), is injective, and if so find f−1f^{-1}.

9. [§2.8] Find the vertex of f(x)=−2x2+8x−3f(x)=-2x^2+8x-3 and classify it as an absolute maximum or minimum.


1. [§2.2, §2.6] Let h(x)=x−2x−5h(x) = \dfrac{\sqrt{x-2}}{x-5}. Compute Dom⁡(h)\operatorname{Dom}(h) directly, and check the result by writing hh as a quotient of two known functions and applying the rule of §2.6 for the domain of a quotient.

2. [§2.3] Prove, with the definition of monotonicity and without appealing to the graph, that f(x)=1xf(x)=\dfrac{1}{x} is decreasing on (0,∞)(0,\infty).

3. [§2.3, §2.5] Let f(x)=x2−4f(x)=x^2-4 and let g(x)=f(−x)g(x)=f(-x). Check, by computing g(x)g(x), that g=fg = f, and therefore Gr⁡(g)=Gr⁡(f)\operatorname{Gr}(g)=\operatorname{Gr}(f). Explain which result of §2.5 guarantees this in advance.

4. [§2.6] Let f(x)=2xf(x)=2x and g(x)=x−3g(x)=\sqrt{x-3}. Compute Dom⁡(g∘f)\operatorname{Dom}(g\circ f) and explain, with the definition of composition of §2.6, why considering Dom⁡(f)\operatorname{Dom}(f) alone is not enough.

5. [§2.7] Prove that f(x)=2x+1x−3f(x) = \dfrac{2x+1}{x-3} is injective on its domain, find its image, find f−1f^{-1} and verify the identity f−1(f(x))=xf^{-1}(f(x))=x.

6. [§2.8] Among all pairs of positive reals whose product is 3636, find the pair that minimizes the sum, using the AM-GM inequality. Check the result by evaluating the sum for at least two different pairs that satisfy the constraint.

7. [§2.1, §2.3] Let R={(x,y)∈R×R∣y2=x}R=\{(x,y)\in\mathbb{R}\times\mathbb{R} \mid y^2=x\}. Determine whether RR is a function from [0,∞)[0,\infty) to R\mathbb{R}. If it is not, propose a subset of RR that is a function from [0,∞)[0,\infty) to R\mathbb{R}, and find its image.


Level 3 — Challenge, application and frontier

Section titled “Level 3 — Challenge, application and frontier”

1. [§2.4] Formalize and prove, with the same MM and δ\delta scheme of §2.4, that f(x)=2x−3f(x)=\dfrac{2}{x-3} grows without bound as x→3+x\to3^+.

2. [§2.8] The function f(x)=x3−3xf(x)=x^3-3x is, according to the frontier note of §2.8, a case that none of the tools of that section fully settles. By evaluating ff on a grid of points of [−2,2][-2,2], determine as precisely as possible on which subintervals it appears to increase and on which it appears to decrease. Discuss why this method, though informative, cannot guarantee the exact location of any relative extremum.

3. [§2.6, §2.7] Let f:A→Bf:A\to B and g:B→Cg:B\to C be bijective functions. Prove that g∘f:A→Cg\circ f:A\to C is bijective and that (g∘f)−1=f−1∘g−1(g\circ f)^{-1} = f^{-1}\circ g^{-1}.

4. [§1.6, §2.8] A farmer has 200200 meters of wire to fence a rectangular pen, using a straight wall as one of the four sides, so that the wire covers only the other three. Set up the area as a function of a single side, following the problem-solving method of §1.6; find the dimensions that maximize the area with the tools of §2.8, and check the result in the context of the problem.

5. [§2.1, §2.2] An equivalence relation on a set XX is a relation ∼\sim between elements of XX that is reflexive (u∼uu\sim u for every uu), symmetric (if u∼vu\sim v, then v∼uv\sim u) and transitive (if u∼vu\sim v and v∼wv\sim w, then u∼wu\sim w). Prove that the equality of functions defined in §2.2, according to which f:A→Bf:A\to B and g:C→Dg:C\to D are equal when A=CA=C, B=DB=D and f(x)=g(x)f(x)=g(x) for every x∈Ax\in A, is an equivalence relation on any set of functions.


The answers for levels 1 and 2 are given in full when the result is a value or a closed expression; when the problem asks for a proof, the central step is indicated. The answers for level 3 are hints rather than solutions, so as not to empty each problem of its challenge.

Level 1

  1. We need x+5≥0x+5\ge0 and x2−9≠0x^2-9\neq0, that is, x≥−5x\ge-5 and x≠±3x\neq\pm3: Dom⁡(f)=[−5,−3)∪(−3,3)∪(3,∞)\operatorname{Dom}(f) = [-5,-3)\cup(-3,3)\cup(3,\infty).
  2. Since ff is increasing, f(0)=−1≤f(x)≤f(4)=11f(0)=-1\le f(x)\le f(4)=11 for x∈[0,4]x\in[0,4]; and every y∈[−1,11]y\in[-1,11] is attained at x=y+13∈[0,4]x=\frac{y+1}{3}\in[0,4]. Hence Img⁡(f)=[−1,11]\operatorname{Img}(f) = [-1,11].
  3. Even: f(−x)=(−x)4−3(−x)2=x4−3x2=f(x)f(-x)=(-x)^4-3(-x)^2=x^4-3x^2=f(x) for every x∈Rx\in\mathbb{R}.
  4. Dom⁡=R\operatorname{Dom}=\mathbb{R}, Img⁡=[0,∞)\operatorname{Img}=[0,\infty); decreasing on (−∞,0](-\infty,0] and increasing on [0,∞)[0,\infty).
  5. a=1a=1, h=−2h=-2, c=−3c=-3, k=−1k=-1: vertical stretch by a factor of 33 with reflection across the xx-axis, shift 22 units to the left and 11 unit down.
  6. (f+g)(x)=x+2+x(f+g)(x) = x+2+\sqrt{x} and (f⋅g)(x)=(x+2)x(f\cdot g)(x) = (x+2)\sqrt{x}, both with domain R∩[0,∞)=[0,∞)\mathbb{R}\cap[0,\infty)=[0,\infty).
  7. (g∘f)(x)=x+2(g\circ f)(x) = \sqrt{x+2}, with domain {x∣x+2≥0}=[−2,∞)\{x \mid x+2\ge0\}=[-2,\infty).
  8. Injective, since it is increasing on [0,∞)[0,\infty); its image is [1,∞)[1,\infty) and f−1(x)=x−1f^{-1}(x) = \sqrt{x-1}, with domain [1,∞)[1,\infty).
  9. Vertex at x=−82⋅(−2)=2x=-\frac{8}{2\cdot(-2)}=2, with f(2)=5f(2)=5; absolute maximum, since −2<0-2<0.

Level 2

  1. Dom⁡(h)=[2,5)∪(5,∞)\operatorname{Dom}(h) = [2,5)\cup(5,\infty). With u(x)=x−2u(x)=\sqrt{x-2} and v(x)=x−5v(x)=x-5, the rule gives Dom⁡(u)∩Dom⁡(v)\operatorname{Dom}(u)\cap\operatorname{Dom}(v) minus the zeros of vv: [2,∞)∖{5}[2,\infty)\setminus\{5\}.
  2. For 0<x1<x20<x_1<x_2: 1x1−1x2=x2−x1x1x2>0\dfrac{1}{x_1}-\dfrac{1}{x_2} = \dfrac{x_2-x_1}{x_1x_2}>0, because numerator and denominator are positive; hence f(x1)>f(x2)f(x_1)>f(x_2).
  3. g(x)=(−x)2−4=x2−4=f(x)g(x)=(-x)^2-4=x^2-4=f(x), with the same domain R\mathbb{R}. Section 2.5 shows that Gr⁡(g)\operatorname{Gr}(g) is the reflection of Gr⁡(f)\operatorname{Gr}(f) across the yy-axis, and an even function coincides with its reflection.
  4. (g∘f)(x)=2x−3(g\circ f)(x)=\sqrt{2x-3}, and Dom⁡(g∘f)={x∈R∣2x≥3}=[32,∞)\operatorname{Dom}(g\circ f) = \{x\in\mathbb{R} \mid 2x\ge3\}=\left[\frac{3}{2},\infty\right), strictly contained in Dom⁡(f)=R\operatorname{Dom}(f)=\mathbb{R}: the definition also requires f(x)∈Dom⁡(g)f(x)\in\operatorname{Dom}(g).
  5. If f(x1)=f(x2)f(x_1)=f(x_2), cross-multiplying gives (2x1+1)(x2−3)=(2x2+1)(x1−3)(2x_1+1)(x_2-3)=(2x_2+1)(x_1-3), which reduces to 7x1=7x27x_1=7x_2. Solving y=2x+1x−3y=\frac{2x+1}{x-3} gives x=3y+1y−2x=\frac{3y+1}{y-2}, possible if and only if y≠2y\neq2; hence Img⁡(f)=R∖{2}\operatorname{Img}(f)=\mathbb{R}\setminus\{2\} and, as a function from R∖{3}\mathbb{R}\setminus\{3\} to R∖{2}\mathbb{R}\setminus\{2\}, f−1(x)=3x+1x−2f^{-1}(x) = \dfrac{3x+1}{x-2}.
  6. By AM-GM, a+b≥2ab=12a+b\ge2\sqrt{ab}=12, with equality if and only if a=b=6a=b=6. For example, 4+9=13>124+9=13>12 and 3+12=15>123+12=15>12.
  7. No: (4,2)(4,2) and (4,−2)(4,-2) are in RR, and uniqueness fails. The subset {(x,x)∣x≥0}\{(x,\sqrt{x}) \mid x\ge0\} is a function, with image [0,∞)[0,\infty); so is {(x,−x)∣x≥0}\{(x,-\sqrt{x}) \mid x\ge0\}, with image (−∞,0](-\infty,0].

Level 3 — hints

  1. Given M>0M>0, choose δ=2M\delta=\frac{2}{M}: if 0<x−3<δ0<x-3<\delta, then 2x−3>2δ=M\frac{2}{x-3}>\frac{2}{\delta}=M.
  2. At x=−2, −1.5, −1, −0.5, 0, 0.5, 1, 1.5, 2x=-2,\ -1.5,\ -1,\ -0.5,\ 0,\ 0.5,\ 1,\ 1.5,\ 2 we get −2, 1.125, 2, 1.375, 0, −1.375, −2, −1.125, 2-2,\ 1.125,\ 2,\ 1.375,\ 0,\ -1.375,\ -2,\ -1.125,\ 2. The values suggest growth up to near x=−1x=-1, decrease up to near x=1x=1 and growth afterwards. A finite number of evaluations says nothing about what happens between two grid points: it only bounds where the extremum can be.
  3. Injectivity: if g(f(x1))=g(f(x2))g(f(x_1))=g(f(x_2)), the injectivity of gg gives f(x1)=f(x2)f(x_1)=f(x_2), and that of ff gives x1=x2x_1=x_2. Surjectivity: given z∈Cz\in C, there is y∈By\in B with g(y)=zg(y)=z and there is x∈Ax\in A with f(x)=yf(x)=y. For the inverse, use the associativity of §2.6 and check that (f−1∘g−1)∘(g∘f)=idA(f^{-1}\circ g^{-1})\circ(g\circ f)=\mathrm{id}_A and (g∘f)∘(f−1∘g−1)=idC(g\circ f)\circ(f^{-1}\circ g^{-1})=\mathrm{id}_C; the characterization of §2.7 concludes.
  4. With xx the side perpendicular to the wall, the parallel side is 200−2x200-2x and the area is A(x)=x(200−2x)=−2x2+200xA(x)=x(200-2x)=-2x^2+200x, with 0<x<1000<x<100. The vertex is at x=50x=50: the parallel side measures 100100 m and the maximum area is 50005000 m². Both sides are positive and exactly 50+50+100=20050+50+100=200 m of wire are used.
  5. Reflexivity and symmetry follow directly from the properties of equality of sets and of numbers. For transitivity, if f=gf=g and g=kg=k, chain the equalities of domains, those of codomains and, for each xx of the common domain, f(x)=g(x)=k(x)f(x)=g(x)=k(x).

With these problems solved, or at least seriously attempted, including those of level 3 that do not always yield on the first try, the reader is ready to take the chapter exam, which assesses, under time pressure, a sample of these same three levels.