• Aucun résultat trouvé

A description : the function f is decreasing where its graph is falling as we go from left to right.

N/A
N/A
Protected

Academic year: 2022

Partager "A description : the function f is decreasing where its graph is falling as we go from left to right."

Copied!
2
0
0

Texte intégral

(1)

DNL 1ère Maths / English

FUNCTIONS – I

NTRODUCTIONII Worksheet #1-1-2

1. Monotonic functions

Graphs are read from left to right.

Definition : A monotonic (or monotone) function changes always in the same direction.

A description : the function f is decreasing where its graph is falling as we go from left to right.

... or a definition : A monotonic decreasing function is a function f with domain and codomain (or range) that are sets of real numbers, such that the output value decreases or stays the same as the input value increases.

Formally : Let [a , b] be a subset of the domain, part of ℝ .

If for every

x1

and

x2

such that

ax1x2b

, we have

f

x1



f

x2

 , f is said to be monotonic decreasing on [a , b].

If we have

fx1fx2

, f is said to be strictly monotonic decreasing on [a , b].

The interval [a,b] is a set of values of x for which f(x) is decreasing.

The function f is increasing where its graph is rising as we go from left to right.

... or a definition : A monotonic increasing function is

The interval [a,b] is a set of values of x for which f(x) is increasing.

examples

Vocabulary codomain – decreasing – increasing – monotone – monotonic – strictly

2014 / 15 - 1ère - Worksheet #1-1-2 FUNCTIONS – INTRODUCTIONII page 1/2

(2)

2. Local maximum and minimum

Often we are asked to find the local maximum and minimum points (of a graph), or the local maximum and minimum values (reached by a function).

Definition : The minimum (plural minima) value of a function is the least value that it attains.

A point (or a number) x is a local minimum of a function f if

fxfy

for all points (or for all numbers) y in a neighbourhood of x (or ... in an interval containing x, and numbers greater than x, and numbers less than x).

x is a strict local minimum if

f

x



f

y

 for all y in a neighbourhood.

Definition : The maximum (plural maxima) value of a function is

x is a strict local maximum if examples

3. Graphing the absolute value function

The absolute value (or modulus) of a number x, written

x

, is the positive value of x disregarding its sign.

Then

x

is the square root of ; it is equal to x if x is and to if x is . If

f

x

=

x

, its domain is , its range is and f is an function,

then its graph C is .

figure 1 – graph of

| x |

Exercise 1 – f

x

=

2

xUsing a sign-table, express f(x) without modulus within 2 intervals and draw its graph

C

in an orthonormal system of axes, taking 1 cm to 1 unit. What do you notice about

C

?

Exercise 2 – gx=4−

x

What do you notice about g and what can you deduce about its graph

C '

? Draw

C '

in the same system as

C

.

Exercise 3 – Shade the area in which a point P can lie if its

coordinates satisfy the system of simultaneous inequalities :

{

yy

42

xx

Vocabulary absolute value – greatest – least – local – maximum (maxima) – minimum (minima) – modulus – neighbourhood – strict – to attain

2014 / 15 - 1ère - Worksheet #1-1-2 FUNCTIONS – INTRODUCTIONII page 2/2

Références

Documents relatifs

For approximate solution to Minimum edge-colored Maximum Matching, since finding a regular maximum matching is easy, one could spontaneously think of using the number of colors of

By lemma 6, we constructed a polynomial reduction of 3-SAT to Less than k-edge- colored maximum matching on a tree. Since 3-SAT is NP-hard (since it is NP-C), Less than

Numerical values of ultraviolet and visible irradiation fluxes used in this work are given for aeronomic modeling purposes and a possible variability related to the 11-year

The minimum and maximum number of rational points on jacobian surfaces over finite fields..

Par contre dans la recherche des extremums relatifs, les endroits où la dérivée est nulle et les endroits où la dérivée n’existe pas.. sont des bons endroits

Reviewing the construction of polynomial ham sandwich cuts, as outlined in the proof of Theorem 2.2, we see that all that is needed is to come up with some sufficiently large finite set

Let M n be the minimal position in the n-th generation, of a real-valued branching random walk in the boundary case.. This problem is closely related to the small deviations of a