Problem 1

and B , and it requires three different machines to

M1
requires 10 hr of time on machine
, 6 hr of time on

A company manufactures two products,

process each product. Product
machine
M1

M2

, and 12 hr of time on machine

, 12 hr on

M2

, and 4

hr on

M3

M3

. Product B

requires 10 hr of time on

. If the profit of each unit of product

is $ 400

and the profit of each unit of product B

is $ 720 , how many units of each product should be

produced in each two-week period if there are 240 hr of time available on each machine and the
company wishes to maximize the profit?
Solution:
It helps to tabulate all the given information as follows,
Product A

Product B

Machine 1

10 hours

10 hours

240 hours

Machine

6 hours

12 hours

240 hours

Machine

12 hours

4 hours

240 hours

1 unit

1 unit

$ 400

$ 720

Minimum Production
Profit

Let
B

x be the number of units of product

produced, and

produced,

Total Number of Hours

be the number of units of product

z be the profit. Based from the tabulated data above, we have the system of

inequalities,

10 x +10 y 240
6 x +12 y 240
12 x+ 4 y 240
x1
y 1

We must find the number of units of each product that maximizes the profit,

z=400 x +720 y , within

the region defined by the system of inequalities above. We sketch the region defined by the system of
inequalities above like so,
The coordinates of the vertices are obtained by solving the system of equation of two lines intersecting
at a vertex. The region has five vertices with coordinates ( 1,1 ) ,

(1, 392 )

, ( 8,16 ) , ( 18,6 ) , and

( 593 , 1)

. By Theorem 2, the values of

z=ax +by

maximize or minimize

x and

that

occurs at the vertices of

the region. With this in mind, we evaluate

z on these

vertices as follows:
at ( 1,1 ) , z=400 ( 1 ) +720 ( 1 )=1120
at

(1,

39
)
2 ,

z=400 ( 1 ) +720

( 392 )=14440

at ( 8,16 ) ,

z=400 ( 8 )+720 ( 16 )=14720

at ( 18,6 ) ,

z=400 ( 18 ) +720 ( 6 ) =11520

at

59
, 1)
,
3

z=400

8586.67
( 593 )+720 (1) = 25760
3

Therefore, the maximum profit is achieved by producing

8 units of product A and 16 units of product B.
Problem 2
A distributor of video recorders has two warehouses that supply three different retailers. To deliver a
R1
W1
W2
recorder to retailer
costs $ 27 from warehouse
and $ 36 from warehouse
. It
W1
costs $ 9 to deliver a recorder from
to retailer
R2

. For retailer

W2

. Suppose that

ordered from

R3

R3

R2

W2
and $ 6 to deliver one from
to

W1
, it costs $ 15 if the recorder comes from
and $ 30 if it comes from

R1

orders three recorders,

R2

orders four recorders, and two recorders are

. If the distributor has five recorders in stock in

W1

and four in

W2

, how many

recorders should be shipped from each warehouse to each retailer in order for the distributor to minimize
the delivery costs?
Solution:
It helps to tabulate all the given information as follows,

Problem 3

A class consists of 12 boys and 9 girls. In how many ways could they choose a president,

a secretary and a treasurer if the secretary is a boy and the treasurer is a girl? Provide possible
approaches, determine if the approaches have different answers and justify the result.
1. The first approach is to choose the secretary or the treasurer first before the president. It is done
this way because the position for secretary is exclusive for a boy and for treasurer is exclusive
for a girl. For example, since we have 12 boys, we have twelve possible ways of which one
of them will be placed for the position of secretary. Similarly, we have 9 girls so we have
nine possible ways of which one of them will be placed for the position of treasurer. Notice that
if I have chosen a boy for the position of secretary, there are still nine choices from which of the
nine girls will be placed for the position of treasurer because the respective positions are gender
specific. The position for the president is not gender specific; it does not matter whether I placed
a boy or a girl. Since I have chosen two people in place of the secretary and treasurer position
and in total there were 12+9=21 people, I only have 212=19 people to choose for the
position of president. By the Fundamental Principle of Counting, the number of ways I could
place people in their respective positions from the class is given by,

