PAULINIAN GLEANERS’ PRAYER

God, our loving Father, through Your With TRANQUIL-DARING to proceed

Holy Spirit, enable us to participate in when we feel that the work and
Jesus’ saving mission to make You responsibilities given us are back-
known and loved throughout the world. breaking and beyond our capacity; and
May we joyfully live out our Paulinian
identity as gleaners who are: ALL TO ALL, willing to faithfully serve
everyone especially the least, the last,
PRAYERFUL, mindful of who we truly and the lost.
are and why we are here – Your children
called to follow Your Holy Will; Our Lady of Chartres, pray for us.
St. Paul the Apostle, our Patron, pray for
SELF-EFFACING, quick to transcend us.
when we are not recognized for the good Fr. Louis Chauvet and our First Sisters,
we have done or when we are taken for intercede for us.
granted; Caritas Christi urget nos,
now and for ever. Amen.
MATHEMATICS IN THE
MODERN WORLD
 MODULE 6
Mathematics as a Tool
for Decision Making
 Learn about It!

Fundamental Counting Principle

1 a mathematical way used to find the number of possible outcomes of an
experiment

Example:

If we are looking for the number of two-digit numbers using the digits
3, 4, 5, and 6 when repetition of digits is not allowed, we can multiply
the total number of digits (which is the total number of choices for the
tens digit) to the total number of digits minus 1 (which is the total
number of choices for the ones digit). Therefore, there are 𝟒 × 𝟑 = 𝟏𝟐
two-digit numbers that can be formed.
 Learn about It!

Factorial Notation
2 the notation 𝑛!, where 𝑛 > 0 and 𝑛! = 𝑛 𝑛 − 1 (𝑛 − 2) … 2(1)

Example:
Evaluate 3!.

To evaluate 3!, multiply the natural numbers in decreasing

order starting from 3.

3! = 3(2)(1) = 6
A counting problem asks
“how many ways” some
event can occur.
Ex. 1: How many three-letter codes are
there using letters A, B, C, and D if no
letter can be repeated?

• One way to solve is to list all

possibilities.
Ex. 2: An experimental psychologist uses
a sequence of two food rewards in an
experiment regarding animal behavior.
These two rewards are of three different
varieties. How many different sequences
of rewards are there if each variety can be
used only once in each sequence?

Next slide
•Another way to solve is a factor
tree where the number of end
branches is your answer.
b

a c
a
b c
a
c
b
Fundamental Counting Principle
Suppose that a certain procedure P can be
broken into n successive ordered stages, S1,
S2, . . . Sn, and suppose that
S1 can occur in r1 ways.
S2 can occur in r2 ways.
Sn can occur in rn ways.
Then the number of ways P can occur is
r1  r2    rn
Ex. 2: An experimental psychologist uses
a sequence of two food rewards in an
experiment regarding animal behavior.
These two rewards are of three different
varieties. How many different sequences
of rewards are there if each variety can
be used only once in each sequence?
Using the fundamental counting principle:
3 X 2
1st reward 2nd reward
 Try It!

Example 1: Evaluate 5! × 4!.

 Try It!

Example 1: Evaluate 5! × 4!.

Solution:

1. Evaluate 5! by multiplying the natural numbers in

decreasing order starting from 5.

5! = 5 4 3 2 1 = 120
 Try It!

2. Evaluate 4! by multiplying the natural numbers in

decreasing order starting from 4.

4! = 4 3 2 1 = 24

3. Multiply 5! and 4!.

5! × 4! = 120 24 = 2 880

Thus, 5! × 4! is equal to 𝟐 𝟖𝟖𝟎.

 Permutations
An r-permutation of a!set of nfactorial
means
elements is an ordered Ex.
selection of r
3! = 3∙2∙1
elements from the set of n elements
n!
n Pr =
(n − r )!
0! = 1
Ex. 1:How many three-letter
codes are there using letters A, B,
C, and D if no letter can be
repeated?

Note: The order does matter

4!
4 P3 = = 24
1!
 Learn about It!

Permutation
1 ordered arrangement of a set of objects

Example:

The set of 3-digit numbers that can be formed using the digits
1, 2, and 3 is a set of permutations.
 Learn about It!

Permutation of 𝒏 Objects Taken 𝒓 at a Time

2 ordered arrangement of 𝑛 objects taken 𝑟 at a time where 𝑛 ≥ 𝑟

