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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

A rectangular floor measures 2 by 3 meters. There are 5 white, 5 black, and 5 red parquet blocks available. If each block measures 1 by 1 meter, in how many different color patterns can the floor be parqueted?

Let's assume that there are plenty of blocks of each color available and try to answer the question under this assumption.

It doesn't matter whether the floor measures 2 by 3 or 6 by 1. We can always enumerate the square meters from 1 to 6. In fact, we have 6 available slots each of which can be filled with any of the three colors. There are 3 ^6 different ways of parqueting the floor. (QUESTION: Why do we use 3^6 here? Can someone pls explain this to me? Thank you.)

Because there are in fact only 5 blocks of each color available, it is impossible to cover the floor with one color (this would require 6 blocks of one color). Thus, we have to exclude the three patterns that involve only one color. The final answer is 729-3 = 726. .

Tough question. I was also trapped by combinatronics method.

It can be done with combinations, though this approach would be lengthier.

A rectangular floor measures 2 by 3 meters. There are 5 white, 5 black, and 5 red parquet blocks available. If each block measures 1 by 1 meter, in how many different color patterns can the floor be parqueted? (A) 104 (B) 213 (C) 577 (D) 705 (E) 726

There are 5 white, 5 black, and 5 red blocks available to fill 2*3=6 slots. Following 6 cases are possible for different pattern arrangements:

5-1: 5 blocks of the same color and 1 block of different color: \(C^1_3*C^1_2*\frac{6!}{5!}=36\), (where \(C^1_3\) is ways to choose 1 color from 3, which will provide us with 5 blocks, \(C^1_2\) is ways to choose 1 color from 2 colors left, which will provide us with 1 blocks, and \(\frac{6!}{5!}\) is ways of different arrangements of 6 blocks, XXXXXY, out of which 5 are identical);

4-2: 4 blocks of the same color and 2 block of different color: \(C^1_3*C^1_2*\frac{6!}{4!*2!}=90\), (where \(C^1_3\) is ways to choose 1 color from 3, which will provide us with 4 blocks, \(C^1_2\) is ways to choose 1 color from 2 colors left, which will provide us with 2 blocks, and \(\frac{6!}{4!*2!}\) is ways of different arrangements of 6 blocks, XXXXYY, out of which 4 X's and 2 Y's are identical);

The same way for other patterns: 4-1-1: \(C^1_3*\frac{6!}{4!}=90\); 3-3: \(C^2_3*\frac{6!}{3!*3!}=60\); 3-2-1: \(C^1_3*C^1_2*\frac{6!}{3!*2!}=360\); 2-2-2: \(\frac{6!}{2!*2*2!}=90\);

Total: 36+90+90+60+360+90=726.

Answer: E.

Shorter approach: Imagine the case in which we have not 5 blocks of each color but 6, then each slot from 2*3=6 would have 3 color choices to be filled with: white, black, or red. That means that total different ways to fill 6 slots would be 3*3*3*3*3*3=3^6;

Now, what is the difference between this hypothetical case and the one in the question? As we allowed 6 blocks of each color instead of 5, then we would get 3 patterns which are impossible when we have 5 blocks of each color: all white, all red and all black. Thus we should subtract these 3 cases: 3^6-3=726.

Answer: E.

kt00381n wrote:

Why 15!/6!9! wont work? Im confused.

I you look at the first approach you'll see that \(C^6_{15}\) doesn't give all possible patterns possible. \(C^6_{15}\) is # of different groups of 6 possible out of 15 distinct objects, which clearly is not the case here.

diddygmat wrote:

This does not make sense. Are we not counting repeating patterns here? The question syas different pattern...

for example: The pattern BBBRRR is being counted at least a 2 times here. I s my understanding right?

Thanks!

Both approaches above count different patterns. Consider the following case: there are 2 slots to fill and 4 white, 4 black, and 4 red blocks available. How many different arrangements are possible: WW WB BW WR RW BB BR RB RR

Total of 9 different arrangements. The same as if we consider approach #2 from above: each slot from 2 has 3 color choices to be filled with: white, black, or red. That means that total different ways to fill 2 slots would be 3*3=3^2=9.

Bunuel, Can you please explain why you chose 3C2 for "3-3" and 3C1*2C1 for "4-2" set above?