12 919=2052 ways.
2. We could have placed a people for the position of president first before that of secretary and
treasurer. We must take note what the gender of the chosen president is because it matters for the
next positions due to their gender exclusivity. It is not possible to tell the gender of the chosen
president and it may result to difficulty of determining how many people are left to choose from
for the next positions, so we take cases separately; if the president is a boy or a girl.
If we are to choose a president that is a boy, there are 12 possible choices. Upon choosing, it
follows that there are only 121=11 boys to choose from for the position of secretary. Still,
there are 9 girls to choose from for the position of treasurer. Applying the Fundamental
Counting Principle, we have,
1211 9=1188 ways.
If we are to choose a president that is a girl, there are 9 possible choices. Upon choosing, it
follows that there are only 91=8 girls to choose from for the position of secretary. Still,
there are 12 boys to choose from for the position of secretary. Applying the Fundamental
Principle of Counting, we have,
9 8 12=864

ways.

By the rule of sum, the total number of ways we could place people on these positions taking the
constraints into consideration is given by 1188+864=2052 ways. Since we obtained the
same result, this tells us that the second approach ought to be the same with the first one.
Exam 1
1. Solve the following inequalities:
2
(a) 6 x + x >12
(b)

|32 x|5

(c)

x 2 ( x +3 )
0
( 4 x3 ) ( x2 )

(d)

x +1
|2x3
| 4

Solution:
(a) First, we need to make sure that at least one side if the inequality is 0 . Doing so gives us,
2

6 x + x12> 0
Next, we shall look into the corresponding equation,
2
6 x + x12=0
and factor it out to find its zeroes as follows,
( 3 x4 )( 2 x +3 )=0
3 x4=0
x=

4
3

or
or

2 x +3=0
x=

3
2

Now, these values divide the real number line into three intervals. We shall plug in test values
within these intervals to see what interval satisfies the inequality. We shall construct the sign
chart as follows,
3 4
2 0 2
2 3
3 x4

2 x +3

( 3 x4 )( 2 x +3 )

Looking at the signs, clearly we see that the product is positive for the intervals

and

( 43 , )

. Referring to the inequality, the solution is given by,

( , 32 ) ( 43 , )

( , 32 )

(b) In this problem, we shall use the properties of absolute value inequalities, specifically:
If |x|c , c 0 , then c x c .
Applying this property and isolating for

x , we have as follows,
5 32 x 5
82 x 2
4 x 1

Therefore, the solution in interval notation is given by,

[ 1,4 ]

(c) Since the expression is already factored, we can immediately solve for the critical values and
construct a sign chart as follows,

431 0

13
12 3
24

x+ 3

4 x 3

x2

x 2 ( x +3 )
( 4 x3 ) ( x2 )

By looking at the signs, clearly we see that the product is negative for the intervals ( ,3 ]
and

( 34 , 2)

. Referring to the inequality, the solution is given by,

( ,3 ]

( 34 ,2)

(d) In this problem, we shall use the properties of absolute value inequalities, specifically:
If |x|c , c >0 , then

x<c or

x> c .

Applying this property, we get further two inequalities as follows,

2 x +1
4
x3
2 x +1
+4 0
x3
6 x11
0
x3

2 x +1
4
x3

or

or

2 x +1
4 0
x3

or

2 x+13
0
x3

or

2 x+13
=0
x3

Looking at their corresponding equations,

6 x11
=0
x3

and noting that they are already factored, we construct the sign chart for each as follows,
0

11
234
6

034

13
7
2

6 x11

2 x +13

x3

x3

6 x11
x3

2 x+13
x3

Based from the sign chart, the first inequality is satisfied on the interval

second one is satisfied on the interval