Example:

In how many ways can you arrange 12 different books on a

shelf that can hold only 6 books?

In the given problem, 𝑛 = 12 is the number of objects while

𝑟 = 6 is the number of objects taken at a time.
Learn about It!

Solving the Number of Permutations of 𝒏 Objects

3
Taken 𝒓 at a Time
The number of permutations of 𝑛 objects taken 𝑟 at a time, denoted by 𝑃 𝑛, 𝑟 or
𝑖 𝑃 , is given by 𝑖 𝑃 = 𝑛! . If 𝑛 = 𝑟, then 𝑖 𝑃 = 𝑛!.
𝑛 𝑟 𝑛 𝑟𝑛−𝑟 ! 𝑛 𝑟
 Learn about It!

Example:
Evaluate 6𝑃3 .
𝑖
𝑛!
𝑛𝑃𝑟 =
𝑛−𝑟 !
𝑖
6!
6𝑃3 =
6−3 !
6!
=
3!
6 5 4 3!
=
3!
= 6(5)(4)
= 120
 Try It!

Example 1: In how many ways can you arrange 8 students in

a photograph?
 Try It!

Example 1: In how many ways can you arrange 8 students in

a photograph?

Solution:
We need to determine the number of permutations of the 8
students.

1. Identify 𝑛 and 𝑟.

There are 8 students, so 𝑛 = 8. All the students are to be

arranged in the photograph at a time, so 𝑟 = 8.
 Try It!

2. Substitute 𝑛 and 𝑟 into the formula.

Since 𝑛 = 𝑟, we reduce the formula to 𝑛𝑖𝑃𝑟 = 𝑛!.

𝑖
𝑛𝑃𝑟 = 𝑛!
𝑖
8𝑃8 = 8!
= 8 7 6 ∙∙∙ 2 1
= 40 320

Therefore, the 8 students can be arranged in 𝟒𝟎 𝟑𝟐𝟎 ways.

 Learn about It!

3 Solving the Number of Circular Permutations of 𝒏

Objects
the number of circular permutations of 𝑛 objects is (𝑛 − 1)!

Example:
𝑛−1 != 4−1 !
= 3!
=6

Thus, there are 6 possible arrangements.

 Try It!

Example 1: In how many ways can you arrange 5 objects in a

circular pattern?
 Try It!

Example 1: In how many ways can you arrange 5 objects in a

circular pattern?
Solution:
To determine the number of circular permutations of a
group of objects, we use the formula 𝑛 − 1 !. Since there are
5 objects, we use 𝑛 = 5.
𝑛−1 != 5−1 !
= 4!
=4⋅3⋅2⋅1
= 24
Thus, there are 𝟐𝟒 ways of arranging 5 objects in a circular
pattern.
 Combinations
The number of combinations of n
elements taken r at a time is

n!
n Cr =
r!(n − r )!
Order does
WhereNOT matter!
n & r are nonnegative integers & r < n
 Learn about It!

Combination
2 a selection whose order does not matter from a set of objects

Example:

A selection of three representatives from a class of 20

students is a combination since the order of the chosen
representatives does not matter.
 Learn about It!

3 Solving the Number of Combinations of 𝒏 Objects

Taken 𝒓 at a Time
The number of combinations of 𝑛 objects taken 𝑟 at a time, denoted by 𝐶 𝑛, 𝑟 or
𝑛!
𝑖
𝐶
𝑛 𝑟 , is given by 𝑖
𝐶
𝑛 𝑟 = .
𝑛−𝑟 !𝑟!

Example: Evaluate 8𝑖𝐶5 .

𝑖
𝑛! 8! 8! 8∙7∙6
𝑛𝐶𝑟 = = = = = 56
𝑛 − 𝑟 ! 𝑟! 8 − 5 ! 5! 3! 5! 3!

Thus, 8𝑖𝐶5 = 56.

How many committees of three can
be selected from four people?
Use A, B, C, and D to represent the people
Note: Does the order matter?

4!
4 C3 = =4
3!1!
 Try It!

Example 2: Johnny has to choose three toppings for his

pizza. In how many ways can Johnny choose if there are 7
pizza toppings available?
 Try It!

Example : Johnny has to choose three toppings for his pizza.

In how many ways can Johnny choose if there are 7 pizza
toppings available?

Solution:
1. Analyze the problem.

We need to determine the number of combinations of the

