• Aucun résultat trouvé

A different proof for the quotient rule

N/A
N/A
Protected

Academic year: 2022

Partager "A different proof for the quotient rule"

Copied!
13
0
0

Texte intégral

(1)

MAT137Y1 – LEC0501

Calculus!

Differentiation rules (2)

(2)

For next week

For Monday (Oct 29), watch the videos:

• Trig derivatives, implicit differentiation: 3.11, 3.12 For Wednesday (Oct 31), watch the videos:

• Derivatives of exponentials and logarithms:

3.13, (3.14), 3.15, 3.16, 3.17, 3.18

• Related rates: 3.19, 3.20

(3)

A different proof for the quotient rule

Assume we have already proven the product rule, the chain rule and we know the derivative of𝑝(𝑥) = 1

𝑥. Obtain a formula for the derivative ofℎ(𝑥) = 𝑓 (𝑥)

𝑔(𝑥).

(4)

A pesky function

Letℎ(𝑥) = {

𝑥2sin(1𝑥) if𝑥 ≠ 0 0 if𝑥 = 0 .

1 Calculate ℎ(𝑥)for any𝑥 ≠ 0.

2 Isℎ continuous at0?

3 Isℎ differentiable at0? If so, computeℎ(0).

4 Isℎcontinuous at0?

(5)

True or False

Let𝑓 be a function with domain ℝand𝑎 ∈ ℝ.

Assume that𝑓 is differentiable everywhere.

What can we conclude?

1 𝑓 (𝑎)is defined.

2 𝑓 is continuous at𝑎.

3 lim

𝑥→𝑎𝑓 (𝑥)exists.

4 𝑓(𝑎)exists.

5 lim

𝑥→𝑎𝑓(𝑥)exists.

6 𝑓 is continuous at𝑎.

(6)

Higher order derivatives

Let𝑔(𝑥) = 1 𝑥3.

Calculate the first few derivatives.

Make a conjecture for a formula of𝑔(𝑛)(𝑥), the𝑛-th derivative.

Prove it.

(7)

Computations

Compute the derivative of

1

𝑓 (𝑥) = √2𝑥

2

+ 𝑥 + 1

2

𝑓 (𝑥) = √𝑥 + √𝑥 + √𝑥 + 1

(8)

Iterated derivatives of (𝑓 × 𝑔)

Assume𝑓 and𝑔 are functions that have all their derivatives.

Find formulas for the following derivatives:

1 (𝑓 𝑔)(𝑥)

2 (𝑓 𝑔)(𝑥)

3 (𝑓 𝑔)(𝑥)

Do these formulae seem familiar?

Make a conjecture for a formula for(𝑓 𝑔)(𝑛).

(9)

Iterated derivatives of (𝑓 × 𝑔)

Assume𝑓 and𝑔 are functions that have all their derivatives.

Find formulas for the following derivatives:

1 (𝑓 𝑔)(𝑥)

2 (𝑓 𝑔)(𝑥)

3 (𝑓 𝑔)(𝑥)

Do these formulae seem familiar?

Make a conjecture for a formula for(𝑓 𝑔)(𝑛).

(10)

Rate of change

Let𝑓 be a continuous function with domainℝ.

True or False?

If the average rate of change of𝑓 between𝑥 = 1and 𝑥 = 2is−3,

then𝑓 must be decreasing on [1, 2].

True or False?

If, for every1 ≤ 𝑥1 < 𝑥2≤ 2,

the average rate of change of𝑓 between𝑥1 and𝑥2 is negative,

then𝑓 must be decreasing on [1, 2].

(11)

Rate of change

Let𝑓 be a continuous function with domainℝ.

True or False?

If the average rate of change of𝑓 between𝑥 = 1and 𝑥 = 2is−3,

then𝑓 must be decreasing on [1, 2].

True or False?

If, for every1 ≤ 𝑥1 < 𝑥2≤ 2,

the average rate of change of𝑓 between𝑥1 and𝑥2 is negative,

then𝑓 must be decreasing on [1, 2].

(12)

Tangent line from a graph

Below is the graph of a function𝑓.

Write the equation of the line tangent to it at the point with 𝑥–coordinate−2.

−4 −3 −2 −1 1 2 3 4

−2

−1 1 2 3

𝑂

𝑦 = 𝑓 (𝑥)

(13)

Tangent line from a graph

Below is the graph of a function𝑓.

Write the equation of the line tangent to it at the point with 𝑥–coordinate−2.

−4 −3 −2 −1 1 2 3 4

−2

−1 1 2 3

𝑂

𝑦 = 𝑓 (𝑥)

Références

Documents relatifs

Examples of such Hopf algebras are the Connes-Kreimer Hopf algebra of Feynman graphs, underlying the combinatorics of perturbative renormalization in quantum field theory [CK00].. or

The obtained GCQC3 rule only requires the evaluation of the instantaneous correlations between excitation components and the peak modal responses.. Therefore,

When the equivalence relation is the closure of a relation given by the action of a group G, smooth functions (resp. real analytic or C k -functions) on the quotient are

The general finding here is that equality (H2) holds in typically infinite dimensional spaces if we ask conditions both on the struc- ture of the space F (such as to be an Hilbert)

It provides the HTTP facade for sending association rule mining tasks in the GUHA AR PMML format, which is an extension of the PMML AssociationRules model 3 that supports both

• We provide a declarative treatment of several basic aspects of model checking by using a proof search semantics of a fragment of multiplicative additive linear logic (MALL)

To illustrate how a sequent calculus proof system can be used to describe interactive protocols, we consider in this section two different proof systems, LKneg and LKpos, for

We have illustrated this principle by showing how linear logic focusing and logical equivalences can account for object-level proof systems based on sequent calculus, natural