UNIVERSITY OF SAN JOSE-RECOLETOS

SCHOOL OF BUSINESS AND MANAGEMENT

Accountancy and Finance Department

COUNTING RULES AND BASIC RELATIONSHIPS

Problem 1
A card is randomly picked from a deck of 52 cards. What is the
probability that the card is a
a. A spade?
13/52 = 25%

13: “characters”
(Alas-10, J, Q, K) x (Kamunggay, Heart, Spade,
Diamond)
52: cards

b. A king or queen?
K u Q (king, queen, both)
4/52 + 4/52 + 0/52 = 8/52 : 15.38%

c. A heart and king?
1/ 52 ; 1.92%
King – kamunggay, king- heart, king – spade, king-
diamond

d. A king and queen?

0

Problem 2
In a group of 6 boys and 4 girls, five children are to be selected
to participate in an event.
a. In how many different ways can the five children be
selected?
N!/r!(n-r)! // nCr
10C5 = 252

b. In how many different ways such that there is at least one

boy?
1B + 4G // 2B + 3G // 3B + 2G // 4B + 1G // 5B

(6C1x4C4) + (6C2x4C3) + (6C3x4C2) + (6C4x4C1) + (6C5) =

252
6!
( 1! ( 6−1 ) !)

c. In how many different ways such that there are at least two
boys and one girl?
4B + 1G // 3B + 2G // 2B + 3G
(6C4x4C1) + (6C3x4C2) + (6C2x4C3) = 240

Problem 3
A delegation of 4 employees is selected each year from a
department to attend the National Convention of Innovators’
annual meeting.

a. In how many ways can the delegation be chosen if there are

12 eligible employees?
N!/r!(n-r)! // 12/4!(12-4)! = 495 // nCr = 12C4 = 495
b. In how many ways if two of the eligible employees will not
attend the meeting together?
12C4 – 10C2 // 495-45 = 450
c. In how many ways if two eligible employees are married
and will only attend the meeting together?
Situation 1: A(1) B(2), (3??), (4??)
nCr = 10C2 = 45 ways
Situation 2: (1?) (2?) (3?) (4?)
nCr = 10C4 = 210 ways

255 ways

Problem 4
How many different signals, each consisting of 8 flags hung in a
vertical line can be formed from a set of 4 red flags, 3 white
flags and a blue flag?
a. If all flags of the same color are distinguishable?
nPr // n!/(n-r)!
8!/(8-8)!
8P8 = 40 320
8x7x6x5x4x3x2x1 = 40 320
b. If all flags of the same color are identical?
N!/r! x r! ….

8! 1 8!
( 8−8 ) !
X ( 4 ! x 3! ) ! 4 ! x 3!
=¿280

Problem 5
How many 3-letter words with or without meaning, can be
formed out of the letters of the word, 'LOGAR ITHMS',
a. If repetition of letters is allowed?
Nr = 103 = 1000
10 x 10 x 10
b. If repetition of letters is not allowed?
nPr // n!/(n-r)!
10P3 = 720

Problem 6
a. In how many different ways can the letters of the word
'OPTICAL' be arranged so that the vowels always come
together?
P T C L (OIA) // 5! X 3! = 720
Situation 1 : P T C L
nPr = 5P4 = 120
Situaion 2: OIA
nPr = 3P3 = 6

120 x 6 = 720 ways

b. In how many different ways can the letters of the word

'CORPORATION' be arranged so that the vowels always
come together?

CRPRTN (O O A I O)
7! / 2! = 2520 5!/3! = 20
NPr/ # of repetitions
7P6 / 2 = 2520 5P3 / 3 = 20
2520 x 20 = 50 400
Problem 7
Five high-profile guests, A, B, C, D and E, are invited to a
corporate dinner party.
a. In how many ways can these 5 people be seated at a
round table?
CIRCULAR PERMUTATION = (n-1)!
(5-1)! = 24

b. In how many ways so that A and B must always sit

together.
AB, C, D, E
(4-1)! (2!) = 12

c. In how many ways so that C and D must not sit together.

24 – 12 = 12 ways

(5-1)! - (4-1)! (2!) = 12