Determine which ordered pair is a solution of y=−3x+3.
1 answer:
You might be interested in
Answer:
Team can be formed in 40040 different ways.
Step-by-step explanation:
This is a question where three important concepts are involved: <em>permutations</em>, <em>combinations</em> and the fundamental counting principle or <em>multiplication principle</em>.
One of the most important details in the problem is when it indicates that "[...]The team must have a team leader and a main presenter" and that "the other 3 members have no particularly defined roles".
This is a key factor to solve this problem because it is important the order for two (2) positions (team leader and main presenter), but no at all for the rest three (3) other positions.
By the way, notice that it is also important to take into account that <em>no repetition</em> of a team member is permitted to form the different teams requested in this kind of problem: once a member have been selected, no other team will have this member again.
The fundamental counting principle plays an interesting role here since different choices resulted from those teams will be multiplied by each other, and the result finally obtained.
We can start calculating the first part of the answer as follows:
First Part
How many teams of 2 members (team leader and main presenter) can be formed from 14 students? Here the <em>order</em> in which these teams are formed is <em>crucial</em>. There will be a team leader and a main presenter, no more, formed from 14 students.
This part of the problem can be calculated <em>using</em> <em>permutations</em>:
or
.
Since , then the answer is
.
In other words, there are 14 choices to form a team leader (or a main presenter), and then, there are 13 choices to form the main presenter (or a team leader), and finally there are 14*13 ways to form a 2-member team with a leader and a main presenter from the 14 students available.
Second Part
As can be seen, from the total 14 members, <em>2 members are out for the next calculation </em>(we have, instead, 12 students). Then, the next question follows: How many 3-member teams could be formed from the rest of the 12 members?
Notice that <em>order</em> here is meaningless, since three members are formed without any denomination, so it would be the same case as when dealing with poker hands: no matter the order of the cards in a hand of them. For example, a hand of two cards in poker would be the same when you get an <em>ace of spades and an ace of hearts</em> or an <em>ace of hearts and an ace of spades</em>.
This part of the problem can be calculated <em>using combinations</em>:
or
.
Since , then the anwer is
.
Final Result
Using the multiplication principle, the last thing to do is multiply both previous results:
How many different ways can the requested team be formed?
14*13*4*5*11 = 40040 ways.
Because of the multiplication principle, <u>the same result </u>will be obtained if we <em>instead</em> start calculating how many 3-member teams could be formed from 14 members (<em>combinations</em>) and then calculating how many 2-member team (team leader and main presenter) could be formed from the rest of the 11 team members (<em>permutations</em>).