7 toppings taken three at a time.
 Try It!

Example 2: Johnny has to choose three toppings for his

pizza. In how many ways can Johnny choose if there are 7
pizza toppings available?

Solution:
2. Identify 𝑛 and 𝑟.

There are 7 toppings available, so 𝒏 = 𝟕. Only three

toppings will be chosen, so 𝒓 = 𝟑.
 Try It!

Example 2: Johnny has to choose three toppings for his

pizza. In how many ways can Johnny choose if there are 7
pizza toppings available?

Solution:
3. Substitute 𝑛 and 𝑟 into the formula.

𝑛! 7! 7! 7 6 5 (4!) 210
𝑛𝐶𝑟 = 𝑛−𝑟 !𝑟!
𝑖
= = = = = 35
7−3 !3! 4!3! 4!∙3 2 (1) 6
 Try It!

Example 2: Johnny has to choose three toppings for his

pizza. In how many ways can Johnny choose if there are 7
pizza toppings available?

Solution:

Thus, there are 𝟑𝟓 possible ways for Jim to choose toppings

for his pizza.
Mathematics in the Modern World

Apportionment

Ezra Aguilar, Ph.D.

University of Santo Tomas
Apportionment in the Philippines:
1987 Constitution
Article VI, Section 5, states that
“(1) The House of Representatives shall be composed of not more than two
hundred and fifty members, unless otherwise fixed by law, who shall be
elected from legislative districts apportioned among the provinces, cities,
and the Metropolitan Manila area in accordance with the manner of their
respective inhabitants, and on the basis of a uniform and progressive ratio,
and those who, as provided by law, shall be elected through a party-list
system of registered national, regional, and sectoral parties or
organizations.”
“(3) Each legislative district shall comprise, as far as practicable,
contiguous, compact, and adjacent territory. Each city with a population of
at least two hundred fifty thousand, or each province, shall have at least
one representative.”

36
Apportionment in the Philippines
House of Representatives
apportionment is based from the
1980 census.

297 representatives
234 district representatives
63 sectoral representatives
(party list)

Sectoral representatives
✓ Must have 2% of the total votes
✓ Maximum 3 seats per party
✓ Maximum of 20% sectoral rep.
Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.
Apportionment

The act of dividing items between different groups

according to some plan, especially to make
proportionate distribution in a fair manner.
Terminologies

States − the parties having a stake in the

apportionment.

Seats − indivisible objects that are divided among n

states.

Population − set of n positive numbers that are used

as the basis for the apportionment of the
seats to the states.
Terminologies

Standard Divisor (𝒅)

− ratio of the total population to the total number of
seats to be allocated

𝑡𝑜𝑡𝑎𝑙 𝑝𝑜𝑝𝑢𝑙𝑎𝑡𝑖𝑜𝑛
𝑑=
𝑡𝑜𝑡𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑠𝑒𝑎𝑡𝑠

Standard Quota (𝒒)

− ratio of a state’s population to the standard divisor
𝑠𝑡𝑎𝑡𝑒 ′ 𝑠 𝑝𝑜𝑝𝑢𝑙𝑎𝑡𝑖𝑜𝑛
𝑞=
𝑠𝑡𝑎𝑛𝑑𝑎𝑟𝑑 𝑑𝑖𝑣𝑖𝑠𝑜𝑟 𝑑
Example

For example, if the population of a state is

94,700 and the standard divisor d = 20,100,
then the state’s standard quota
94,700
𝑞= = 4.711442786 …
20100
A standard quota can be interpreted as the
number of seats allocated to a specific state.
Quota Rule

Lower quota – standard quota rounded down

to the nearest whole number.

Upper quota – standard quota rounded up to

the nearest whole number.

If the standard quota is an exact integer, then

the lower quota equals the standard quota.
Hamilton’s Method

▪ Proposed by Alexander
Hamilton (1755-1804)
▪ First apportionment method
to be approved in the United
States of America Congress,
but was vetoed by President
George Washington in 1792.
▪ Hamilton’s method tends to
favor larger states
 Steps in Hamilton’s Method

1. Determine how many people each representative should represent by

calculating the standard divisor.
2. Divide each state’s population by the divisor to determine how many
representatives it should have, aka standard quota.
3. Cut off all the decimal parts of all the quotas. Add up the remaining
whole numbers.
4. Assuming that the total from Step 3 was less than the total number of
representatives, assign the remaining representatives, one each, to the
states whose decimal parts of the quota were largest, until the desired
total is reached.
Example 1

