Each of the 11 letters A, H, I, M, O, T, U, V, W, X and Y appears same when looked at in a mirror. They are called symmetric letters. Other letters in the alphabet are asymmetric letters. How many three letter computer passwords can be formed (no repetition allowed) with at least one symmetric letter?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
One might attempt to solve this problem by counting how many possible passwords contain exactly one, two, and three symmetric letters, and then sum it. However, complementary counting reduces the amount of counting needed. In this problem, we could just count how many passwords have no more than one symmetric letter (which means all the three letters are asymmetric), and how many passwords are able to be arranged, neglecting any restrictions.
Note that there are ( 1 5 − 3 ) ! 1 5 ! ways to arrange three distinct asymmetric letters out of 1 6 asymmetric letters available, while there are ( 2 6 − 3 ) ! 2 6 ! ways to arrange three distinct letters from 2 6 letters in the alphabet.
So, there are 2 3 ! 2 6 ! − 1 2 ! 1 5 ! = 2 6 × 2 5 × 2 4 − 1 5 × 1 4 × 1 3 = 1 2 8 7 0 possible passwords consisting theee letters, including at least one symmetric letter.
n(at least one symmetric letter in 3-letter codes)
= n(all possible 3-letter codes) – n(all asymmetric letters in 3-letter codes)
= ( 26 × 25 × 24 ) – ( 15 × 14 × 13 )
= 12870
Problem Loading...
Note Loading...
Set Loading...