password

This topic has expert replies
User avatar
Legendary Member
Posts: 866
Joined: Mon Aug 02, 2010 6:46 pm
Location: Gwalior, India
Thanked: 31 times

password

by goyalsau » Sun Nov 21, 2010 5:05 am
A has to create a password having 5 distinct characters using at least 2 digits (from 7 to 9) and at least two english vowels (from A, E, I, O, U). No character other than digit from 7 to 9 and vowels from english alphabets are allowed in that password. When the password starts with a digit it must end with an alphabet and when it starts with an alphabet it must end with a digit. Find the number of possible passwords that A can create.

(a) 1260
(b) 4480
(c) 3620
(d) 2880
Saurabh Goyal
[email protected]
-------------------------


EveryBody Wants to Win But Nobody wants to prepare for Win.
Source: — Problem Solving |

Junior | Next Rank: 30 Posts
Posts: 19
Joined: Fri Jul 16, 2010 1:27 am

by RikaMueller » Sun Nov 21, 2010 5:46 am
One question for clarification. Can vowels and numbers be taken twice or trice? Or are they only allowed to appear once in the password?

Legendary Member
Posts: 1119
Joined: Fri May 07, 2010 8:50 am
Thanked: 29 times
Followed by:3 members

by diebeatsthegmat » Sun Nov 21, 2010 6:43 pm
goyalsau wrote:A has to create a password having 5 distinct characters using at least 2 digits (from 7 to 9) and at least two english vowels (from A, E, I, O, U). No character other than digit from 7 to 9 and vowels from english alphabets are allowed in that password. When the password starts with a digit it must end with an alphabet and when it starts with an alphabet it must end with a digit. Find the number of possible passwords that A can create.

(a) 1260
(b) 4480
(c) 3620
(d) 2880
this question is tough... my brain is dumb! if there's any question in the real test like this, i will say good bye to gmat score!

User avatar
Legendary Member
Posts: 866
Joined: Mon Aug 02, 2010 6:46 pm
Location: Gwalior, India
Thanked: 31 times

by goyalsau » Mon Nov 22, 2010 11:05 pm
I don't think it is that tough, That it can not be answered on this forum
Saurabh Goyal
[email protected]
-------------------------


EveryBody Wants to Win But Nobody wants to prepare for Win.

User avatar
Community Manager
Posts: 991
Joined: Thu Sep 23, 2010 6:19 am
Location: Bangalore, India
Thanked: 146 times
Followed by:24 members

by shovan85 » Mon Nov 22, 2010 11:36 pm
goyalsau wrote:A has to create a password having 5 distinct characters using at least 2 digits (from 7 to 9) and at least two english vowels (from A, E, I, O, U). No character other than digit from 7 to 9 and vowels from english alphabets are allowed in that password. When the password starts with a digit it must end with an alphabet and when it starts with an alphabet it must end with a digit. Find the number of possible passwords that A can create.

(a) 1260
(b) 4480
(c) 3620
(d) 2880
_ _ _ _ _

1. We use 2 digits and 3 alphabets:

a. We use first as digit and last as alphabet

first can be chosen in = 3 ways (digit)
last can be chosen in = 5 ways (alphabet)
In remaining 3 places 1 digit out of remaining 2 digits can be chosen in 3*C(2,1) = 6 ways
In remaining 2 places 2 alphabets out of remaining 4 alphabets can be chosen in 2*C(4,2) = 12 ways

Total = 3*5*6*12 = 1080

b. We use first as alphabet and last as digit

last can be chosen in = 3 ways (digit)
first can be chosen in = 5 ways (alphabet)
In remaining 3 places 1 digit out of remaining 2 digits can be chosen in 3*C(2,1) = 6 ways
In remaining 2 places 2 alphabets out of remaining 4 alphabets can be chosen in 2*C(4,2) = 12 ways

Total = 3*5*6*12 = 1080

2. We use 3 digits and 2 alphabets:

a. We use first as digit and last as alphabet

first can be chosen in = 3 ways (digit)
last can be chosen in = 5 ways (alphabet)
In remaining 3 places 1 alphabets out of remaining 4 alphabets can be chosen in 3*C(4,1) = 12 ways
In remaining 2 places 2 digits out of remaining 2 digits can be chosen in 2*C(2,2) = 2 ways

Total = 3*5*12*2 = 360

b. We use first as alphabet and last as digit

last can be chosen in = 3 ways (digit)
first can be chosen in = 5 ways (alphabet)
In remaining 3 places 1 alphabets out of remaining 4 alphabets can be chosen in 3*C(4,1) = 12 ways
In remaining 2 places 2 digits out of remaining 2 digits can be chosen in 2*C(2,2) = 2 ways

Total = 3*5*12*2 = 360

Total number of possible passwords = 1080+1080+360+360 = 2880
If the problem is Easy Respect it, if the problem is tough Attack it