( ]
3,

13
2

[ )
11
,3
6

, while the

. Therefore, by combining these results, we get,

[ )( ]
11
13
,3 3,
6
2

2. Sketch the region given by the system:

+3 y <0
{5 xy<2

Solution:
We rewrite the first inequality in slope-intercept form and apply Theorem 1.
y<

5
x
3

Thus, the region defined by the first inequality is the open half-plane below the line

y=

5
x
.
3

Similarly, the region defined by the second inequality is the open half-plane below the line
Using the information above, we graph the region defined by the system of inequalities.
Graph:

Fig. 1. The region defined by the inequality is the region with darkest shading.

3. (a) Sketch the region given by the system:

(b) Find the minimum value of

Solution:

z=4 x+7 y

3 x y +3 0
4 x +5 y34 0
x0
y2

in the region described in (a).

y=2 .

(a) We rewrite the first two inequalities in slope-intercept form and use Theorem 1 to determine the
region they define.
4
34
y 3 x+ 3 and y x+
5
5
Thus, the region defined by the first inequality is the half-plane below the line
the region defined by the second inequality is the half-plane below the line

y=

y=3 x +3 and

4
34
x+
5
5 .

Similarly, the region defined by the third inequality is the half-plane on the right of the line
x=0 and the region defined by the fourth inequality is the half-plane above the line y=2 .
Using the information above, we graph the region defined by the system of inequalities.
Graph:

Fig. 2. The region defined by the inequality is the region with darkest shading.

(b) We use Theorem 2 to reduce the number of possible points that minimizes

z=4 x+7 y

by

looking at the vertices of the region. We shall test for the minimum among the four vertices,
namely, ( 1,6 ) , ( 6,2 ) , ( 0,2 ) and ( 0, 3 ) as follows,

for ( 1,6 ) ,

z=4 ( 1 )+7 (6 )=46 ,

for ( 6,2 ) ,

z=4 ( 6 ) +7 ( 2 )=38 ,

for ( 0,2 ) ,

z=4 ( 0 ) +7 ( 2 )=14 , and

for ( 0,3 ) ,

z=4 ( 0 ) +7 ( 3 )=21 .

Therefore the minimum value is at the point ( 0,2 ) with the minimum value,
z=14

4. Use matrix inversion to solve the system:

y=3
{45 x2
x+ y=2

Solution:
From the given problem above, we set up the coefficient matrix
x

A , the column vector of variables

and the column vector of constants b .

A=

] [] [ ]

4 2
x
3
x= b=
5 1
y
2

With these, we can represent the system of linear equations as a matrix equation like so,
Ax=b

In the equation above, we are aiming to solve for the column vector of variables
equation with the inverse of matrix

A , denoted by

x . Multiplying the

A1 , we get,

x= A1 b
x , we must first find

In order to find

and multiply it with b . For a 2 by 2 matrix

A ,

[ ]

A= a b
c d

its inverse is given by,

A1=

1
d b
adbc c a

Applying the formula above for matrix

x=

][ ]

1
1 2 3
( 4 )( 1 ) (2 ) ( 5 ) 5 4 2

and multiplying it with the column vector b , we have,

[] [ ][

x = 1 1 = 1/14
y 14 23
23 /14

Therefore,
x=

1
23
, y=
14
14

5. Use elementary row operations to solve the system:

2 x3 y +5 z=0
4 x2 z=6
2 y +3 z=3

Solution:
From the given problem above, we set up the augmented matrix like so,

|]

2 3 5 0
4 0 2 6
0 2 3 3

From then, we shall perform elementary row operations (Gaussian elimination method) until the matrix
is reduced to a triangular matrix.
First, we replace row 2 with row 2 minus row 1 multiplied by 2 .

|]

2 3
5 0
R2 r 22 r 1 0 6 12 6
0 2
3 3

Next, we replace row 3 with row 2 plus row 3 multiplied by 3 .

|]

