Let be the answer to this problem and be the answer to this problem .
The local sports team has players and uniforms. Of course, players need uniforms; in fact, 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 to be used for tomorrow's practice. How many ways are there to select the 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.)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
In these three linked problems, we are looking for the solutions of the equations 2 C + 3 C + ⋯ + G C ( N G − N ) G ≡ = = N ( m o d 1 0 ) C 6 1 C N Since N must be a single digit integer, it is easy to check that the solution to these simultaneous equations is N = 4 , C = 1 5 and G = 1 0 .