REVIEW QUESTIONS FOR FINALS

I. MODULE 5

A. Determine whether the given ordered pair is a solution of the given

inequality.

1. 3x + 5y > 4; (0, 0) NOT A SOLUTION

5y > 3x + 4
3 4
y> 5
𝑥+ 5
3 4
(0) > 5
(0) + 5
4
0> 5
2. 3x – 2y ≥ 0; (-1, 5) NOT A SOLUTION
-2y ≥ 3x
3
y≥− 2
𝑥
3
5≥− 2
(− 1)
3
5≥ 2
3. 2x + 7y ≤ 0; (-4, -1) SOLUTION
7y ≤ 2x
2
y≤ 7
𝑥
2
-1 ≤ 7 (− 4)
8
-1 ≤-7
4. -4x + 3y ≥ 6; (3, 3) NOT A SOLUTION
3y ≥ -4x + 6
4
y≥− 3
𝑥+ 2
4
3≥− 3
(3) + 2
3 ≥ -2
5. -6x – 9y > 4; (-1, -4) SOLUTION
-6(-1) - 9(-4) > 4
 42 > 4
-9y > -6x + 4
6
y>− 9
𝑥+ 4
-4 > 4.67
6. 8x – 4y ≤ 9; (-3, 3) SOLUTION
- 4y ≤ 8x + 9
9
y ≤ -2x + − 4

9
(3) ≤ -2(-3) + − 4

3 ≤ 3.75
B. Determine which of the given points is a solution to the given system
of inequalities.