2 3
5 0
R3 r 2 +3 r 3 0 6 12 6
0 0
3 3

Notice that the coefficient matrix is now a triangular matrix. We revert back to equations based from the
reduced augmented matrix above. Then we solve the variables algebraically as follows,

Equation (3) gives

2 x 3 y+5 z=0

(1)

6 y12 z=6

(2)

3 z=3

(3)

z=1 . Plugging this value into equation (2), we get,

6 y12 ( 1 )=6 6 y =18

which gives

y=3 . Finally, plugging in the values found for

and

Dy

, and

into equation (1), we

have,
2 x 3 (3 )+ 5 ( 1 ) =0 2 x =4
which gives

x=2 . Therefore,
x=2, y=3, z=1

6. Use Cramers Rule to solve the system:

2 x +3 y3 z=1
x +2 y5 z=2
4 x +5 y2 z=4

Solution:
From the given problem, we set up the determinants

| |

| |

D ,

| |

Dx

2 3 3
1 3 3
2 1 3
2 3 1
D= 1 2 5 D x = 2 2 5 D y = 1 2 5 D z= 1 2 2
4 5 2
4 5 2
4 4 2
4 5 4

Next, we compute the 3 by 3 determinants above using the Rule of Sarrus.

Dz

as follows,

D=( 2 ) ( 2 )(2 ) + ( 3 ) (5 )( 4 ) + (3 ) ( 1 )( 5 ) (3 )( 2 ) ( 4 )( 3 ) ( 1 )(2 )( 2 ) (5 )( 5 )=3

Dx = (1 )( 2 ) (2 ) + ( 3 ) (5 )( 4 ) + (3 ) (2 )( 5 ) (3 )( 2 ) ( 4 )( 3 ) (2 )(2 )( 1 ) (5 ) ( 5 )=3
D y =( 2 ) (2 )(2 )+ ( 1 )(5 ) ( 4 )+ (3 )( 1 ) ( 4 )(3 )(2 ) ( 4 )( 1 ) (1 ) (2 )( 2 ) (5 )( 4 )=6
D z =( 2 ) ( 2 )( 4 ) + ( 3 ) (2 )( 4 ) + ( 1 ) (1 )( 5 ) (1 )( 2 ) ( 4 )( 3 ) ( 1 )( 4 ) ( 2 )(2 ) (5 )=3
The values for

x ,

x=

Dx 3
= =1
D 3

y=

D y 6
= =2
D 3

z=

Dz 3
=
=1
D 3

y , and

are given as follows,

To summarize,
x=1, y =2, z=1

Exam 2
1. Find all the zeroes of the following polynomials
4
3
2
(a) P ( x )=2 x +11 x 5 x 56 x +48

P ( x )=3 x 314 x2 + 47 x 26

(b)
Solution:

(a) By applying the Rational Zeroes Theorem, the possible candidate roots for

P ( x ) is reduced to

a list as follows,
p= 1, 2, 3, 4, 6, 8, 12, 16, 24, 48
q=1, 2

p
1
3
= 1, , 2, 3, , 4, 6, 8, 12, 16, 24, 48
q
2
2
By applying the Factor Theorem, we shall evaluate

P ( x )=0 . By trial and error, one will find these values,

that satisfies
P (1 ) =0 , so

x=1 is a zero,

P (4 )=0 , so
P

( 32 )=0

Since

x=4

x=

, so

P (x )

3
2

is a zero and

is also a zero.

is a polynomial of degree 4

and no more candidate roots satisfies the Factor

P (x )

could be a repeated, irrational or imaginary root.

Theorem, then the remaining zero of

P (x )

Dividing

P ( x ) with these values and look for values

by the factors we found so far using synthetic division successively,

2

11

56

48

13

48

13

48

20

48

3
2

which means that

So, the zeroes of

12

12

P ( x )= ( x + 4 ) ( 2 x3 )( x1 ) , showing that it has a repeated root.