Similar for three color set, I am not sure why you chose 1C1 * 1C1 * 1C1 for 2-2-2 and 3C1 * 2C1 for 3-2-1 set. above. For 3-2-1, we pretty much have the same restriction. The first color COULD be chosen in 3 out of 1 ways = 3C1; The second color COULD be chosen in 2C1 ways but the third color HAS to be chosen in 1C1 ways. However, for 2-2-2 , we have the same restriction, 1 out of 3 color for the first one, 1 out of 2 for the second one and 1 out of the third color.

I think that I am missing something very fundamental here. Can you please explain the difference? Can you please help?

I'm responding to a pm from voodoochild.

First of all, with all due respect, you are an out-of-control nCr abuser --- Do you get 8C1 hours of sleep at night? Do you work 8C1 hours a day, 5C1 days a week? Do you study for the GMAT 24C1/7C1/365C1? It's wildly unnecessary to write 3C1, when we can just say 3.

Rather than try to interpret what Mr. Bunuel was thinking in each step, I just going to explain how I would think about this question.

Let's look at the 3-3 case --- it's a two color cases, and so there are 3C2 = 3 ways we can choose two colors. Given two colors --- say red and black ---- then if we choose the spaces where we put the red, the spaces for the black tiles thereby will be determined. Given six spaces, in how many ways can we choose three for the red tiles? In 6C3 = 20 ways. Total number of 3-3 case combinations = (3C2)*(6C3) = 3*20 = 60.

Now, the 4-2 case. This is very tricky. In the 3-3 case, we just had to pick two colors --- say, red and black --- and we were done ---. 3 reds and 3 blacks. Things are trickier in the 4-2 case, because if I pick my two colors --- again, say, red and black --- then I still have another choice to make: will it be 4 red and 2 blacks, or 4 blacks and 2 reds? There are 3 options on the first choice (choice of which two colors are involved) and 2 options on the second choice (which color is 4 and which one is 2). One could write that as (3C1)*(2C1), but frankly, I think that's an asinine overuse of the nCr notation. I would say: just use the Fundamental Counting Principle directly. We have three colors --- first we pick one color for the 4 tiles: that's three choices; then of the remaining two colors, we pick another for the 2 tiles: that's two choices --- total number of choices = 3*2 = 6. Then, how many ways can we place the 2 tiles in six spaces? --- 6C2 = 15. Total number of combinations = 6*15 = 90

I think that same tricky thing is the root of your question in the other cases.

In the 2-2-2 case, there's only one way we can have two of each color. We have to choose three colors, and there are only three colors from which to choose, so only 1 choice is possible. I think the monstrosity (1C1)*(1C1)*(1C1) should be taken out back and shot. Plain and simple, there's 1 way to choose all three colors. Done.

It simply doesn't make any sense, for the 2-2-2 case, to start getting into -- 3 choices for the first two tiles, and 2 choices for the second pair --- all that will be irrelevant, because of the symmetry. If we have 2 red, 2 white, and 2 black, that's identical to 2 white, 2 black, and 2 red. Remember, this part of the counting is about the colors chosen --- we would handle the distribution of the tiles on the floor in separate step. The three possible colors are equally represented, so there's only 1 way to do that.

In the 3-2-1 case, yes, we will choose three colors again, but now, unlike the 2-2-2 case, order matters. Having 3 reds, 2 blacks, and 1 white is different from having, say 3 reds, 2 whites, and 1 black. Again, I would argue that use of nCr is unnecessary, and a product of nCr's is ridiculous. Use the FCP. We have tiles of three colors, and we are going to choose for the 3-2-1 patterns. In how many ways can we choose the color that will have three tiles? Three. Given that choice, in how many ways can be pick a second color for the two tiles? Two. Once those two are determined, we have nothing else to count --- the last color must have 1 tile. So, the product of the color choices is 3*2 = 6.

Does all that make sense?

Also, I will say about this problem --- all this stuff about counting the combinations for each individual case -- I guess I see why that is belabored on this page, to give readers an iron-man workout in combinatorics, but breaking everything into cases is by far the long and awkward way to answer the overall question.

The infinitely more elegant solution, given a few times already on this page, is as follows. We have six spaces, and each one could be one of three tiles, so that's a total of 3^6 = 729 combinations. We can make every single one of those 729 patterns except three --- 6 reds, or 6 blacks, or 6 whites, are the three combinations not possible, because we have only 5 of each tile. Therefore, of the 729 possibles, we can do all except three of them. 729 - 3 = 726. That is elegant!!