1. {𝑥 < 5 𝑦 < 2 ; (3, 10), (4, 1), (8, -3)

3 < 5 | 10 < 2 (no)
4 < 5 | 1 < 2 (yes)
8 < 5 | -3 < 2 (no)
2. {𝑥 − 𝑦 < 5 2𝑥 + 𝑦 > 3 ; (-3, 0), (4, 3), (8, 2)
(-3) - (0) < 5 | 2(-3) + (0) > 3
-3 < 5 | -6 > 3 (no)
(4) - (3) < 5 | 2(4) + (3) > 3
1 < 5 | 11 > 3 (yes)
(8) - (2) < 5 | 2(8) + (2) > 3
6 < 5 | 18 > 3 (yes)
3. {𝑥 + 𝑦≥4 3𝑥 − 𝑦 > 5 ; (2, 5), (3, 1), (4, 2)
(2) + (5) ≥ 4 | 3(2) - (5) > 5
10 ≥ 4 | 1 > 5 (yes)
(3) + (1) ≥ 4 | 3(3) - (1) > 5
4 ≥ 4 | 5 > 5 (no)
(4) + (2) ≥ 4 | 3(4) - (2) > 5
6 ≥ 4 | 10 > 5 (yes)
 4. {2𝑥 − 𝑦 < 3, 3𝑥 + 2𝑦≤7 ; (-2, 2), (2, -2), (2, 2)
2(-2) - (2) < 3 | 3(-2) + 2(2) ≤ 7
-6 < 3 | -2 ≤ 7 (yes)
2(2) - (-2) < 3 | 3(2) + 2(-2) ≤ 7
6 < 3 | 2 ≤ 7 (no)
2(2) - (2) < 3 | 3(2) + 2(2) ≤ 7
2 < 3 | 10 ≤ 7 (no)
1
5. {3𝑥 + 𝑦 <− 3, 3𝑥 + 𝑦 < 2
; (-3, 3), (1, -3), (6, 4)
1
3(-3) + 3 < -3 | 3(-3) + 3 < 2
1
-6 < -3 | -6 < 2
(yes)
1
3(1) + (-3) < -3 | 3(1) + (-3)< 2
1
0 < -3 | 0 < 2
(no)
1
3(6) + 4 < -3 | 3(6) + 4 < 2
1
22 < -3 | 22 < 2
(no)

C. Find the minimum and maximum values given the objective

function subject to the given constraints.

1. 𝑓(𝑥, 𝑦) = 3𝑥 + 5𝑦 + 2
{𝑦 ≥ 𝑥, 𝑥 ≥0, 𝑦 ≤2

3(2) + 5(2) + 2 = 18 (Maximum) (2, 2)

3(0) + 5(0) + 2 = 2 (Minimum) (0,0)
3(0)+ 5(2) + 2 = 12 (0,2)

2. 𝑓(𝑥, 𝑦) = 3𝑥 + 2𝑦
{𝑥 + 𝑦 ≤8, 𝑥 ≥0, 𝑦 ≥3

(0,3) 3(0)+ 2(3) = 6

(5,3) 3(5) + 2(3) = 21 (Maximum)
(0,8) 3(0) + 2(8) = 16 (Minimum)
 3. 𝑓(𝑥, 𝑦) = 4𝑥 + 𝑦
2𝑥 + 𝑦 ≤10, 𝑥 + 𝑦≤6, 𝑦 ≥0, 𝑥≤0

(0,6) 4(0) + (6) = 6

(4,2) 4(4) + (2) = 18
(6,0) 4(6) + (0) = 24 (Maximum)
(5,0) 4(5) + (0) = 20
(0,0) 4(0) + (0) = 0 (Minimum)
(2, 6) 4(2) + (6) = 14

4. 𝑓(𝑥, 𝑦) = 3𝑥 + 𝑦

𝑥 + 2𝑦 ≤8, 𝑥 + 𝑦 ≤7, 𝑦 ≥0, 𝑥≥0

(7,0) 3(7) + (0) = 21 (Maximum)

(6,1) 3(6) + (1) = 19
(0,7) 3(0) + (7) = 7
(0,4) 3(0) + (4) = 4
(0,0) 3(0) + (0) = 0 (Minimum)

5. 𝑓(𝑥, 𝑦) = 140 − 𝑥 + 3𝑦
2𝑥 + 4𝑦 ≤ 28, 2𝑥 + 𝑦 ≤10, 𝑥 ≥0, 𝑦≤0

(0,7) 140 - (0) + 3(7) = 161 (0,0) 140 - (0) + 3(0) = 140

(2,6) 140 - (2) + 3(6) = 104 (0,10) 140 - (0) + 3(10) = 170
(Minimum) (Maximum)

(5,0) 140 - (5) + 3 (0) = 135

D. For each of the problem, do the following:

(a) Give the appropriate objective function
 (b) Give the appropriate constraints.

1. A steel producer makes two types of steel: regular and special. A ton
of regular steel requires 2 hours in the open-hearth furnace and 5
hours in the soaking pit; a ton of special steel requires 2 hours in the
open-hearth furnace and 3 hours in the soaking pit. The open-hearth
furnace is available 8 hours per day and the soaking pit is available
15 hours per day. The profit on a ton of regular steel is PhP120 and it
is PhP100 on a ton of special steel. Determine how many tons of
each type of steel should be made to maximize the profit?
Types of Steel Furnace Hours Soaking Pit Profit
Regular (x) 2 hours 5 hours PHP 120
Special (y) 2 hours 3 hours PHP 100
2x+2y≤8 5x+3y≤15 z = 120x + 100y

Constraints:
2x+2y≤8
5x+3y≤15
x ≥0
y ≥0

(0,5) 120(0) + 100(5) = 500 (Maximum)

(0,4) 120(0) + 100(4) = 400
(0,0) 120(0) + 100(0) = 0
(3,0) 120(3) + 100(0) = 360
(1.5, 2.5) 120(1.5) + 100(2.5) = 430

2. A television producer designs a program based on a comedian and

time for commercials. The advertiser insists on at least 2 minutes of
advertising time, the station insists on no more than 4 minutes of
advertising time, and the comedian insists on at least 24 minutes of
the comedy program. Also, the total time allotted for the advertising
and comedy portions of the program cannot exceed 30 minutes. If it
 has been determined that each minute of advertising (very creative)
attracts 40000 viewers and each minute of the comedy program
attracts 45000 viewers, how should the time be divided between
advertising and programming to maximize the number of
viewer-minutes?
Programs Time in Mins. Profit
Comedy P.(x) 𝑥 ≥ 24 40000
Commercials (y) 2 ≤ 𝑦 ≤ 4 45000
x + y≤ 30 z = 40000x + 45000y
Constraints:
x + y≤30
x≥0
y ≥0

(24,4) 40000(24) + 45000(4) = 1,140,000

(26,4) 40000(26) + 45000(4) = 1,220,000 (Maximum)
(24,2) 40000(24) + 45000(2) = 1,050,000
(28,2) 40000(28) + 45000(2) = 1,210,000
26 minutes for Comedy and 4 minutes for Advertisement

3. The Protein Diet Club serves a luncheon consisting of two dishes, A

and B. Suppose that each unit of A has 1 gram of fat, 1 gram of
carbohydrate, and 4 grams of protein, whereas each unit of B has 2
grams of fat, 1 gram of carbohydrate, and 6 grams of protein. If the
dietician planning the luncheon wants to provide no more than 10
grams of fat or more than 7 grams of carbohydrate, how many units
of A and how many units of B should he serve to maximize the
amount of protein consumed?
Dishes Fat Carbs Protein
Dish A (x) 1 gram 1 gram 4 grams
 Dish B (y) 2 grams 1 gram 6 grams
x+2y≤10 x+y > 7 z = 4x + 6y
Constraints:

x+2y≤10 (4,3) 4(4) + 6(3) = 32

x+y > 7 (7,0) 4(7) + 6(0) = 28
x≥0 (10,0) 4(10) + 6(0) = 40 (Maximum)
y ≥0
10 grams of Dish A, and 0 grams of Dish B
4. An animal feed producer mixes two types of grain: A and B. Each unit
of grain A contains 2 grams of fat, 1 gram of protein, and 80 calories.
Each unit of grain B contains 3 grams of fat, 3 grams of protein, and
60 calories. Suppose that the producer wants each unit of the final
product to yield at least 18 grams of fat, at least 12 grams of protein,
and at least 480 calories. If each unit of A costs PhP10 and each unit
of B costs PhP12, how many units of each type of grain should the
producer use to minimize the cost?
Grains Fat Protein Calories Cost
Grain A (x) 2 grams 1 gram 80 PHP 10
Grain B (y) 3 grams 3 grams 60 PHP 12
2x+3y≥18 x+3y ≥ 12 80x + 60y ≥ z = 10x + 12y
480
Constraints:
2x+3y≥18 (0,8) 10 (0) + 12 (8) = 96
x+3y ≥ 12 (3,4) 10 (3) + 12 (4) = 78 (Minimum)
80x + 60y ≥480 (6,2) 10 (6) + 12 (2) = 84
x≥0
(12,0) 10 (12) + 12 (0) = 120
y ≥0
3 units of Grain A, 4 units of Grain B
E. Study the concepts of LP: decision variables, objective function,
constraints, corner-point principle, optimization, feasible region,
corner points, bounded

F. Graph of linear inequalities. DO NOT USE DESMOS GRAPHING.

1. What is the graph of the inequality 4x + 6y ≥ 10?

ANSWER: D.

2. What is the graph of the solution of the system {𝑥 > 2 𝑦 > 8 ?

ANSWER: C.
3. What is the graph of the solution of the system
{𝑦≤ − 𝑥 + 4 𝑦 >− 2𝑥 − 4 ?
ANSWER: C.
II. MODULE 6

A. Evaluate the following:

1. 83 ≡ 1 (mod 2) 6. 81 mod 9 = 0
2. 78 ≡ 1 (mod 7) 7. 26 mod 12 = 2
3. 15 ≡ 3 (mod 6) 8. 16 mod 3 = 1
3
4. 2 ≡ 3 (mod 5) 9. 30 mod 8 = 6
5. 95 ≡ 7 (mod 11) 10. 21 mod 5 = 1
B. Answer each of the following:
1. What month will the calendar show 821 months after December?
ANSWER: MAY
2. If today is Wednesday, what day was it 821 days ago?
ANSWER: FRIDAY
3. What time will the clock show read 705 hours after 3:00?
ANSWER: 12 O’Clock
4. What time will the clock show read 705 hours before 3:00 AM?
ANSWER: 6:00 AM

C. Which of the following is a valid UPC?

1. 0-71734-00021-8

0 7 1 7 3 4 0 0 0 2 1 8

3 1 3 1 3 1 3 1 3 1 3 1

0 7 3 7 9 4 0 0 0 2 3 8

43 mod 10 = 4 remainder 3 INVALID!

2. 0-70734-00021-8

0 7 0 7 3 4 0 0 0 2 1 8

3 1 3 1 3 1 3 1 3 1 3 1

0 7 0 7 9 4 0 0 0 2 3 8

40 mod 10 = 4 VALID!

3. 0-70743-00021-8

0 7 0 7 4 3 0 0 0 2 1 8

3 1 3 1 3 1 3 1 3 1 3 1
 0 7 0 7 12 3 0 0 0 2 3 8

42 mod 10 = 2 INVALID!

D. ISBN

1. Suppose you know that the number 0-6690-3925-4 is the result of

the transposition of two adjacent digits in an ISBN. Suppose also
that the switch does not involve the first or last digits. Determine
the correct ISBN.
0 6 6 9 0 3 9 2 5 4
10 9 8 7 6 5 4 3 2 1
0 54 48 63 0 15 36 6 10 4
236 mod 11 = 5 INVALID
0 6 6 9 0 9 3 2 5 4
10 9 8 7 6 5 4 3 2 1
0 54 48 63 0 45 12 6 10 4
242 mod 11 = 0 VALID!
0 6 6 9 0 9 3 2 5 4
1 2 3 4 5 6 7 8 9 10
0 12 18 36 0 54 21 16 45 40
EITHER OF THESE ARE VALID.
2. Determine which of the following is a valid ISBN and which is
invalid.
(i) 0-387-94461-3

0 3 8 7 9 4 4 6 1 3

1 2 3 4 5 6 7 8 9 10

0 6 24 28 45 24 28 48 9 30

242 mod 11 = remainder 0 VALID!

 (ii) 978-0-1234-5678-4

9 7 8 0 1 2 3 4 5 6 7 8 4

1 3 1 3 1 3 1 3 1 3 1 3 1

9 21 8 0 1 6 3 12 5 18 7 24 4

118 mod 10 = remainder 8 INVALID!

E. EAN
1. Give the country of the following barcodes:
(i) 480-0011-11396-8 PHILIPPINES
(ii) 890-1234-56789-8 INDIA
(iii) 880-1045-52011-7 SOUTH KOREA
(iv) 690-8000-00815-0 CHINA
(v) 885-9999-05741-1 THAILAND

2. Which of the following has a check digit of 0?

(i) 480-0016-66625-C

4 8 0 0 0 1 6 6 6 6 2 5 C

1 3 1 3 1 3 1 3 1 3 1 3 1

4 24 0 0 0 3 6 18 6 18 2 15 C

96 + C = mod 10
C=4

(ii) 480-0016-10574-C

4 8 0 0 0 1 6 1 0 5 7 4 C

1 3 1 3 1 3 1 3 1 3 1 3 1
 4 24 0 0 0 3 6 3 0 15 7 12 C

74 + C
C=6

(iii) 480-0024-58316-C

4 8 0 0 0 2 4 5 8 3 1 6 C

1 3 1 3 1 3 1 3 1 3 1 3 1

4 24 0 0 0 6 4 15 8 9 1 18 C

89 + C
C=1

(iv) 480-0054-11128-C

4 8 0 0 0 5 4 1 1 1 2 8 C

1 3 1 3 1 3 1 3 1 3 1 3 1

4 24 0 0 0 15 4 3 1 3 2 24 C

80 mod 10 = 0

F. Credit card

1. Find the check digit of the following card number:

5412-7567-8901-234C.

5 4 1 2 7 5 6 7 8 9 0 1 2 3 4 C

2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1

10 4 2 2 14 5 12 7 16 9 0 1 4 3 8 C

97 + C = mod 10
 C=3

2. Find the check digit of the following card number:

5228-7910-9900-001C.

5 2 2 8 7 9 1 0 9 9 0 0 0 0 1 C

2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1

10 2 4 8 14 9 2 0 18 9 0 0 0 0 2 C

78 + C = mod 10
C=2