P ( x ) are,
4,1,

3
2

(b) By applying the Rational Zeroes Theorem, the possible candidate roots for

P ( x ) is reduced to

a list as follows,
p= 1, 2, 13, 26

q=1, 3
p
1
2
13
26
= 1, , 2, , 13, , 26,
q
3
3
3
3
By applying the Factor Theorem, we shall evaluate

P ( x )=0 . By trial and error, one will find,

that satisfies
P

( 23 )=0

Since

, so

P (x )

x=

2
3

is a zero.

is a polynomial of degree 3 and no more candidate roots satisfies the Factor

Theorem, then
Dividing

P ( x ) with these values and look for values

P (x )

P (x )

with

must have at least two more repeated, irrational or imaginary roots.

( x 23 )

using synthetic division, we get,

2
3

14

47

26

26

12

39

P ( x )= (3 x2 ) ( x 24 x+ 13 ) .

which means that

2
2
By examining the quadratic factor ( x 4 x+13 ) , its discriminant, b 4 ac =36

is clearly

less than 0 , so its roots are imaginary. Applying the quadratic formula, we have,
(4 ) (4 ) 4 (1 ) ( 13 )
x=
=2 3 i
2( 1)
2

So

P ( x )= (3 x2 )( x +2+3 i ) ( x+ 23 i ) and its zeroes are,

2
, 2+ 3i , 23 i
3

2. Determine whether

x=1 is a zero of f ( x )=2 x 1433 x 84 +6 x 17+10 .

Solution:
By Factor Theorem, ( xr ) is a factor of

P ( x ) , if and only if

that r

P ( r )=0 . Evaluating f ( x ) at

is a zero of
143

P ( x ) if and only if
84

17

f (1 )=2 (1 ) 3 (1 ) + 6 (1 ) +10=1

P ( r )=0 . Equivalently, it means

x=1 ,

Since f (1 ) 0 ,

x=1 is not a zero of f ( x ) .

3. Find the first term of an arithmetic progression whose second term is 1 and whose eighth
term is 8 .
Solution:
Using the formula for the n

th

term of an arithmetic progression,

an =a1 + ( n1 ) d
and letting

a2=1

and

a8 =8

, we have a system of two equations in two unknowns like so,

a2=a 1+ d=1
a 8=a1 +7 d =8

Multiplying the first equation with 7

and adding to it the second equation, we get,

6 a1=15
Therefore, the first term is given by,
a1=

5
2

4. Insert 4

arithmetic means between 20

and 7 .

Solution:
c1

We are looking for numbers

a , c 1 , c 2 , c3 , c 4 , b
a5 =c 4
n

th

, and

through

c4

which satisfies the arithmetic progression

a =a
a =c
, , where a=20 and b=7 . By setting 1
, 2 1 , ,

a6 =b

, our goal is to find out the terms

a2

through

a5

. Using the formula for the

term of an arithmetic progression,

an =a1 + ( n1 ) d
we shall look first for the common difference, d . Substituting in the appropriate values, we have,
7=20+5 d d=

13
5

Again, using the same formula, we shall look for the terms
a2=a1 +d=20+

through

a5

like so,

13 87
=
5
5

a3 =a1 +2 d=20+2

( 135 )= 745

a 4=a 1+3 d =20+ 3

( 135 )= 615

a5 =a1 +4 d=20+4

( 135 )= 485

Now, since

a2

a2=c 1

, ,

a5 =c 4

, the four arithmetic means between 20

87 74 61 48
, , ,
5
5
5
5

and 7

are,

5. Find the second term of the geometric progression whose fifth term is

27
8

if the common ratio

3
2 .

is
Solution:

Using the formula for the n

an =a1 r

th

term of a geometric progression,

n1

the second term,

a2

is given by,
a2=a1 r

Similarly, the fifth term is given by,

a5 =a1 r 4
Solving for
a1=

a5
r