In counting and combinatorics problems, there are always long and clunky ways to find the answer. The challenge, sometimes requiring considerable insight, is to find the most elegant solution. Incidentally, often that means ditching the nCr stuff and using the FCP directly.

Mike, 2 questions:- (1) I was redoing the above problem. However, for 3-2-1 case, Bunuel has calculated the number of ways to choose a color = 3C1 * 3C1 instead of 3*2. Can you please comment on that?

I'm not sure where you're looking, but in Bunuel's first post on this page, for the 3-2-1 case, he has (3C1)*(2C1), same as I have. He is using a funky notation that is not what I've seen --- his 3C1 has a 1 on the top and a 3 on the bottom, which is a little peculiar --- but despite notational differences, the underlying math is the same as what I've done.

voodoochild wrote:

(2) I understand that it is easier to use FCP. However, I really like Bunuel's method because it deals with the basics of combinatorics. While solving such Combinations problem, I see that you always had an eye for the order especially while solving 5-1 vs. 3-3 case. I don't think that such thoughts are mechanical. They are based on experience and real world imagination. I believe that solving above problem requires a detailed understanding of Cs and Ps + a real world imagination. The second part is the most crucial element because the only difference between 5-1 and 3-3 case is the order. Order matters in one and not in the other. I believe that such problems cannot be solved mechanically like a robot. Correct?

Correct. In fact, a blanket statement --- At no time on the GMAT, whether on Quant or Verbal or AWA or IR, can you ever expect sustained success with a formulaic mechanical approach. From the time you sit down to start your GMAT until the time you stand up when you are done, your critical thinking skills must be engaged to the utmost. There is absolutely no shortcut for rigorous critical thinking skills. If you are doing anything other than exercising every facet of your intelligence to the utmost, you are not doing what the GMAT continuously demands. Does that make sense?

I am curious - did you actually visualize these problems while solving or is there any mechanical method used to solve these problems. The reason why I am asking this question is: 1) To know whether there is any mechanical method

As per my previous post, abandon mechanical methods, or use them at most only tentatively. Your analysis always has to include critical thinking. Here, visualizing the situation is an irreducible part of solving the problem. It very dangerous, and ultimately not helpful, to try to find a mechanical shortcut that will excuse you from doing the hard work of visualizing.

voodoochild wrote:

2) I would crash if there were, say, 8 colors and 100 tiles. I wouldn't be able to imagine so many possibilities. I know that FCP is an easier way to solve this problem. But I wanted to know whether there is any mechanical procedure that could guide us to the answer, even though I used a long method.

That's getting into the kind of problem that only idiot-savants who don't bathe could solve with ease. The GMAT is simply not going to ask you something of this type that is beyond what most people could visualize. Yes, there are more advanced methods for keeping track of everything when it's far more than what anyone could visualize --- if you took an graduate-level course in Combinatorics, you could learn such things. But, again, that is leagues beyond what the GMAT expects.

Can you please hint on this? at least the topic of the graduate level course? I am curious.....thanks

Frankly, I have not taken graduate level combinatorics myself. My gut sense is that the majority of highly complicated problems would be solved via technology. Take, for example, the freakish problem you proposed --- 100 tiles, 8 colors, and let's say 20 tiles of each color. How many possible combinations? By paper and pencil methods, that could take a very long time. I think the shortest way for anyone to do this would be to write a program that enumerates possibilities, somehow counting only the ones that fit the constraints. I'm not really a programmer, but I believe this would be a not-very-hard thing to program.

As I said, all this is well out of the league of anything the GMAT would expect you to do. Notice, for example, in the original problem in this thread, we were given the saving grace that there were five of each color --- just one less than the number of tiles on the floor --- and that allowed for the extremely slick and elegant solution discussed above. The GMAT is absolutely not interested in posing problems that require nightmarish levels of analysis to solve. By contrast, they are all about problems that lend themselves beautifully to surpassingly elegant solutions. Most larger combinatorics problems do NOT fall in that category. That's why those question are irrelevant to GMAT preparedness.

The explanation states pretty much clearly why we use \(3^6\). I've marked the text saying that in red.

Think of it in this way:

