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.
Jun 0808:00 PM EDT
-10:00 PM EDT
Master the GMAT with expert live instruction, a personalized study plan, and real-time support. Includes 40 hours of online classes plus 6 months of access to the TTP GMAT OnDemand video course. Mon/Wed June 8, 2026 →August 12, 2026 8:00pm-10:00pm EST
Jun 1006:00 AM PDT
-06:15 PM PDT
Register for the GMAT Club Virtual MBA Spotlight Fair – the world’s premier event for serious MBA candidates. This is your chance to hear directly from Admissions Directors at nearly every Top 30 MBA program..- Jun 10
10:00 AM PDT
-11:00 AM PDT
Scoring 715 on the GMAT Focus Edition requires more than just learning formulas, memorizing concepts, or solving hundreds of questions. In this episode, Nishant shares how he improved his GMAT preparation by focusing on application of concepts, and more. 
Jun 1111:00 AM EDT
-01:00 PM EDT
TTP GMAT OnDemand gives serious students 400+ hours of expert video instruction, the full TTP course, AI support, weekly office hours, and a 715+ score guarantee—all built for elite GMAT score improvement.
13 Sep 2022, 08:48
Kudos
Bookmarks
D
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
45%
(medium)
Question Stats:
67% (01:37) correct
33%
(01:41)
wrong
based on 661
sessions
History
Date
Time
Result
Not Attempted Yet
Six kids will be lined up from left to right. Boys may not be at either end (the first and last spot). In how many ways can the kids be lined up?
(1) There are 4 girls
(2) There are 12 different ways to fill the first and last spot
(1) There are 4 girls
(2) There are 12 different ways to fill the first and last spot
13 Sep 2022, 11:28
Kudos
Bookmarks
Six kids will be lined up from left to right. Boys may not be at either end (the first and last spot). In how many ways can the kids be lined up?
(1) There are 4 girls
=> 4 Girls and 2 Boys
First considering the constraints i.e., spots occupied by boys.
First boy can occupy any of 4 spots and second boy can occupy any of the 3 spots. Total number of ways in which Boys can be arranged = 4*3 = 12
4 girls can be arranged in remaining 4 spots in 4! ways.
Therefore total number of ways in which Kids can be lined up = 4!*12
Statement 1 alone is sufficient.
(2) There are 12 different ways to fill the first and last spot
=> Let there be G girls. The first and last spot can be occupied only by two of these Girls.
For the first spot we have G different girls. Then, for the last spot we have (G-1) different girls.
Total number of ways in which the first and last spots can be filled = G(G-1)
=> G(G-1) = 4*3 = 12
=> G=4
This information is same as Statement 1. Hence sufficient.
Answer: D
(1) There are 4 girls
=> 4 Girls and 2 Boys
First considering the constraints i.e., spots occupied by boys.
First boy can occupy any of 4 spots and second boy can occupy any of the 3 spots. Total number of ways in which Boys can be arranged = 4*3 = 12
4 girls can be arranged in remaining 4 spots in 4! ways.
Therefore total number of ways in which Kids can be lined up = 4!*12
Statement 1 alone is sufficient.
(2) There are 12 different ways to fill the first and last spot
=> Let there be G girls. The first and last spot can be occupied only by two of these Girls.
For the first spot we have G different girls. Then, for the last spot we have (G-1) different girls.
Total number of ways in which the first and last spots can be filled = G(G-1)
=> G(G-1) = 4*3 = 12
=> G=4
This information is same as Statement 1. Hence sufficient.
Answer: D
General Discussion
25 Nov 2025, 08:07
Kudos
Bookmarks
Hi Bunuel, I was facing confusion with the wording 'may not'. This is not confirmative that boys will not be there at either ends.