Suppose the Phil. Constitution were amended and the

250 members of the House of Representatives will be
apportioned among regions. Using the data in the 2015
National Population Census per Region as shown in the
table below, determine the apportionment using
Hamilton’s method.

Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.

Example 1
No Region Population
1 National Capital Region (NCR) 12,877,253
2 Cordillera Administrative Region (CAR) 1,722,006
3 Region I (Ilocos Region) 5,026,128
4 Region II ( Cagayan Valley) 3,451,410
5 Region III (Central Luzon) 11,218,177
6 Region IV-A (CALABARZON) 14,414,774
7 Region IV-B (MIMAROPA) 2,963,360
8 Region V (Bicol Region) 5,796,989
9 Region VI (Western Visayas) 4,477,247
10 Region VII (Central Visayas) 6,041,903
11 Negros Island Region (NIR) 1 4,414,131
12 Region VIII (Eastern Visayas) 4,440,150
13 Region IX (Zamboanga Peninsula) 3,629,783
14 Region X (Northern Mindanao) 4,689,302
15 Region XI (Davao Region) 4,893,318
16 Region XII (SOCCSKSSARGEN) 4,545,276
17 Autonomous Region of Muslim Mindanao (ARMM) 3,781,387
18 Region XIII (Caraga) 2,598,843
Total 100,981,437 46
Example 1 (Solution)

• Compute for the standard divisor:

𝑡𝑜𝑡𝑎𝑙 𝑝𝑜𝑝𝑢𝑙𝑎𝑡𝑖𝑜𝑛 100,981,437
•𝑑= = =403,925.75
1 𝑡𝑜𝑡𝑎𝑙 𝑛𝑜 𝑜𝑓 𝑠𝑒𝑎𝑡𝑠 250

• Compute for each standard quota:

• e.g. 12,877,253
2 ÷403,925.75= 31.880

47
Example 1 (Solution)
Region Population Standard
Quota
NCR 12,877,253 31.880
CAR 1,722,006 4.263
Region I 5,026,128 12.443
Region II 3,451,410 8.545
Region III 11,218,177 27.773
Region IV-A 14,414,774 35.687
Region IV-B 2,963,360 7.336
Region V 5,796,989 14.352
Region VI 4,477,247 11.084
Region VII 6,041,903 14.958
NIR 4,414,131 10.928
Region VIII 4,440,150 10.992
Region IX 3,629,783 8.986
Region X 4,689,302 11.609
Region XI 4,893,318 12.114
Region XII 4,545,276 11.253
ARMM 3,781,387 9.362
Region XIII 2,598,843 6.429
Total 100,981,437
48
Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.
Steps in Hamilton’s Method

• Cut off all the decimal parts of all the

quotas. Add up the remaining whole
3 numbers.
Example 1 (Solution)
Region Population Standard Lower
Quota Quota
NCR 12,877,253 31.880 31
CAR 1,722,006 4.263 4
Region I 5,026,128 12.443 12
Region II 3,451,410 8.545 8
Region III 11,218,177 27.773 27
Region IV-A 14,414,774 35.687 35
Region IV-B 2,963,360 7.336 7
Region V 5,796,989 14.352 14
Region VI 4,477,247 11.084 11
Region VII 6,041,903 14.958 14
NIR 4,414,131 10.928 10
Region VIII 4,440,150 10.992 10
Region IX 3,629,783 8.986 8
Region X 4,689,302 11.609 11
Region XI 4,893,318 12.114 12
Region XII 4,545,276 11.253 11
ARMM 3,781,387 9.362 9
Region XIII 2,598,843 6.429 6
Total 100,981,437 240
50
Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.
Steps in Hamilton’s Method

• Assuming that the total from Step 3 was less

