Let \(G\) be the answer to this problem and \(N\) be the answer to this problem.

The local sports team has \(N\) players and \(G\) uniforms. Of course, players need uniforms; in fact, \(N\) uniforms are currently being worn in today's practice. They are thus dirty, and will be sent to laundry. So the players need to pick new uniforms among the remaining \(G-N\) to be used for tomorrow's practice. How many ways are there to select the \(N\) uniforms to be used for tomorrow's practice? (Note that who wears which uniform doesn't matter, just whether a certain uniform is selected or not.)

×

Problem Loading...

Note Loading...

Set Loading...