Free Practice Question
PS · Problem Solving
605-655
Combinations
A number of tournament games is represented as G(n) where n is the number of attendees and 2 attendees play a game such that G(n+1)=G(n)+n, G(2)=1. If the number of attendees is 10, what is the total number of games?
Answer Choices
Correct answer marked belowA
20
B
25
C
30
D
40
45
Correct
See the full step-by-step explanation
You can see the correct answer above. Sign in for free to unlock the complete worked solution.
Track your performance and improve
Get detailed analytics, unlock full explanations, and move up difficulty tiers as you practice.
Explanation
Unlock the full explanation
Create a free account to reveal the correct answer, see the step-by-step explanation, and start tracking your GMAT progress.
Comments
Sign in to join the discussion
No comments yet
Be the first to share your thoughts and help others understand it better.
Sign in to commentWhat this question tests
What it tests
Whether you can count arrangements and selections correctly — permutations vs. combinations.
Common trap
Overcounting: treating a selection as ordered when order does not matter, or forgetting to divide by duplicates.
Details
Difficulty
605-655
Type
PS
Category