You have a total of 6 blocks that have to be parquetted. You need to choose ONE of the THREE colored blocks for each of the 6 blocks. Let's imagine we have 6 blocks of each color (not 5 as it's stated in the question). Then we choose the colors for each of the blocks like this: 1st block. White, red or black (3 colors available), a total of \(3^1\) patterns 2nd block. White, red or black (3 colors available), a total of \(3^2\) patterns 3rd block. White, red or black (3 colors available), a total of \(3^3\) patterns 4th block. White, red or black (3 colors available), a total of \(3^4\) patterns 5th block. White, red or black (3 colors available), a total of \(3^5\) patterns 6th block. White, red or black (3 colors available), a total of \(3^6\) patterns

But in our case we have only 5 blocks of each color available. That is why we subtract 3 patterns (all 6 white, all 6 black, all 6 red) that are not possible under these circumstances from \(3^6=729\). The answer is 726.

Hope this helps.

dczuchta wrote:

A rectangular floor measures 2 by 3 meters. There are 5 white, 5 black, and 5 red parquet blocks available. Each block measures 1 by 1 meter. In how many different color patterns can the floor be parqueted?

Let's assume that there are plenty of blocks of each color available and try to answer the question under this assumption.

It doesn't matter whether the floor measures 2 by 3 or 6 by 1. We can always enumerate the square meters from 1 to 6. In fact, we have 6 available slots each of which can be filled with any of the three colors. There are 3 ^6 different ways of parqueting the floor. (QUESTION: Why do we use 3^6 here? Can someone pls explain this to me? Thank you.)

Because there are in fact only 5 blocks of each color available, it is impossible to cover the floor with one color (this would require 6 blocks of one color). Thus, we have to exclude the three patterns that involve only one color. The final answer is 729-3 = 726. .

It's not that simple. You can't use just the combinations formula here as the there are three different colors of the blocks. The number you calculated represents the number of ways you can pick 6 blocks from 15 blocks. It doesn't count all the possible patterns in it. You would be able to use that formula if you were asked for example "How many different groups of 6 can be formed from 15 people?" However, when you have a question with different objects, like blocks with different color in this question, you can't just sum 3 different sets into a single pool to pick from.

So each 2x3 block can be 3 possible color. 3x3x3x3x3x3=729 and subtract 3 because in the 3 situation when all 5 of a certain color is used up leaving 1 panel a different color. Nice problem.

Tough question. I was also trapped by combinatronics method.

It can be done with combinations, though this approach would be lengthier.

A rectangular floor measures 2 by 3 meters. There are 5 white, 5 black, and 5 red parquet blocks available. If each block measures 1 by 1 meter, in how many different color patterns can the floor be parqueted? (A) 104 (B) 213 (C) 577 (D) 705 (E) 726

There are 5 white, 5 black, and 5 red blocks available to fill 2*3=6 slots. Following 6 cases are possible for different pattern arrangements:

5-1: 5 blocks of the same color and 1 block of different color: \(C^1_3*C^1_2*\frac{6!}{5!}=36\), (where \(C^1_3\) is ways to choose 1 color from 3, which will provide us with 5 blocks, \(C^1_2\) is ways to choose 1 color from 2 colors left, which will provide us with 1 blocks, and \(\frac{6!}{5!}\) is ways of different arrangements of 6 blocks, XXXXXY, out of which 5 are identical);

4-2: 4 blocks of the same color and 2 block of different color: \(C^1_3*C^1_2*\frac{6!}{4!*2!}=90\), (where \(C^1_3\) is ways to choose 1 color from 3, which will provide us with 4 blocks, \(C^1_2\) is ways to choose 1 color from 2 colors left, which will provide us with 2 blocks, and \(\frac{6!}{4!*2!}\) is ways of different arrangements of 6 blocks, XXXXYY, out of which 4 X's and 2 Y's are identical);

The same way for other patterns: 4-1-1: \(C^1_3*\frac{6!}{4!}=90\); 3-3: \(C^2_3*\frac{6!}{3!*3!}=60\); 3-2-1: \(C^1_3*C^1_2*\frac{6!}{3!*2!}=360\); 2-2-2: \(\frac{6!}{2!*2*2!}=90\);

Total: 36+90+90+60+360+90=726.

Answer: E.

Shorter approach: Imagine the case in which we have not 5 blocks of each color but 6, then each slot from 2*3=6 would have 3 color choices to be filled with: white, black, or red. That means that total different ways to fill 6 slots would be 3*3*3*3*3*3=3^6;

