Answered

Get the answers you need at Westonci.ca, where our expert community is always ready to help with accurate information. Discover comprehensive answers to your questions from knowledgeable professionals on our user-friendly platform. Get immediate and reliable solutions to your questions from a community of experienced professionals on our platform.

You have enough tickets to play 6 different gamesat the amusement park. If there are 14 games,how many ways can you choose six ?1111How many different ways can 9 trumpet playersin the marching band line up?+---1-Seven students worked together on a project.How many ways can their teacher choose four topresent the project?+-There are 18 offensive players on the hockeyteam. How many ways can the coach choose a ||left wing, center, and right wing to start the game,1-11How many different 12-letter arrangements canbe made using the letters in the wordINDIANAPOLIS+1There are 26 gold fish in the tank at the store. Howmany ways can Ben choose five?C.11

Sagot :

the This problem uses permutation and combination. The formula to find the permutation is

[tex]P(n,r)=\frac{n!}{(n-r)!}[/tex]

while the formula to find the combination is

[tex]C(n,r)=\frac{n!}{r!(n-r)!}[/tex]

We need to know what type of problem the given is so that we can choose what equations we will be using on the equation above.

7. This problem is a combination problem since we want to know the total combinations of games that are possible for n = 14 and you have r = 6. The total combination is

[tex]C(n,r)_{}=\frac{14!}{6!(14-6)!}=3003[/tex]

Hence, there are 3003 ways you can choose six games.

8. We want to know how many ways a trumpet player can be arranged in a marching band lineup. We have n = 0 while our r here is also equal to 9 because we are arranging all the trumpet players in a different manner. Hence, using the permutation equation, we have

[tex]P(n,r)=\frac{9!}{(9-9)!_{}}=362880[/tex]

Hence, they can be arranged 362880 times.

9. This problem is a combination problem since we want to know how many possible arrangements can be done if a group that composed of n = 7, we arranged r = 4. Hence, using a combination equation, we have

[tex]C(n,r)_{}=\frac{7!}{4!(7-4)!}=35[/tex]

Hence, they can be arranged in 35 ways.

10. Since we are dealing with arrangements, this is a permutation problem. We have n = 18 and we will arrange them in r = 3 ways. Hence, the total number of permutations possible is

[tex]P(n,r)=\frac{18!}{(18-3)!_{}}=4896[/tex]

Hence, they can be arranged in 4896 ways.

11. There are 12 letters present in the word INDIANAPOLIS. Since there are repetitions of letters, we will consider those. We have 3 I's, 2 A's, 2 N's. The possible permutation for the distinct arrangement of letters for INDIANAPOLIS can be computed as

[tex]P(n,r)=\frac{12!}{(3!)(2!)(2!)}=19958400_{}[/tex]

The word INDIANAPOLIS can be arranged 19958400 without repetition of letters in the same placement.

12. This problem is a combination problem. We have n = 26 goldfishes and Ben wants to choose r = 5. Using the combination equation, we have

[tex]undefined[/tex]

Thank you for choosing our service. We're dedicated to providing the best answers for all your questions. Visit us again. Thank you for your visit. We're dedicated to helping you find the information you need, whenever you need it. Westonci.ca is your trusted source for answers. Visit us again to find more information on diverse topics.