Last visit was: 05 Dec 2024, 19:29 It is currently 05 Dec 2024, 19:29
Close
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
pariearth
Joined: 01 Dec 2012
Last visit: 03 Jul 2014
Posts: 36
Own Kudos:
Given Kudos: 10
Location: India
WE:Project Management (Retail: E-commerce)
Posts: 36
Kudos: 70
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 05 Dec 2024
Posts: 15,531
Own Kudos:
Given Kudos: 449
Location: Pune, India
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 15,531
Kudos: 70,044
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
sunny3011
Joined: 06 Dec 2012
Last visit: 22 Dec 2014
Posts: 20
Own Kudos:
Given Kudos: 18
Concentration: Finance, International Business
GMAT 1: 510 Q46 V21
GPA: 3.5
GMAT 1: 510 Q46 V21
Posts: 20
Kudos: 221
Kudos
Add Kudos
Bookmarks
Bookmark this Post
User avatar
sunny3011
Joined: 06 Dec 2012
Last visit: 22 Dec 2014
Posts: 20
Own Kudos:
Given Kudos: 18
Concentration: Finance, International Business
GMAT 1: 510 Q46 V21
GPA: 3.5
GMAT 1: 510 Q46 V21
Posts: 20
Kudos: 221
Kudos
Add Kudos
Bookmarks
Bookmark this Post
VeritasPrepKarishma
pariearth
Pemutations & Combinations Questions

Q1. A security agency assigns a two-digit code with distinct digits to each of its members using the digits 0,1,2,3....,9 such that the first digit of the code is not zero. However the code printed on a badge can potentially create confusion when read upside down. For example, the code 18 may appear as 81. How many codes are there for which there for which no such confusion can arise?
a. 69 b. 71 c. 81 d. 65 e. 68


First think of how the numbers change when the card is held upside down. The digit on the right comes to the left and the digit on the left goes to the right.

18 -> 81

Also the numbers turn upside down. Since 1 and 8 are symmetrical, turning them upside down doesn't change anything.
Now, 0, 1 and 8 are symmetrical. When you turn 6 upside down, it becomes 9 so it is a source of confusion too.
So how many numbers can create confusion? Since 0 cannot be on the left side in the number, a number that has 0 cannot create confusion (even if the 0 is on the right side, when you turn the card, it will come to the left which is not acceptable)
So the tens digit can take one of 4 values (1, 6, 8, 9) and the unit's digit can take one of the leftover 3 values in 4*3 = 12 ways
This 12 includes 69 and 96. Note that when you turn 69 upside down, it stays 69 (9 comes to the left and 6 goes to the right but 9 becomes 6 and 6 becomes 9)
Hence the numbers that can cause confusion = 12 - 2 = 10
Total numbers that can be formed = 9*9 = 81 (select tens digit in 9 ways and units in 9 ways)
No of numbers in which no confusion arises = 81 - 10 = 71





Need help on solving 7th question...
User avatar
IanStewart
User avatar
GMAT Tutor
Joined: 24 Jun 2008
Last visit: 04 Dec 2024
Posts: 4,125
Own Kudos:
Given Kudos: 97
 Q51  V47
Expert reply
Posts: 4,125
Kudos: 9,894
Kudos
Add Kudos
Bookmarks
Bookmark this Post
pariearth

Q7. Mac has forgotten his friends 8-digit telephone number but remembers the following:
i) the first 3 digit are either 270 or 279.
ii) the digit 0 occurs exactly three times and the digit 9 occurs exactly one time.
iii) the number was an even number.
If he were to use a trial & error method to reach his friend, what is the minimum number of trials he has to make to be sure to succeed?
a. 1664 b. 1544 c. 832 d. 1280 e. 2000

These questions are not at all similar to real GMAT questions - they're way too complicated, and there aren't any real shortcuts. In this phone number question, we have four separate cases:

Case 1: phone number is 270-XXXX-0

- one of the four X's is a nine, so we have 4 choices for where to put the nine
- then one of the three remaining X's is a zero, so we have 3 choices for where to put the zero
- then we have 8 choices for the two remaining digits (they cannot be 0 or 9)

So we have 4*3*8*8 possibilities

Case 2: phone number is 270-XXXX-E, where E is even and nonzero

- we have 4 choices for E (it is 2, 4, 6, or 8)
- one of the four X's is a nine, so we have 4 choices
- two of the remaining three digits are zero, so we have 3 choices (3C2)
- for the remaining digit we have 8 choices (cannot be 0 or 9)

So we have 4*4*3*8 possibilities

Case 3: phone number is 279-XXXX-0

- we have 4C2 = 6 choices for where to put the remaining zeros
- we have 8 choices for each of the two other digits

So we have 6*8*8 possibilities

Case 4: phone number is 279-XXXX-E where E is even and nonzero

- we have 4 choices for E
- we have 4C3 = 4 choices for where to put the three zeros
- we have 8 choices for the other digit

So we have 4*4*8 possibilities.

Adding the possibilities from each case, we get the answer:

4*3*8*8 + 4*4*3*8 + 6 * 8 * 8 + 4 * 4 * 8 = 1664

I guarantee you will never see a problem anywhere close to as awkward as this on the GMAT - when you have cases in a GMAT counting problem and no shortcut that allows you to bypass the case analysis, you will almost always have only two cases to consider.
Moderator:
Math Expert
97566 posts