Now, what is the difference between this hypothetical case and the one in the question? As we allowed 6 blocks of each color instead of 5, then we would get 3 patterns which are impossible when we have 5 blocks of each color: all white, all red and all black. Thus we should subtract these 3 cases: 3^6-3=726.

Answer: E.

kt00381n wrote:

Why 15!/6!9! wont work? Im confused.

I you look at the first approach you'll see that \(C^6_15\) doesn't give all possible patterns possible. \(C^6_15\) is # of different groups of 6 possible out of 15 distinct objects, which clearly is not the case here.

diddygmat wrote:

This does not make sense. Are we not counting repeating patterns here? The question syas different pattern...

for example: The pattern BBBRRR is being counted at least a 2 times here. I s my understanding right?

Thanks!

Both approaches above count different patterns. Consider the following case: there are 2 slots to fill and 4 white, 4 black, and 4 red blocks available. How many different arrangements are possible: WW WB BW WR RW BB BR RB RR

Total of 9 different arrangements. The same as if we consider approach #2 from above: each slot from 2 has 3 color choices to be filled with: white, black, or red. That means that total different ways to fill 2 slots would be 3*3=3^2=9.

Hope it helps.

Hi Bunnel,

I had a question regarding the selection of colors for each case.

In the first case, why are we selecting the 2 colors individually?

5-1: 5 blocks of the same color and 1 block of different color, why can't we have 3C2*6!/5!

I had a question regarding the selection of colors for each case.

In the first case, why are we selecting the 2 colors individually?

5-1: 5 blocks of the same color and 1 block of different color, why can't we have 3C2*6!/5!

Regards, Anu

3C2 will give us the # of two different colors possible from 3 colors available: {WB}, {WR}, {BR}. But in our case white provides with 5 blocks and red provides with 1 block is different from white provides with 1 blocks and red provides with 5 block: {WB} and {BW} are different, so it should be the way I wrote 3C1*2C1.

5-1: 5 blocks of the same color and 1 block of different color: \(C^1_3*C^1_2*\frac{6!}{5!}=36\), (where \(C^1_3\) is ways to choose 1 color from 3, which will provide us with 5 blocks, \(C^1_2\) is ways to choose 1 color from 2 colors left, which will provide us with 1 blocks, and \(\frac{6!}{5!}\) is ways of different arrangements of 6 blocks, XXXXXY, out of which 5 are identical);

4-2: 4 blocks of the same color and 2 block of different color: \(C^1_3*C^1_2*\frac{<}{span>6!/4!*2!}=90\), (where \(C^1_3\) is ways to choose 1 color from 3, which will provide us with 4 blocks, \(C^1_2\) is ways to choose 1 color from 2 colors left, which will provide us with 2 blocks, and \(\frac{6!}{4!*2!}\) is ways of different arrangements of 6 blocks, XXXXYY, out of which 4 X's and 2 Y's are identical);

3-3: \(C^2_3*\frac{<}{span>6!/3!*3!}=60\);

Bunuel, Can you please explain why you chose 3C2 for "3-3" and 3C1*2C1 for "4-2" set above?

Similar for three color set, I am not sure why you chose 1C1 * 1C1 * 1C1 for 2-2-2 and 3C1 * 2C1 for 3-2-1 set. above. For 3-2-1, we pretty much have the same restriction. The first color COULD be chosen in 3 out of 1 ways = 3C1; The second color COULD be chosen in 2C1 ways but the third color HAS to be chosen in 1C1 ways. However, for 2-2-2 , we have the same restriction, 1 out of 3 color for the first one, 1 out of 2 for the second one and 1 out of the third color.

I think that I am missing something very fundamental here. Can you please explain the difference?

Bunuel, Can you please explain why you chose 3C2 for "3-3" and 3C1*2C1 for "4-2" set above?

Similar for three color set, I am not sure why you chose 1C1 * 1C1 * 1C1 for 2-2-2 and 3C1 * 2C1 for 3-2-1 set. above. For 3-2-1, we pretty much have the same restriction. The first color COULD be chosen in 3 out of 1 ways = 3C1; The second color COULD be chosen in 2C1 ways but the third color HAS to be chosen in 1C1 ways. However, for 2-2-2 , we have the same restriction, 1 out of 3 color for the first one, 1 out of 2 for the second one and 1 out of the third color.

