Events & Promotions
|
|
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
26 May 2017, 04:44
Kudos
Bookmarks
The number of tournament games is represented as \(G(n)\) where n is the number of attendees of the games. 2 attendees play a game such that \(G(n+1) = G(n)+n, G(2) = 1\). If the attendees' number is 30, what is the total number of games?
A. 380
B. 435
C. 455
D. 510
E. 520
A. 380
B. 435
C. 455
D. 510
E. 520
26 May 2017, 04:46
Kudos
Bookmarks
Official Solution:
The number of tournament games is represented as \(G(n)\) where n is the number of attendees of the games. 2 attendees play a game such that \(G(n+1) = G(n)+n, G(2) = 1\). If the attendees' number is 30, what is the total number of games?
A. 380
B. 435
C. 455
D. 510
E. 520
If you directly substitute the numbers, you get from \(n = 2, G(2+1) = G(2) + 2 = 1 + 2 = 3\) to \(G(3) = 3\), and from \(n=3, G(3+1) = G(3) + 3 = 3 + 3 = 6\) to \(G(4) = 6\). It means that the hypothesis yields the actual result, \(G(n) = _{n}C_{2}\) (combination). Therefore, if \(n = 30, G(30) = _{30}C_{2} = \frac{(30)(29)}{2!} = (15)(29) = 435\). Therefore, the answer is B.
Answer: B
The number of tournament games is represented as \(G(n)\) where n is the number of attendees of the games. 2 attendees play a game such that \(G(n+1) = G(n)+n, G(2) = 1\). If the attendees' number is 30, what is the total number of games?
A. 380
B. 435
C. 455
D. 510
E. 520
If you directly substitute the numbers, you get from \(n = 2, G(2+1) = G(2) + 2 = 1 + 2 = 3\) to \(G(3) = 3\), and from \(n=3, G(3+1) = G(3) + 3 = 3 + 3 = 6\) to \(G(4) = 6\). It means that the hypothesis yields the actual result, \(G(n) = _{n}C_{2}\) (combination). Therefore, if \(n = 30, G(30) = _{30}C_{2} = \frac{(30)(29)}{2!} = (15)(29) = 435\). Therefore, the answer is B.
Answer: B
Moderator:
