Hi,
I kind of got flamed on another forum for posting this. Not sure why. But, it's a game show problem I could use some help with. Hopefully you guys are nicer...
"For a gameshow, there are 9 spots to select on a board. You get to choose 3 of them in order to try to find the grand prize. How many different ways are there to select your spots?"
That is the exact wording of the problem. Does anyone have any idea how to solve that? I've been working with permutations and subsets etc., but I'm not sure how to figure this one out.
Thank you!
-matt

MENU