I think that I am missing something very fundamental here. Can you please explain the difference? Can you please help?

I'm responding to a pm from voodoochild.

First of all, with all due respect, you are an out-of-control nCr abuser --- Do you get 8C1 hours of sleep at night? Do you work 8C1 hours a day, 5C1 days a week? Do you study for the GMAT 24C1/7C1/365C1? It's wildly unnecessary to write 3C1, when we can just say 3.

Rather than try to interpret what Mr. Bunuel was thinking in each step, I just going to explain how I would think about this question.

Let's look at the 3-3 case --- it's a two color cases, and so there are 3C2 = 3 ways we can choose two colors. Given two colors --- say red and black ---- then if we choose the spaces where we put the red, the spaces for the black tiles thereby will be determined. Given six spaces, in how many ways can we choose three for the red tiles? In 6C3 = 20 ways. Total number of 3-3 case combinations = (3C2)*(6C3) = 3*20 = 60.

Now, the 4-2 case. This is very tricky. In the 3-3 case, we just had to pick two colors --- say, red and black --- and we were done ---. 3 reds and 3 blacks. Things are trickier in the 4-2 case, because if I pick my two colors --- again, say, red and black --- then I still have another choice to make: will it be 4 red and 2 blacks, or 4 blacks and 2 reds? There are 3 options on the first choice (choice of which two colors are involved) and 2 options on the second choice (which color is 4 and which one is 2). One could write that as (3C1)*(2C1), but frankly, I think that's an asinine overuse of the nCr notation. I would say: just use the Fundamental Counting Principle directly. We have three colors --- first we pick one color for the 4 tiles: that's three choices; then of the remaining two colors, we pick another for the 2 tiles: that's two choices --- total number of choices = 3*2 = 6. Then, how many ways can we place the 2 tiles in six spaces? --- 6C2 = 15. Total number of combinations = 6*15 = 90

I think that same tricky thing is the root of your question in the other cases.

In the 2-2-2 case, there's only one way we can have two of each color. We have to choose three colors, and there are only three colors from which to choose, so only 1 choice is possible. I think the monstrosity (1C1)*(1C1)*(1C1) should be taken out back and shot. Plain and simple, there's 1 way to choose all three colors. Done.

It simply doesn't make any sense, for the 2-2-2 case, to start getting into -- 3 choices for the first two tiles, and 2 choices for the second pair --- all that will be irrelevant, because of the symmetry. If we have 2 red, 2 white, and 2 black, that's identical to 2 white, 2 black, and 2 red. Remember, this part of the counting is about the colors chosen --- we would handle the distribution of the tiles on the floor in separate step. The three possible colors are equally represented, so there's only 1 way to do that.

In the 3-2-1 case, yes, we will choose three colors again, but now, unlike the 2-2-2 case, order matters. Having 3 reds, 2 blacks, and 1 white is different from having, say 3 reds, 2 whites, and 1 black. Again, I would argue that use of nCr is unnecessary, and a product of nCr's is ridiculous. Use the FCP. We have tiles of three colors, and we are going to choose for the 3-2-1 patterns. In how many ways can we choose the color that will have three tiles? Three. Given that choice, in how many ways can be pick a second color for the two tiles? Two. Once those two are determined, we have nothing else to count --- the last color must have 1 tile. So, the product of the color choices is 3*2 = 6.

Does all that make sense?

Also, I will say about this problem --- all this stuff about counting the combinations for each individual case -- I guess I see why that is belabored on this page, to give readers an iron-man workout in combinatorics, but breaking everything into cases is by far the long and awkward way to answer the overall question.

The infinitely more elegant solution, given a few times already on this page, is as follows. We have six spaces, and each one could be one of three tiles, so that's a total of 3^6 = 729 combinations. We can make every single one of those 729 patterns except three --- 6 reds, or 6 blacks, or 6 whites, are the three combinations not possible, because we have only 5 of each tile. Therefore, of the 729 possibles, we can do all except three of them. 729 - 3 = 726. That is elegant!!

In counting and combinatorics problems, there are always long and clunky ways to find the answer. The challenge, sometimes requiring considerable insight, is to find the most elegant solution. Incidentally, often that means ditching the nCr stuff and using the FCP directly.

Let me know if anyone reading this has any further questions.

