GRE Prep 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.
Retired Moderator
Joined: 16 Apr 2020
Status:Founder & Quant Trainer
Affiliations: Prepster Education
Posts: 1546
Given Kudos: 172
Location: India
WE:Education (Education)
A coach arranged 6 players, each with different height in two parallel
[#permalink]
12 Sep 2021, 21:31
12 Sep 2021, 21:31
2
11
Bookmarks
00:00
Question Stats:
53% (01:46) correct
46% (01:46) wrong based on 43 sessions
Hide Show timer Statistics
A coach arranged 6 players, each with different height in two parallel rows of three players each. Heights of the player within each row increase from left to right, and each player in the second row must be taller than the person standing in front of him or her.
A. Quantity A is greater
B. Quantity B is greater
C. The two quantities are equal
D. The relationship cannot be determined from the information given
Quantity A |
Quantity B |
Total number of possible arrangements |
6 |
A. Quantity A is greater
B. Quantity B is greater
C. The two quantities are equal
D. The relationship cannot be determined from the information given
Re: A coach arranged 6 players, each with different height in two parallel
[#permalink]
13 Sep 2021, 03:21
13 Sep 2021, 03:21
C?
Posted from my mobile device
Posted from my mobile device
A coach arranged 6 players, each with different height in two parallel
[#permalink]
13 Sep 2021, 10:24
13 Sep 2021, 10:24
2
Very cool question!
For this one, I would start by numbering the players 1-6 respectively.
1 2 3
4 5 6
How many times can we permute this matrix within the constraints?
Before we start, it's important to note that player 1 and player 6 can never move positions, otherwise, the left-to-right constraint will be violated.
So we begin by assessing how we can create the top row.
We have:
1 2 3
or
1 2 4
or
1 2 5
or
1 3 4
or
1 3 5
You'll see that the bottom row fills itself in each example.
The question now becomes, can we create any more top rows?
For example, can we create 1 4 5?
The answer is no, because the only numbers greater than 4 are 5 and 6, and 5 is already in the top row and remember, 6 cannot move from that bottom row spot.
Therefore, the maximum number of arrangements is 5, so the answer is B
For this one, I would start by numbering the players 1-6 respectively.
1 2 3
4 5 6
How many times can we permute this matrix within the constraints?
Before we start, it's important to note that player 1 and player 6 can never move positions, otherwise, the left-to-right constraint will be violated.
So we begin by assessing how we can create the top row.
We have:
1 2 3
or
1 2 4
or
1 2 5
or
1 3 4
or
1 3 5
You'll see that the bottom row fills itself in each example.
The question now becomes, can we create any more top rows?
For example, can we create 1 4 5?
The answer is no, because the only numbers greater than 4 are 5 and 6, and 5 is already in the top row and remember, 6 cannot move from that bottom row spot.
Therefore, the maximum number of arrangements is 5, so the answer is B