than the total number of representatives,
4 assign the remaining representatives, one each,
to the states whose decimal parts of the quota
were largest, until the desired total is reached.
Example 1 (Solution)
Region Population Standard Lower Extra Final
Quota Quota Seat Allocation
NCR 12,877,253 31.880 5th 31 1 32
CAR 1,722,006 4.263 4 4
Region I 5,026,128 12.443 10th 12 1 13
Region II 3,451,410 8.545 9th 8 1 9
Region III 11,218,177 27.773 6 th 27 1 28
Region IV-A 14,414,774 35.687 7th 35 1 36
Region IV-B 2,963,360 7.336 7 7
Region V 5,796,989 14.352 14 14
Region VI 4,477,247 11.084 11 11
Region VII 6,041,903 14.958 3rd 14 1 15
NIR 4,414,131 10.928 4th 10 1 11
Region VIII 4,440,150 10.992 1st 10 1 11
Region IX 3,629,783 8.986 2nd 8 1 9
Region X 4,689,302 11.609 8 th 11 1 12
Region XI 4,893,318 12.114 12 12
Region XII 4,545,276 11.253 11 11
ARMM 3,781,387 9.362 9 9
Region XIII 2,598,843 6.429 6 6
Total 100,981,437 240 10 250
52
Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.
Jefferson’s Method

▪ Proposed by Thomas
Jefferson (1743-1826)
▪ First used in US Congress in
1792 until 1840.
▪ Jefferson’s method tends to
favor larger states
▪ First steps are the same with
Hamilton’s method
 Steps in Jefferson’s Method

1. Determine how many people each representative should represent by

calculating the standard divisor.
2. Divide each state’s population by the divisor to determine how many
representatives it should have, aka standard quota.
3. Cut off all the decimal parts of all the quotas. Add up the remaining
whole numbers.
4. If the total from Step 3 was less than the total number of
representatives, reduce the divisor and recalculate the quota and
allocation. Continue doing this until the total in Step 3 is equal to the
total number of representatives.
Example 2

The House of Representatives of a certain country

needs 41 new members to divide among three
states A, B, and C. The population data of the 3
states are as follows:
State A B C Total
Population 162,310 538,479 197,145 897,934

Use the Jefferson’s method to allocate the 41 new

members.
Example 2 (Solution)

• Compute for the standard divisor:

𝑡𝑜𝑡𝑎𝑙 𝑝𝑜𝑝𝑢𝑙𝑎𝑡𝑖𝑜𝑛 897,934
•𝑑= = =21,900.83
1 𝑡𝑜𝑡𝑎𝑙 𝑛𝑜 𝑜𝑓 𝑠𝑒𝑎𝑡𝑠 41

• Compute for each standard quota:

• e.g. 162,310 ÷21,900.83= 7.4111
2

56
Example 2 (Solution)

𝑑 =21,900.83

State Population standard

quota
A 162,310 7.4111
B 538,479 24.5872
C 197,145 9.0017
Total 897,934

57
Example 2 (Solution)

• Cut off all the decimal parts of all the quotas.

3 Add up the remaining whole numbers

State Population standard lower

quota quota
A 162,310 7.4111 7
B 538,479 24.5872 24
C 197,145 9.0017 9
Total 897,934 40

58
Example 2 (Solution)

State Population standard lower

quota quota
A 162,310 7.4111 7
B 538,479 24.5872 24
C 197,145 9.0017 9
Total 897,934 40

41 representatives are needed and 21,900.82927

gives only 40. So, we need to reduce the divisor
until we get the 41. Let us try a smaller divisor.

59
Example 2 (Solution)

• If the total from Step 3 was less than the total number of
representatives, reduce the divisor and recalculate the
quota and allocation. Continue doing this until the total in
4 Step 3 is equal to the total number of representatives.

𝑑𝑚 =21,500
State Population standard lower
quota quota
A 162,310 7.5493 7
B 538,479 25.0455 25
C 197,145 9.1695 9
Total 897,934 41
60
Adam’s Method

▪ Proposed by John Quincy Adams

(1767-1848)
▪ Adams proposed using a modified
divisor greater than the standard
divisor, and he rounded up his
quotas.
▪ It tends to favor smaller states.
 Steps in Adam’s Method

1. Determine the upper quotas using the standard divisor.

2. Then add the upper quotas. If the sum of the upper quotas equals the total
number of seats to be apportioned, the apportionment process is complete.
3. If the sum of the upper quotas does not equal the total number of seats to be
apportioned, choose a modified divisor greater than the standard divisor and
calculate the modified quotas and upper modified quotas.
4. Repeat step 3 until you find a modified divisor such that the sum of the upper
modified quotas equals the total number of seats to be apportioned. Each state
receives a number of seats equal to its upper modified quota, and the
apportionment process is complete.
Example 3

Use Adam’s Method of Apportionment to assign

10 seats for 3 districts in the House of
Representatives. The population data are given
in the following table:

