BMM 104: ENGINEERING MATHEMATICS I

Page 1 of 13

CHAPTER 1: FUNCTIONS Relations

Types of relations : One to one

one to many

many to one

Ordered Pairs f(x ) .a .b domain .c .d codomain ( a , c ) and ( b , d ) are known as ordered pairs . The set of ordered pairs is ( a , c ) , ( b , d ) ! . c and d are called the ima"e of the correspondin" first component .

BMM 104: ENGINEERING MATHEMATICS I

Page 2 of 13

#$nctions

%efinition

#$nction & relation in which e'ery element in the domain has a unique ima"e in the codomain.

(otation of f$nctions : & f$nction f from x to y : f : x y or y ) f ( x ) f(x ) .c .d codomain %omain set of inp$t 'al$es for a f$nction Ran"e the correspondin" o$tp$t 'al$es is a s$bset of codomain *lements of domain a , b ! *lements of codomain c , d !

.a .b domain

NOTE: Vertical line test can be $sed to determine whether a relation is a f$nction or not. & f$nction f ( x ) can ha'e only one 'al$e f ( x ) for each x in its domain, so no vertical line can intersect the "raph of a f$nction more than once. *xample: %etermine which of the followin" e+$ations defines a f$nction y in terms of x. ,ketch its "raph. (i) y + 2 x = 1 %omain and Ran"e The set D of all possible inp$t 'al$es is called the domain of the f$nction. The set of all 'al$es of f ( x ) as x 'aries thro$"ho$t D is called the range of the f$nction. *xample: (ii) y = 3 x 2 (iii) x 2 + y 2 = 1

BMM 104: ENGINEERING MATHEMATICS I

Page 3 of 13

-ombinin" #$nctions ,$m, %ifferences, Prod$cts, and .$otients

*xample: &ttend lect$re. -omposite #$nctions /f f and g are f$nctions, the composite f$nction f g (0f composed with g1) is defined by
( f g )( x ) = f ( g ( x )).

The domain of f g consists of the n$mbers x in the domain of g for which g(x) lies in the domain of f.

*xample: &ttend lect$re.

BMM 104: ENGINEERING MATHEMATICS I

Page 4 of 13

/n'erse #$nctions One2to2One #$nctions & f$nction f(x) is one-to-one if e'ery two distinct 'al$es for x in the domain, x1 x 2 , correspond to two distinct 'al$es of the f$nction, f ( x1 ) f ( x 2 ) . Properties of a one-to-one f$nction

(f

f )( x ) = x

and

( f f )( y ) = y
1

NOTE: & f$nction y = f ( x ) is one2to2one if and only if its "raph intersects each horizontal line at most once. /n'erse #$nctions #indin" the /n'erse of a #$nction Step 1: 3erify that f(x) is a one2to2one f$nction. Step 2: 4et y = f(x). Step 3: /nterchan"e x and y. Step 4: ,ol'e for y. Step : 4et y = f 1 ( x ) . Step !: (ote any domain restrictions on f 1 ( x ) . NOTE: *xample: 5. 6. 7. 8. #ind the in'erse of the f$nction f ( x ) = 2 x 3 . #ind the in'erse of the f$nction f ( x ) = x 3 + 2 . #ind the in'erse of the f$nction f ( x ) = x + 2 . #ind the in'erse of the f$nction f ( x ) =
2 , x 3 . x +3

%omain of f ) Ran"e of f Ran"e of f ) %omain of f

1 1

*'en #$nction, Odd #$nction

BMM 104: ENGINEERING MATHEMATICS I

Page 5 of 13

& f$nction y = f ( x ) is an e"en #unction o# x if f ( x ) = f ( x ) , odd #unction o# x if f ( x ) = f ( x ) , for e'ery x in the f$nction9s domain.

E"en $unction (,ymmetric abo$t the y2axis)

