Question 1193292
<font color=black size=3>
Label the two teams as A and B.


Imagine we have 13 slots to represent the players. Each slot will be labeled either A or B.


Since we have 13 slots, and two choices per slot, this gives 2^13 = 8192 different ways to assign each player to a certain team. You can think of each slot like a binary light switch that turns on or off (for team A or team B).


If we require that each team needs 1 or more players, then we'd have to eliminate these cases:<ul><li>Everyone going to team A (since team B wouldn't have anyone)</li><li>Everyone going to team B (since team A wouldn't have anyone)</li></ul>That means we've eliminated 2 cases to drop the count to 8192-2 = 8190


As you can see, there isn't a need to involve the nCr combination formula. 
Though as the other tutor @greenestamps indirectly pointed out, summing all the terms along any row of Pascal's Triangle will yield a power of 2. Terms inside the triangle are directly connected to the nCr combination formula.


Answer: 8190
</font>