District 1 2 3 Total
Population 94,700 72,600 33,700 201,000
Example 3 (Solution)

• Determine the upper quotas using the standard divisor.

201,000
1 • 𝑑= = 20,100
10
• Then add the upper quotas. If the sum of the upper quotas equals
the total number of seats to be apportioned, the apportionment
2 process is complete.

District Population Standard Upper

Quota Quota
1 94,700 4.71 5
2 94,700 3.61 4
3 33,700 1.68 2
Total 201,000 11

64
Example 3 (Solution)

• If the sum of the upper quotas does not equal the total
number of seats to be apportioned, choose a modified
divisor greater than the standard divisor and calculate
3 the modified quotas and upper modified quotas.

District Population Standard Upper

Quota Quota
1 94,700 4.71 5
2 94,700 3.61 4
3 33,700 1.68 2
Total 201,000 11

In example #3, 10 seats are needed and 𝑑 = 20,100

gives 11. So, we need to modify and make the divisor
larger until we get the 10. Let us try 𝑑 = 23,800.
65
Example 3 (Solution)

𝑑𝑚 = 23,800

District Population Standard Upper Modified Upper

Quota Quota Quota Modified Quota
1 94,700 4.71 5 3.98 4
2 94,700 3.61 4 3.05 4
3 33,700 1.68 2 1.42 2
Total 201,000 11 10

Because the sum of the upper quotas (10) equals the

total number of seats to be allocated (10), the
apportionment process is complete.
Webster’s Method

▪ Proposed by Daniel Webster

(1782-1852)
▪ Adam’s method differs from
Jefferson’s by rounding off the
quotas to the nearest whole
number instead of rounding
down.
▪ It tends to favor smaller states.
 Steps in Webster’s Method

1. Determine how many people each representative should represent by calculating the
standard divisor.
2. Divide each state’s population by the divisor to determine how many representatives
it should have, aka standard quota.
3. Round all the quotas to the nearest whole number (but don’t forget what the
decimals were). Add up the remaining whole numbers.
4. If the total from Step 3 was less than the total number of representatives, reduce the
divisor and recalculate the quota and allocation. If the total from step 3 was larger
than the total number of from step 3 was larger than the total number of
representatives, increase the divisor and recalculate the quota and allocation.
Example 4

Suppose the newly bought 30 police patrol

cars of the Philippine National Police –
National Capital Region are selected
according to the 2015 census of most
populated cities in Metro Manila, as shown
in the table below. Use Webster’s method
to determine the number of cars each city
should have.

City Quezon Manila Caloocan Taguig Pasig Parañaque Valenzuela Makati

Population 2,936,000 1,780,000 1,580,000 805,000 755,000 666,000 622,000 585,000

Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.

Example 4 (Solution)

• Calculate the standard divisor.

1

• Determine each city’s standard quota.

2

City Population s. quota

Quezon 2,936,000 9.053
𝟗, 𝟕𝟐𝟗, 𝟎𝟎𝟎 Manila 1,780,000 5.489
𝒅= Caloocan 1,580,000 4.872
𝟑𝟎
= 𝟑𝟐𝟒, 𝟑𝟎𝟎 Taguig 805,000 2.482
Pasig 755,000 2.328
Parañaque 666,000 2.054
Valenzuela 622,000 1.918
Makati 585,000 1.804
Total 9,729,000
Example 4 (Solution)

• Round all the quotas to the nearest whole number (but don’t forget
3 what the decimals were). Add up the remaining whole numbers.

City Population s. quota Rounded Quota

Quezon 2,936,000 9.053 9
Manila 1,780,000 5.489 5
Caloocan 1,580,000 4.872 5
Taguig 805,000 2.482 2
Pasig 755,000 2.328 2
Parañaque 666,000 2.054 2
Valenzuela 622,000 1.918 2
Makati 585,000 1.804 2
Total 9,729,000 29
In example #4, 30 cars are to be distributed. Modified < Standard
Divisor Divisor
So, we modify the quota and make it smaller. (324,300)
Example 4 (Solution)

• If the total from Step 3 was less than the total number of
representatives, reduce the divisor and recalculate the quota
4 and allocation.

