Name : Rembulan Permata Octalia

NIM : 4101418067

1. Find the number of different words that can be formed with the letters of the word
‘SUMMER’ so that the vowels are always together.
Solution :

The word ‘SUMMER’ contains 6 letters.

The letters U and E should always come together. So the letters are S, M, M, R, (UE).

Number of ways in which the letters above can be arranged = 5!/2! = 60 (since the letter
‘M’ is repeated twice).

Number of ways in which U and E can be arranged = 2! = 2 ways

Therefore, total number of permutations possible = 60*2 = 120 ways.

2. Find the number of permutations of the letters of the word ‘REMAIND’ such that the
vowels always occur in odd places.

Solution :

The word ‘REMAIND’ has 7 letters.

There are 4 consonants and 3 vowels in it.

Writing in the following way makes it easier to solve these type of questions.

(1) (2) (3) (4) (5) (6) (7)

No. of ways 3 vowels can occur in 4 different places = 4P3 = 24 ways.

After 3 vowels take 3 places, no. of ways 4 consonants can take 4 places = 4P4 = 4! = 24
ways.

Therefore, total number of permutations possible = 24*24 = 576 ways.

3. Each user on a hanphone has a password, which is four to six characters long, where each
character is an uppercase letter or digit.. Each password must contain at least one digit.
How many possible are there?

Solution :

Let P be the total number of possible passwords, and let P4, P5, P6 denote the number of
possible password of length 4, 5, and 6, respectively. By the sum rule, P = P4 + P5 + P6.

P4 = 364 – 264 = 1.222.640

P5 = 365 – 265 = 48.584.800

P6 = 366 – 266 = 1.867.866.500

So , P = P4 + P5 + P6. = 1.917.673.940

4. Suppose n+2P2 = 9 x nP2 , determine the value of n

Solution :
(𝑛 + 1)! 𝑛!
= 12
(𝑛 − 2)! (𝑛 − 2)!
(𝑛 + 2)! = 12𝑛 !
(𝑛 + 1)(𝑛 + 2)𝑛! = 12 𝑛!
(𝑛 + 1)(𝑛 + 2) = 12
(𝑛2 + 3𝑛 + 2) = 12
(𝑛2 + 3𝑛 + 2) = 9
(𝑛 + 5)(𝑛 − 2) = 0

So, n is -5 or 2

5. What is the number of whole numbers formed on the screen of a calculator which can be
recognised as numbers with (unique) correct digits when they are read inverted? The
greatest number that can be formed on the screen of the calculator is 999999.
Solution :
The digits which can be recognised as unique digits when they are Inverted in a
calculator are 0, 1, 2, 5, 6, and 9 Since the number cannot begin with zero all the numbers
having 0 at units place should be discarded for otherwise when reed upside down the
number yen begin with 3 we now :1St the different posibililities
 Number of Digits Total number of numbers

1 7

2 6 x 6 = 62

3 6 x 7 x 6 = 62 x 7

4 6 x 7 x 7 x 6 = 6 2 x 72

5 6 x 7 x 7 x 7 x 6 = 6 2 x 73

6 6 x 7 x 7 x 7 x 6 = 6 2 x 74

Thus, the number of required numbers = 7 + 62 + 62 x 7 + 62 x 72 + 62 x 73 + 62 x 74

(75 − 1)
= 7 + 62 = 7 + 6 (75 − 1) = 100843
7−1

6. Find the sum of all the 4 digit numbers that can be formed with the digits 3, 4, 4 and 2
Solution :

Here each of the digits 2 and 3 will occur at unit, tens, hundred and thousand place (
3
P3/2!) = 3 times. Digit 4 will occur at each place = 6 times;
∴ Sum of digits at unit, tens, hundred and thousand place = 3 × 3 + 6 × 4 + 3 × 2 =39.
Sum of numbers formed =
= 39 × 103 + 39× 102 + 39 × 101 + 39 × 100 = 43329

7. In a certain country, the car number plate is formed by 4 digits from the digits 1, 2, 3, 4,
5, 6, 7, 8 and 9 followed by 3 letters from the alphabet. How many number plates can be
formed if neither the digits nor the letters are repeated?
Solution :
9 P 4 × 26 P 3 = 47,174,400

8. How many numbers can be made with digits 0, 7, 8 which are greater than 0 and less than
a million?
Solution :

Since the number is greater than 0 and less than a million, so all the numbers of single
digit,
 two digits, three digits, four digits, five digits and six digits formed by the digits 0, 7 and
8 will be considered.

Now, the number of ways for selecting single digit = 2

Number of ways for selecting two digit = 2 × 3 = 6

Number of ways for selecting three digits = 2 × 3 × 3 = 18

Number of ways for selecting four digits = 2 × 3 × 3 × 3 = 54

Number of ways for selecting five digits = 2 × 3 × 3 × 3 × 3 = 162

Number of ways for selecting six digits= 2 × 3 × 3 × 3 × 3 × 3= 486

Hence, the total number of ways= (2 + 6 +18 + 54 +162 + 486) = 728.

9. A five-digit number is formed using digits 1, 3, 5, 7 and 9 without repeating any one of
them. What is the sum of all such possible numbers?
Solution :

If we fix 1 at the unit’s place, the other digits can be arranged in 4! = 24 ways.

So, there are 24 numbers which have 1 at the unit’s place and sum of these numbers is 24.

Similarly, there will be 24 numbers each with 3, 5, 7 and 9 at the unit’s place.

So, the sum of all the numbers at the unit’s place will be:

24 + 24 × 3 + 24 × 5 + 24 × 7 + 24 × 9 = 24 + 72 + 120 + 168 + 216 = 600.

Similarly, the sum of the digits at the ten’s place, hundred’s place,

thousand’s place and ten thousand’s place will be 600.

So, the sum of all numbers = 600 (1 + 10 +100 +1,000 +10,000) = 6666600.

10. An intelligence agency forms a code of two distinct digits selected from 0, 1, 2, …., 9
such that the first digit of the code is nonzero. The code, handwritten on a slip, can
however potentially create confusion, when read upsidedown-for example, the code 91
may appear as 16. How many codes are there for which no such confusion can arise?
Solution :

The available digits are 0,1,2, …9.

The first digit can be chosen in 9 ways (0 not acceptable), the second digit can be
accepted in 9 ways (digits repetition not allowed).

Thus, the code can be made in 9 × 9 = 81 ways.

Now there are only 4 digits 1, 6, 8, 9 which can create confusion.

Hence, the total number of codes which create confusion are = 4 × 3 = 12.

Out of these 12 codes 69 and 96 will not create confusion.

Hence, in total 12 – 2 = 10 codes will create confusion.

Hence, the total codes without confusion are 81 – 10 = 71