Mike

thanks C 1. It'sC1 clearC1 nowC1 I am sorry Mike for overusing C's.... I really liked your post.. I cannot stop laughing...haha I didn't realize that I seriously wrote this "(1C1)*(1C1)*(1C1) " But, it's funny how mind behaves sometimes....hhaha

In the 3-2-1 case, yes, we will choose three colors again, but now, unlike the 2-2-2 case, order matters. Having 3 reds, 2 blacks, and 1 white is different from having, say 3 reds, 2 whites, and 1 black. Again, I would argue that use of nCr is unnecessary, and a product of nCr's is ridiculous. Use the FCP. We have tiles of three colors, and we are going to choose for the 3-2-1 patterns. In how many ways can we choose the color that will have three tiles? Three. Given that choice, in how many ways can be pick a second color for the two tiles? Two. Once those two are determined, we have nothing else to count --- the last color must have 1 tile. So, the product of the color choices is 3*2 = 6.

Mike, 2 questions:- (1) I was redoing the above problem. However, for 3-2-1 case, Bunuel has calculated the number of ways to choose a color = 3C1 * 3C1 instead of 3*2. Can you please comment on that?

(2) I understand that it is easier to use FCP. However, I really like Bunuel's method because it deals with the basics of combinatorics. While solving such Combinations problem, I see that you always had an eye for the order especially while solving 5-1 vs. 3-3 case. I don't think that such thoughts are mechanical. They are based on experience and real world imagination. I believe that solving above problem requires a detailed understanding of Cs and Ps + a real world imagination. The second part is the most crucial element because the only difference between 5-1 and 3-3 case is the order. ORder matters in one and not in the other. I believe that such problems cannot be solved mechanically like a robot. Correct?

In the 3-2-1 case, yes, we will choose three colors again, but now, unlike the 2-2-2 case, order matters. Having 3 reds, 2 blacks, and 1 white is different from having, say 3 reds, 2 whites, and 1 black. Again, I would argue that use of nCr is unnecessary, and a product of nCr's is ridiculous. Use the FCP. We have tiles of three colors, and we are going to choose for the 3-2-1 patterns. In how many ways can we choose the color that will have three tiles? Three. Given that choice, in how many ways can be pick a second color for the two tiles? Two. Once those two are determined, we have nothing else to count --- the last color must have 1 tile. So, the product of the color choices is 3*2 = 6.

Mike, 2 questions:- (1) I was redoing the above problem. However, for 3-2-1 case, Bunuel has calculated the number of ways to choose a color = 3C1 * 3C1 instead of 3*2. Can you please comment on that?

(2) I understand that it is easier to use FCP. However, I really like Bunuel's method because it deals with the basics of combinatorics. While solving such Combinations problem, I see that you always had an eye for the order especially while solving 5-1 vs. 3-3 case. I don't think that such thoughts are mechanical. They are based on experience and real world imagination. I believe that solving above problem requires a detailed understanding of Cs and Ps + a real world imagination. The second part is the most crucial element because the only difference between 5-1 and 3-3 case is the order. ORder matters in one and not in the other. I believe that such problems cannot be solved mechanically like a robot. Correct?

Thanks

In my solution it's "3-2-1: \(C^1_3*C^1_2*\frac{6!}{3!*2!}=360\)". _________________

Thanks Bunuel. I think that I need to get my eyes checked.

Bunuel/Mike,

I have a side question. I see why you have written 3C1 for 4-1-1 case. It makes sense from the logical standpoint. Is there any mechanical method, apart from the logical method, that could help me in arriving at 3C1? Logically, there could be only three combinations because the first color will occupy 4 tiles. The second and the third color will occupy only one position each.

However, I am a bit confused because of three different combinations for the following three sets :

2-2-2 3-2-1 4-1-1

Each of them follows a different principle for solving the problem. The first one, as per Mike, can be solved by considering Symmetry. The second one can be solved by using FCP. I am curious - did you actually visualize these problems while solving or is there any mechanical method used to solve these problems. The reason why I am asking this question is :

1) To know whether there is any mechanical method 2) I would crash if there were, say, 8 colors and 100 tiles. I wouldn't be able to imagine so many possibilities. I know that FCP is an easier way to solve this problem. But I wanted to know whether there is any mechanical procedure that could guide us to the answer, even though I used a long method.