How many possible combinations are there for a 3
Two spots can be one color, combined with a second (rrb, rry, ryr.....). There are 18 combinations for this arrangement (3x3x2). Show
Finally, each spot can be a different color (rby, ryb, bry.....). There are 6 combinations for this arrangement (3x2x1).
In total, this means there are 27 different combinations. They are listed below:
rrr bbb yyy rrb bbr yyr rbr brb yry brr rbb ryy rry bby yyb ryr byb yby yrr ybb byy rby bry yrb ryb byr ybr
Hope this helps! Upvote • 1 Downvote More Report Xian V. Report 06/11/20 Desdinova N. Thank you from me too! I Google how many ways 3 colors could be combined and your answer came up!Report 09/21/22 David W. answered • 07/14/15 Tutor 4.7 (90)Experienced Prof About this tutor › About this tutor › Daniel W. and Jayden H. have written good answers, but here is a combination math-reasoning approach:
Let's start with one Letter Position which could be any of three colors (we'll use R-G-B because I've seen that with computer graphics). How many unique values could we have? --- just 3.
O.K. What about with two Letter Positions? Now, for each selection of the first letter, there are 3 options for the second letter. That's 3*3. (note: in decimal, from 00 to 99 is 10*10=100 possible values, right?).
Then, with 3 Letter Positions? 3*3*3=27 unique possibilities.
This number is small enough to enumerate the possibilities to help your understanding (like the other tutors did), but the digits^base expression (with "^" meaning exponentiation) is important. Upvote • 0 Downvote More Report Jayden H. answered • 07/14/15 Tutor 5 (1)I am patient and love helping people learn. See tutors like this See tutors like this You have three different colors, lets say red (R), green (G) and blue (B) and you choose 3 colors. The colors can repeat. The following can be mathematically represented as 33 = 27. There are 27 alphabets A-Z in English and and 10 numeric decimal digits 0-0. When pooled together, there are 37 alphanumeric characters. So, we can make #37C_3 = (37 X 36 X 35)/(3 X 2 X 1) = 7770#combinations of triples of distinct alphanumeric characters.. A combination is a selection of r items from a set of n items such that we don't care about the order of selection. Examples of CombinationsCombinations without repetitionsLet's say that we wanted to pick 2 balls out of a bag of 3 balls colored red (R), green (G) and purple (P). 123 3 different ways. Our options are: RG, RP and GP. We can count the number of combinations without repetition using the nCr formula, where n is 3 and r is 2. # combinations =n!=3!=6= 3(n-r)!r!2!*1!2We can see examples of this type of combinations when selecting teams for a sports game or for an assignment. We cannot select a team member more than once (so we can't have a team with Danny, Danny and myself) and we do not care about who is selected first to the team (so if I am in a team with Bob and Tom it is the same to me as being in a team with Tom and Bob). Combinations with repetitionsLet's say that we wanted to pick 2 balls out of a bag of 3 balls, colored red (R), green (G) and purple (P) 123 6 different ways. Our options are: RR, RG, RP, GG, GP and PP. We can count the number of combinations with repetitions mathematically by using the combinations with repetitions formula where n = 3 and r = 2. # combinations =(n+r-1)!=4!=24= 6(n-1)!r!(3-1)!2!4We can see examples of this type of combinations when buying ice cream at an ice cream store since we can select flavors more than once (I could get two, three or even four scoops of chocolate ice cream if I wished) and I don't care about which scoop goes on top (so chocolate on top and vanilla on the bottom is the same to me as vanilla on top with a chocolate base). Permutations CalculatorWhat is a permutation?A permutation is a selection of r items from a set of n items where the order we pick our items matters. Examples of permutationsPermutations without repetitionsLet's say that we wanted to pick 2 balls out of a bag of 3 balls colored red (R), green (G) and purple (P) 123 6 different ways. Our options are: RG, GR, RP, PR, GP and PG. We can show this mathematically using the permutations formula with n = 3 and r = 2 # permutations =n!=3!=3!= 6(n-r)!(3-2)!1!We can see examples of this type in real life in the results of a running race (assuming that two people can't tie for the same place) as we clearly care if we come first and our competitor comes second or if it is the other way around. Permutations with repetitionsLet's say that we wanted to pick 2 balls out of a bag of 3 balls colored red (R), green (G) and purple (P). 123 9 different ways. Our options are: RR, RG, GR, RP, PR, GG, GP, PG and PP. We can show this mathematically by using the permutations with repetitions formula with n = 3 and r = 2. We can see this in real life in the number of codes on a safe - we can repeat numbers if we want (and have a password such as 1111) and we care about the order of the numbers (so if 1234 opens the safe, 4321 will not). Explaining the combinations and permutations formulasHow many ways do we have of ordering n balls?If we have 3 balls colored red (R), green (G) and purple (P) then there are 6 different ways. We have 3 options for the first color, then 2 options for the second color and one choice for the last color. Therefore we have 3 * 2 * 1 different options or 3! For 4 balls, we have 4! different permutations available. For 5 balls we have 5! different options, etc. For n balls we have n! options. Explaining the permutations formulaHow many permutations are there for selecting 3 balls out of 5 balls without repetitions? We can select any of the 5 balls in the first pick, any of the 4 remaining in the second pick and any of the 3 remaining in the third pick. This is 5 * 4 * 3 which can be written as 5!/2! (which is n! / (n - r)! with n=5, r=3). Explaining the combinations formulaEach combination of 3 balls can represent 3! different permutations. Therefore, we can derive the combinations formula from the permutations formula by dividing the number of permutations (5! / 2!) by 3! to obtain 5! / (2! * 3!) = 10 different ways. This generalises to other combinations too and gives us the formula #combinations = n! / ((n - r)! * r!) Explaining permutations with repetitions formulaIf we again picked 3 out of 5 balls but with repetitions then we have 5 options for each selection, giving us 5 * 5 * 5 = 125 selections overall. The general formula is therefore #permutations = nr. Explaining combinations with repetitions formulaLet's see how many combinations there are for selecting 3 balls out of 5 (red (R), green (G), purple (P), turquoise (T) and yellow (Y)) with repetitions. You will notice that our trick from the normal combinations formula does not work. For example, if we look at the combination of two red balls and one green ball only has 3 possible permutations (RGG, GRG, GGR) instead of 3! = 6, since the green appears twice. Therefore we cannot just divide the number of permutations by 6! and be done. Instead we will use a nice representation to make our task easier. We can represent selections in a table so if we wanted to select 2 reds and a green ball we might note it as: R | G | P | T | Y Combinations versus permutations, what's the difference?The difference is whether we care about the order. With combinations, the order does not matter. If we had to pick a sports team then the order in which we pick players does not matter. If we do care about the order then we are choosing a permutation. If instead of a sports team we looked at the results of a running race then order becomes important. We do care if we come first and our main contender comes second or vice versa, even though these would be part of the same combination. How to use the combinations and permutations calculator?Order is important: defines whether you want to use the combinations calculator (when it's not active) or the permutations calculator (when it's active). How many combinations are there for a 3 combination lock?By comparison, this 3-dial lock (three wheels, each with digits 0-9) has 10 × 10 × 10 = 1, 000 possible combinations.
How many ways can 3 things be arranged?Therefore, the number of ways in which the 3 letters can be arranged, taken all a time, is 3! = 3*2*1 = 6 ways.
|