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.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Amy is organizing her bookshelves and finds that she has
[#permalink]
Show Tags
Updated on: 12 Apr 2014, 06:54
2
4
00:00
A
B
C
D
E
Difficulty:
35% (medium)
Question Stats:
65% (00:59) correct 35% (01:32) wrong based on 244 sessions
HideShow timer Statistics
Amy is organizing her bookshelves and finds that she has 10 different types of books. She then codes each book with either a single letter or a pair of two different letters. If each type of book is uniquely represented by either a single letter or pair of letters, what is the smallest number of letters Amy will need to create the codes for all 10 types of books? (Assume the order of letters in a pair does not matter.)
The question asks for the smallest value of n, such that (n + nC2) = 10 (n represents the number of letters. In this equation, n by itself is for single-letter codes and nC2 is for two-letter codes).
At this point, you'd need to pick numbers, since there's really no easy way to solve nC2 = (10 – n) without a calculator. Looking at the answer choices, you can eliminate 10 and 20, so you can quickly narrow down the values you need to test. (i.e. (10 – n) suggests n can not be greater than 10.)
As a general rule, whenever you're asked for the smallest value that satisfies a condition, start by testing the smallest number in the answers. Conversely, if you're asked for the largest value, start with the greatest answer. Plug-in n=4 to (n + nC2) = (4 + 4C2) = 4 + (4x3 /2) = (4 + 6) = 10
Re: Amy is organizing her bookshelves and finds that she has
[#permalink]
Show Tags
12 Apr 2014, 02:26
3
goodyear2013 wrote:
Amy is organizing her bookshelves and finds that she has 10 different types of books. She then codes each book with either a single letter or a pair of two different letters. If each type of book is uniquely represented by either a single letter or pair of letters, what is the smallest number of letters Amy will need to create the codes for all 10 types of books? (Assume the order of letters in a pair does not matter.)
The question asks for the smallest value of n, such that (n + nC2) = 10 (n represents the number of letters. In this equation, n by itself is for single-letter codes and nC2 is for two-letter codes).
At this point, you'd need to pick numbers, since there's really no easy way to solve nC2 = (10 – n) without a calculator. Looking at the answer choices, you can eliminate 10 and 20, so you can quickly narrow down the values you need to test. (i.e. (10 – n) suggests n can not be less than 10.)
As a general rule, whenever you're asked for the smallest value that satisfies a condition, start by testing the smallest number in the answers. Conversely, if you're asked for the largest value, start with the greatest answer. Plug-in n=4 to (n + nC2) = (4 + 4C2) = 4 + (4x3 /2) = (4 + 6) = 10
Amy is organizing her bookshelves and finds that she has
[#permalink]
Show Tags
24 Apr 2017, 06:32
three letters could be enough for uniquely naming 9 books i.e (3! *3) and remaining 1 could be named by taking one more letter under consideration. Least total letters would be 10
Amy is organizing her bookshelves and finds that she has 10 different
[#permalink]
Show Tags
Updated on: 04 Sep 2018, 19:11
Amy is organizing her bookshelves and finds that she has 10 different types of books. She then codes each book with either a single letter or a pair of two different letters. If each type of book is uniquely represented by either a single letter or pair of letters, what is the smallest number of letters Amy will need to create the codes for all 10 types of books? (Assume the order of letters in a pair does not matter.)
A) 3 B) 4 C) 5 F) 10 E) 20
Questions: 1) How do i rephrase this question? The Kaplan answer is not so easy to understand ( at least for me) 2) without getting into too many calculations, how can i solve this?
Thank you for your help.
Originally posted by Cinematiccuisine on 04 Sep 2018, 15:46.
Last edited by chetan2u on 04 Sep 2018, 19:11, edited 1 time in total.
Re: Amy is organizing her bookshelves and finds that she has 10 different
[#permalink]
Show Tags
04 Sep 2018, 16:42
1
Cinematiccuisine wrote:
Amy is organizing her bookshelves and finds that she has 10 different types of books. She then codes each book with either a single letter or a pair of two different letters. If each type of book is uniquely represented by either a single letter or pair of letters, what is the smallest number of letters Amy will need to create the codes for all 10 types of books? (Assume the order of letters in a pair does not matter.)
A) 3 B) 4 C) 5 F) 10 E) 20
Questions: 1) How do i rephrase this question? The Kaplan answer is not so easy to understand ( at least for me) 2) without getting into too many calculations, how can i solve this?
Since the numbers we're dealing with here are small, it is probably easiest to just solve this manually, at first, at least to understand what the question is asking about. Amy is labeling each type of book with either one or two letters. If she is using just one letter, this means there is only one code she can use:
A
If she is using two letters, then there are three:
A B AB
We are told that the order of the letters doesn't matter, so we don't have to worry about counting AB and BA separately. Now, with three letters, we have all of the above combinations, plus three more:
C AC BC
That's six total. If we add one more, then we have those six plus four more:
D AD BD CD
And that give us 10 possible codes, which is what the question is asking for So the answer is 4.
Now, if the number was much bigger, then we might need to create a formula to solve this. The easiest way to do that is to just notice the pattern. Every time we add a new letter, we get one more code (just that letter), plus the number of letters that we already have, which create the combinations of mixed letters (like AD, BD, CD). So adding C gave us 3 more codes, adding D gives us 4 more codes, adding E gives us 5 more codes, and so on. We can use that pattern to determine the number of possible codes at pretty much any step
We can write this out in terms of combinations, too. If N is the number of letters that we're using, then the number of codes can be written as:
N + NC2
So with four letters, we get 4 + 4C2 = 10 different codes.
Amy is organizing her bookshelves and finds that she has 10 different
[#permalink]
Show Tags
04 Sep 2018, 19:20
1
Cinematiccuisine wrote:
Amy is organizing her bookshelves and finds that she has 10 different types of books. She then codes each book with either a single letter or a pair of two different letters. If each type of book is uniquely represented by either a single letter or pair of letters, what is the smallest number of letters Amy will need to create the codes for all 10 types of books? (Assume the order of letters in a pair does not matter.)
A) 3 B) 4 C) 5 F) 10 E) 20
Questions: 1) How do i rephrase this question? The Kaplan answer is not so easy to understand ( at least for me) 2) without getting into too many calculations, how can i solve this?
Thank you for your help.
Please put the first few words as the topic name.
What it means? 10 books have to be given a code as a single letter such as A, B etc or as a double letter such as AB, BA, AC etc. AB and BA will be different as both are different as code
Solution Let the number of letters required is n, So single digits will be n Two digits will be nC2........ .we are not multiplying with 2! because order does not matter. So \(n+nC2\geq{10}\)........\(n+\frac{n!}{(n-2)!2!}\geq{10}........n+n(n-1)/2\geq{10}...............(2n+n^2-n}\geq{20}............n(n+1)\geq{20}.........n(n+1)\geq{4*5}..\) So minimum value = 4
Re: Amy is organizing her bookshelves and finds that she has
[#permalink]
Show Tags
04 Sep 2018, 19:40
Cinematiccuisine wrote:
Amy is organizing her bookshelves and finds that she has 10 different types of books. She then codes each book with either a single letter or a pair of two different letters. If each type of book is uniquely represented by either a single letter or pair of letters, what is the smallest number of letters Amy will need to create the codes for all 10 types of books? (Assume the order of letters in a pair does not matter.)
A) 3 B) 4 C) 5 F) 10 E) 20
Questions: 1) How do i rephrase this question? The Kaplan answer is not so easy to understand ( at least for me) 2) without getting into too many calculations, how can i solve this?
Re: Amy is organizing her bookshelves and finds that she has
[#permalink]
Show Tags
19 Sep 2018, 02:42
The question asks what is the smallest number of letters required to create at least 10 unique codes. Because the question told us that the books are numbered by EITHER a single letter or 2 different letters, and we need to find the least number of letters to create 10 codes, we can safely look into the situation in which all books are numbered by 2 different letters.
Let's call "n" is the number of letters we need to find, then we have
n x n(-1) >= 10 4 x 3 =12 -> MORE than 10 -> keep this 3 x 2 = 6 -> LESS than 10 -> discard 5 x 4 = 20 -> MORE than 10 -> but n=5 < 4 -> we pick the n=4
close
65% (00:59) correct 