Odd $unction (,ymmetric abo$t the ori"in)

*xample: &ttend lect$re.

*xponential f$nctions

BMM 104: ENGINEERING MATHEMATICS I

Page 6 of 13

#$nction of the form

f ( x) = a x , a 1

where a is positi'e constant is the general e%ponential #unction &ith 'ase a and x as e%ponent( The most commonly $sed exponential f$nction, commonly called natural e%ponential #unction is
y =ex

or

y = exp( x )

where the base e is the exponential constant whose 'al$e is e 2.718281828... R$les for exponential f$nctions i. ii. iii. i'. '.
e x .e y = e x + y

: Prod$ct R$le : .$otient R$le

ex = e xy y e

(e )

x y

= e xy = e y

( )

: Power R$le : Reciprocal R$le

1 = e x or x e
e0 = 1

1 = ex x e

*xample: ,ol'e the followin" exponent e+$ations. (a)

2x
2

+3

=1

(b)

2 x 3 x +1 = 108

(c)

( 2)

x2

8x !

4o"arithmic #$nctions

BMM 104: ENGINEERING MATHEMATICS I

Page

of 13

The logarithm #unction &ith 'ase a, y = log a x , is the in'erse of the base a exponential f$nction y = a x ( a > 0 , a 1) . The f$nction y = ln x is called the natural logarithm #unction, and y = log x is often called the common logarithm #unction. #or nat$ral lo"arithm,
y = ln x

ey = x

&l"ebraic properties of the nat$ral lo"arithm #or any n$mbers " > 0 and x > 0 , the nat$ral lo"arithm satisfies the followin" r$les: 5. 6. 7. 8. Prod$ct R$le: .$otient R$le: Power R$le: Reciprocal R$le:
ln "x = ln " + ln x " ln = ln " ln x x ln x r = r ln x 1 ln = ln x x

/n'erse Properties for a x and log a x 5. 6. ;ase a: a log a x = x , ;ase e: e ln x = x ,

log a a x = x ,
a > 0 , a 1, x > 0

ln e = x ,
x

x >0

-han"e ;ase #orm$la *'ery lo"arithmic f$nction is a constant m$ltiple of the nat$ral lo"arithm.
log a x = ln x ln a

( a > 0 , a 1)

NOTE:

log a 1 = 0 (

*xample 5: Rewrite the followin" expression in terms of lo"arithm. i. iii.

32 = 2 # 0.001 = 10 3

ii. i'.

1000 = 10 3
1

3 = $2

*xample 6: i. *'al$ate log 2 3 .

BMM 104: ENGINEERING MATHEMATICS I

Page ! of 13

ii. iii. i'.

1 2 log 2 8 log 2 . 3 7 1 ,implify log 2 + log 2 128 8

,implify

10 x *xpand ln y2

*xample 7: ,ol'e the followin" e+$ations: 5. 7. <. =.

3$ = e x ln 2 x = 1.3

6. 8.

10 x = 0.32
log ( 3 x

) = 0.7

log 3 ( 2 x + 1) 2 log 3 ( x 3 ) = 2
3 x +2

= 200

Tri"onometric #$nctions *xample: &ttend lect$re. >yperbolic #$nctions >yperbolic f$nctions are formed by takin" combinations of the two exponential f$nctions e x and e x . The six basic hyperbolic f$nctions 5. >yperbolic sine of x: 6. >yperbolic cosine of x: 7. >yperbolic tan"ent of x:
e x e x 2 e x + e x cos% x = 2 sin% x =

e x + e x + e x e x 2 sec %x = x <. >yperbolic secant of x: e + e x 2 =. >yperbolic cosecant of x: cos ec%x = x e e x ex ex ex 8. >yperbolic cotan"ent of x: cot% x = x e tan% x =

,hiftin" a ?raph of a #$nction

BMM 104: ENGINEERING MATHEMATICS I

Page " of 13

BMM 104: ENGINEERING MATHEMATICS I

Page 10 of 13

BMM 104: ENGINEERING MATHEMATICS I

Page 11 of 13

*xample: &ttend lect$re. PROB#ET SET: CHAPTER 1 5. 4et f ( x ) = x 2 3 x and find each of the followin": (a) f ( 3 ) (f) f ( a ) (k) f 4et g ( x ) =
1 x

(b) f ( # ) (") f ( 2 x ) (l)

1 f(x)

(c) f ( 0 ) (h) 2 f ( x )

(d) f (i) f ( x + 3)

1 2

(e) f (@) f ( x ) & f ( 3 )

1 2

6.

1 . *'al$ate and simplify the difference +$otient: x g( ! + % ) g( ! ) ,% 0 %

7.

#ind the domain and ran"e of the f$nction defined by each e+$ation. 3 y = #x 2 y = ( x 1) + 2 (a) (e) (b) (c) (d)
y = 7 x

(f) (") (h)

y = x 2 + ! x 1
y = 3x + #

3 x +1 x y= x +3 x 2 y= x +3 y=

8.

#ind f g and g f . (a) (b) (c) (d)

f ( x ) = x 2 ' g( x ) = x 1
f ( x ) = x 3 ' g ( x ) = 2 x +3

(e) f ( x ) = x + 1 ' g( x ) = x ! 1 (f) f ( x ) = 2 x 3 1' g ( x ) = 3 (")

f(x)= x ' g( x ) = !

x +1 2

f(x)=

x x +3 ' g( x ) = x 2 x

f ( x ) = x 3 ' g( x ) =

1 x +1
3

(h) f ( x ) = 3 1 x ' g ( x ) = 1 x 3

BMM 104: ENGINEERING MATHEMATICS I

Page 12 of 13

<.

#ind the in'erse g of the "i'en f$nction f, and state the domain and ran"e of g. (a). (b). (c). (d).
y = ( x + 1) ' x 1 y = x 2 ! x + !' x 2 1 y= x
2

(e). (f). (i). (@).

y = x 2 !' x 0 y = ! x 2 '0 x 2

y = x 2 ! x' x 2
y = !x x2 ' x 2

y = x

=.

%etermine whether the followin" f$nctions are odd, e'en or neither e'en nor odd. (a). (b). (c). (d). (e).
f ( x) =
f ( x) =
f ( x) =

7 6x x6

(f). ("). (h). (i).

6
7

f ( x ) =Bt + At

(5 x ) 7
7

x
6

f ( x) = 7 x 7 7 x

cos x x 7x

f ( x) =

sin x ( cos x ) cot x sec x

f ( x ) = 7 x 8 sin x
f ( x ) =x
5 7 6 5 x 7

f ( x) = cos x +
f ( x) = tan x +

x6 +< 5 x8
x + x6 sin x

(@).

ANS$ERS FOR PROB#EM SET: CHAPTER 1

# ! (@) x 2 3 x 7 !

5.

(a) 18 (f) a 2 3a 1 3 (k) 2 x x

(b) 10

(c) 0

(d)

(e)

6. 7.

1 !( ! + % )

(") ! x 2 x (h) 2 x 2 x (i) x 2 + 3 x 1 (l) 2 x 3x

' ( = [0 , ) D = ' ( = (e) D = ) D = ( ,7 ]' ( = [0 , (f) D = ( ,1) ( 1, ) ' ( = ( ,0 ) ( 0 , ) D = ' ( = ( ,3] (c) (") D = ( ,3 ) ( 3 , ) ' ( = ( ,1) ( 1, ) (d) D = ' ( = D = ( ,3 ) ( 3 , ) ' ( = ( ,1) ( 1, )

(a) (b)

(h)

8.

(a) (b)

f g = ( x 1) ' g f = x 2 1
2

f g = 2 x ' g f = 2 x 3 +3

BMM 104: ENGINEERING MATHEMATICS I

Page 13 of 13

(c) (d) (e) (f) (") (h) <. (a). (b). (c). (d). (e). (f). =. (a). (b) (c) (d) (e)

x +3 'g f = ! 3x x 1 1 f g = 1' g f = 3 3 3 3 x +1 x 1 +1 f g =

f f f f

g = x ' g f = x + 2x g = x' g f = x g = 2' g f = ! g = x' g f = x

2 2

g( x ) =
g( x ) =

x 1

D ) x 0 ' ( = y 1

x + 2 D ) x 0' ( = y 2

g( x ) =
g( x ) =

1 x2

D ) x > 0' ( = y > 0 D ) x 0' ( = y 0

g( x ) = x 2

x + ! D ) x ! ' ( = y 0 D ) 0 x !' ( = 0 y 2 g( x ) = ! x

(either e'en nor odd (either e'en nor odd (either e'en nor odd Odd Odd

(f) (") (h) (i) (@)

*'en Odd (either e'en nor odd *'en Odd