a1

and substituting it into equation (1), we have as follows,

(1)

a5

( )

a2=a1 r=

r=

a5
r

Substituting in the values, we get,

27
8
27
a2=
=
3
8
3
2

()

( )( 278 )
a2=1

6. Find the sum of the infinite geometric series whose second term is

8
15

and whose third term

16
is 75 .
Solution:
First, we need to find out the first term
Using the recursive formula for the n
an =an1 r

a1
th

and the common ratio r

of the geometric progression.

term of a geometric progression,

the third term

a3

is given by,

a3 =a2 r
Solving for r

and substituting in the appropriate values,

16
a3
75 2
r= =
=
a2
8
5
15
Again, by the recursive formula for the n

th

term of a geometric progression,

a1

is given by,

8
a 2 15 4
a1= =
=
r 2
3
5
Notice that |r|<1 , so the associated infinite geometric series converges. For a given geometric
sequence,

a n= 1r1
n=1

Substituting in the appropriate values,

4
3
a n= 2
n=1
1
5

Therefore,

a n= 20
21
n=1

7. A class consists of 12 boys and 9 girls.

(a) In how many ways could they choose a president, a secretary and a treasurer?
(b) In how many ways could they choose a president, a secretary and a treasurer if the secretary
is a boy and the treasurer is a girl?
Solution:
(a) The order at which we choose a president, a secretary and a treasurer is important. All in all,
there are 12+9=21 candidates to place for the said positions. Since, no single candidate
is allowed to take up two different positions and the order of which candidate we place on the
said positions matters, then by Fundamental Principle of Counting, the number of ways they
could choose three officers from twenty-one candidates is given by,
21 2019=7980 ways.

(b) Since the position for the secretary or the treasurer is gender specific, we should choose a
secretary or a treasurer first before a president. Again, the order at which we choose matters,
so upon filling the secretary position first, which requires a boy, allows us to choose 12
candidates. Similarly, choosing for a treasurer, which requires a girl, allows us to choose
9 candidates. Lastly, for the president, since no single candidate is allowed to take up two
different positions and we have chosen two candidates already, there are only 212=19
candidates left to choose. By the Fundamental Principle of Counting, the number of ways
they could choose three officers taking into consideration the constraints is given by,
12 919=2052 ways.
S T P
8. How many permutations of the letters of the word SEQUOIA are there?
Solution:
The word SEQUOIA has seven distinct letters. Therefore, by the Fundamental Principle of Counting the
letters of the word SEQUOIA has,
7 !=5040 permutations.

9. A shelf contains 4

different math books and 5 different english books.

(a) In how many ways could the books be arranged on the shelf if the math books are kept
together and the english books are kept together?
(b) In how many ways could the books be arranged on the shelf if the math books are kept
together?
Solution:
(a) We must keep the english and math books together, so we must take the cases separately
whenever the english or math books were placed together first. Taking the case when the
english books were placed together first, then by the Fundamental Principle of Counting, the
number of ways we could arrange the books is given by,
5 4 3 2 1
4 3 2 1=2880

ways.

On the other hand, if the math books were placed together first, then by the Fundamental
Principle of Counting, the number of ways we could arrange the books is given by,
4
3 2 1 5
4 3 2 1=2880

ways.

By the rule of sum, the total number of ways the books can be arranged taking the constraints
into consideration is given by
5 ! 4 ! +4 ! 5 !=2880+2880=5760 ways.

(b) We shall treat the math books together as a single object. The number of ways the five
english books and the math books treated as a single object can be arranged is given by,
6 5 4 3 2 1=6 !=720

ways.

(1)

For every arrangement above, the math books can be arranged in,
4 32 1=4 !=24

ways.

By the Fundamental Principle of Counting, the total number of ways the books can be
arranged considering the constraints is simply the product of (1) and (2), namely,

(2)

6 ! 4 !=6 5 4 3 21 4 3 21=17280 ways.