𝒅𝒎 = 𝟑𝟐𝟑, 𝟎𝟎𝟎
City Population Modified standard Rounded
quota Quota
Quezon 2,936,000 9.090 9
Manila 1,780,000 5.511 6
Caloocan 1,580,000 4.892 5
Taguig 805,000 2.492 2
Pasig 755,000 2.337 2
Parañaque 666,000 2.062 2
Valenzuela 622,000 1.926 2
Makati 585,000 1.811 2
Total 9,729,000 30
Mathematics in the Modern World

Voting
Ezra Aguilar
Arturo Patungan
University of Santo Tomas
Voting in the Philippines: 1987
Constitution

74
When do we Consider Voting?

• An essential element of Democratic form of

Government
✓ Selection of Leaders
✓ Creation of Laws
✓ Deciding the Outcome of Issues
• A basic element in Decision Making
• Necessary to gather the group concensus

→ In deciding upon a winner, there is always

one main goal: to reflect the preferences of
the people in the most fair way possible.

Copyright 2018: Mathematics in the Modern World by Winston S. Sirug, Ph.D.

Voting

the action or process of indicating choice, opinion, or

will on a question, such as the choosing of a candidate,
by or as if by some recognized means, such as a ballot
Plurality Method
A study was conducted to find out which
among the pressing issues in the Philippines
are the people are most concerned about.
“What is issue that Filipinos are most
concerned about?”
❑ Each person votes for his or her favorite
candidate (or choice). The candidate (or
choice) who receives the most votes is
declared the winner. (In case of a tie,
special run-off elections may be held.)
➢ Usually mistakenly considered as the
“Majority Rule” method.
➢ A winner could win even he does not
have the majority vote.
Example
• Consider the preference schedule below, in which the voters in a
barangay is voting on five different candidates for Brgy. Captain. The
candidates are called A, B, C, D, and E here for simplicity.

Number of Ballots Cast

150 340 240 360 200 300

1st choice B C B D B E

2nd choice C A D C E A

3rd choice A D C A A D

4th choice D B A E C B

5th choice e E E B D C

• Determine the winner under the plurality method.

Plurality with Elimination Method

❑ Each person votes for his or her favorite

candidate (or choice). If a candidate receives
a majority of votes, that candidate is declared
the winner. If no candidate receives a
majority, then the candidate with the fewest
votes is eliminated and a new election is held.
This process continues until a candidate
receives a majority of the votes.
Example
• A company is planning a company outing next summer.
There are three possible locations for the outing:
Amanpulo in Palawan, Pandan Island in Mindoro, and Bella
Rocca Island in Marinduque. The 1000 employees including
managers and department heads have to decide based on
costs, amenities, and safety. The results of the election is
given in the following table.
Amanpulo Bella Rocca Pandan

Number of Votes 364 336 300

• Using the plurality method of voting, which location wins?

• Using the plurality with elimination method of voting,
which location wins?
Example

Assuming the result of the new voting, with Pandan Island

being eliminated is given below. Where will the company
outing be held?
Amanpulo Bella Rocca Pandan
Number of Votes 584 416 0
Rank Choice or Instant Runoff Method

• Each voter ranks all of the candidates; that is, each

voter selects his or her first choice, second choice,
third choice, and so on. If a candidate receives a
majority of first-choice votes, that candidate is
declared the winner. If no candidate receives a
majority, then the candidate with the fewest first
choice votes is eliminated and those votes are given to
the next preferred candidate. If a candidate now has a
majority of first-choice votes, that candidate is
declared the winner. If no candidate receives a
majority, this process continues until a candidate
receives a majority.

82
Example
• Consider the voting of the 1000 employees to
choose the island for their company outing. They
were asked to write their 1st choice, 2nd choice and
3rd choice. The results are shown in the following
table preference table.
Number of Ballots Cast

168 202 215 105 90 220

1st choice A A B B P P

2nd choice B P A P A B

3rd choice P B P A B A

a) Use the plurality method to determine the winner

b) Use the instant runoff method to determine the
winner.

83
Example 1 (Solution)

b) Use the instant runoff method to determine the winner.

Because P (Pandan Island) received the fewest
number of first-choice votes (220), Pandan island
is eliminated, and a modified voter preference
schedule has to be made. The modified table is
given below after eliminating C.
Number of Ballots Cast

168 202 215 105 90 220

1st choice A A B B A B

2nd choice B B A A B A

• Inspecting the table for first-choice row: A got 168 + 202 +90 = 460
votes, and B got 215 + 105 + 220 = 540 votes. So, B is the winner
with 540 votes, or 54%, which is a majority.

84