JOHNKENT N.

FLORES
IT2(6185)
ULO 1a- LET'S CHECK and LET'S ANALYZE- Permutation

Solve the following problem. Show detailed solution.

1. Evaluate:
a. 4! = 4 * 3 * 2 * 1 = 24

6! ( 6∗5∗4∗3 )
b. = =360
( 6−4 ) ! ( 2∗1 )

10 ! ( 10∗9∗8∗7∗6 )
c. = =2520
5!2 !3 ! ( 5∗4∗3∗2∗1 )

2. Ten students have appeared in a test in which the top three will get a prize. How many
possible ways are there to get the prize winners?

Given:
n = 10 number of students
m = 3 number of prize winners

Solution:
10 ! ( 10∗9∗8 ) 720
= = =120
( 10−3 ) ! ( 3∗2∗1 ) 6

⸫ There are 120 different methods to choose the top three prize winners from a
group of ten learners.

9. How many 4-letter words with or without meaning, can be formed out of the letters of the
word, 'LOGARITHMS', if repetition of letters is not allowed?

Given:
n = 9 number of given letters in “LOGARITHMS”
m = 4 number of letters in 4-letter word

Solution:
9! ( 9∗8∗7∗6 ) 3024
= = =126
( 9−4 ) ! ( 4∗3∗2∗1 ) 24

⸫ There's a total of 126 4-letter words that may be constructed, with no repeating
letters from the word “LOGARITHMS”.

10. In how many different ways can the letters of the word 'PROGRAM' be arranged such that
the vowels always come together?

Given:
n = P, R, G, M, R (5 consonant letters)
m = O, A (2 vowel letters)
JOHNKENT N. FLORES
IT2(6185)
ULO 1a- LET'S CHECK and LET'S ANALYZE- Permutation
Solution:
5! * 2! = 120 * 2 = 240