Last visit was: 19 Nov 2025, 04:00 It is currently 19 Nov 2025, 04:00
Close
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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
User avatar
DerekLin
Joined: 26 Nov 2023
Last visit: 27 Feb 2024
Posts: 43
Own Kudos:
1,495
 [49]
Given Kudos: 4
Posts: 43
Kudos: 1,495
 [49]
11
Kudos
Add Kudos
38
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
egmat
User avatar
e-GMAT Representative
Joined: 02 Nov 2011
Last visit: 19 Nov 2025
Posts: 5,108
Own Kudos:
32,884
 [14]
Given Kudos: 700
GMAT Date: 08-19-2020
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 5,108
Kudos: 32,884
 [14]
14
Kudos
Add Kudos
Bookmarks
Bookmark this Post
General Discussion
User avatar
chetan2u
User avatar
GMAT Expert
Joined: 02 Aug 2009
Last visit: 15 Nov 2025
Posts: 11,238
Own Kudos:
43,702
 [3]
Given Kudos: 335
Status:Math and DI Expert
Location: India
Concentration: Human Resources, General Management
GMAT Focus 1: 735 Q90 V89 DI81
Products:
Expert
Expert reply
GMAT Focus 1: 735 Q90 V89 DI81
Posts: 11,238
Kudos: 43,702
 [3]
2
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
User avatar
JoeKan1234
Joined: 27 Aug 2022
Last visit: 23 Dec 2024
Posts: 65
Own Kudos:
Given Kudos: 147
Posts: 65
Kudos: 42
Kudos
Add Kudos
Bookmarks
Bookmark this Post
"Assume that each player always selects the available ordered pair for which his or her preference number is greatest."

Angelica takes the first turn. The largest possible pair is (4,4)

In the second turn, the largest pair to Basil is (1,3)

In the third turn, the largest pair to Angelica is (3,2)

In the final turn, the largest pair to Basil is (2,1)

So Angelica's score is 4+3=7
Basil's score is 3+1=4
User avatar
Vinit800HBS
Joined: 29 Dec 2018
Last visit: 18 Nov 2025
Posts: 91
Own Kudos:
237
 [2]
Given Kudos: 195
Location: India
GRE 1: Q170 V163
Expert
Expert reply
GRE 1: Q170 V163
Posts: 91
Kudos: 237
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
 
DerekLin
­Angelica and Basil are playing a game with the set of ordered pairs







\(S = {(1, 3), (2, 1), (3, 2), (4, 4)}\).
In each ordered pair, the first number is Angelica's preference number for that pair, and the second number is Basil's preference number for that pair. Angelica takes the first turn and removes an ordered pair from set S. Basil takes the second turn and removes an ordered pair from among those remaining from set S. T

Assume that each player always selects the available ordered pair for which his or her preference number is greatest. 
Given Ordered Pairs:
Angelica's preferences are in Red and Basil's preferences are in Blue.

S = {(13), (2,  1), (3, 2), (4,  4)}

Angelica's turn: She removes (4,  4). Her score is 4 right now.

Available Ordered Pairs: ­S = {(13), (2,  1), (3, 2)}.

Basil's turn: She removes (13). Her score is 3 right now.

Available Ordered Pairs: ­S = {(2,  1), (3, 2)}.

Angelica's turn: She removes (3,  2). Her score is 4+3 = 7 now.

Available Ordered Pairs: S = {(2,  1)}.

Basil's turn: She removes (21). Her score is  3  +   14 now.
 ­
User avatar
__thisisjay
Joined: 23 Jan 2024
Last visit: 28 Mar 2025
Posts: 7
Own Kudos:
Given Kudos: 23
Posts: 7
Kudos: 1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
It is easy to solve find the best answer so math just logical thinking


PAIR ARE FOR Angelica - { 1, 2, 3, 4}
PAIR ARE FOR Basil ------{ 3, 1 , 2, 4}


First turn A choose highest value - {4} that also remove { 4} for B
than B chose remaining pair for B

PAIR ARE FOR Angelica - { 1, 2, 3}
PAIR ARE FOR Basil ------{ 3, 1 , 2}

First turn B choses the best pair - {3} that rule out {1} for A

PAIR ARE FOR Angelica - { 2, 3}
PAIR ARE FOR Basil ------{ 1 , 2}

than A choses
PAIR ARE FOR Angelica - { 2, 3}
PAIR ARE FOR Basil ------{ 1 , 2}

best pair - A - { 3} that remove { 2} for B
Total A get - 4 + 3 = 7
PAIR ARE FOR Angelica - { 2,}
PAIR ARE FOR Basil ------{ 1 }

and B left with = 3 + 1 = 4
User avatar
GMAT745owner
Joined: 16 Oct 2024
Last visit: 21 Jul 2025
Posts: 18
Own Kudos:
Given Kudos: 769
Posts: 18
Kudos: 11
Kudos
Add Kudos
Bookmarks
Bookmark this Post
this one is much easier than the others
User avatar
MartyMurray
Joined: 11 Aug 2023
Last visit: 18 Nov 2025
Posts: 1,630
Own Kudos:
6,120
 [1]
Given Kudos: 173
GMAT 1: 800 Q51 V51
Expert
Expert reply
GMAT 1: 800 Q51 V51
Posts: 1,630
Kudos: 6,120
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
­Angelica and Basil are playing a game with the set of ordered pairs \(S = {(1, 3), (2, 1), (3, 2), (4, 4)}\).

In each ordered pair, the first number is Angelica's preference number for that pair, and the second number is Basil's preference number for that pair. Angelica takes the first turn and removes an ordered pair from set S. Basil takes the second turn and removes an ordered pair from among those remaining from set S. They continue taking turns until all the ordered pairs have been removed, at which time the game is over. Each player's final score is equal to the sum of that player's preference numbers for the ordered pairs he or she has removed.

Assume that each player always selects the available ordered pair for which his or her preference number is greatest. In the table, select a value for Angelica's final score and a value for Basil's final score that are jointly consistent with this assumption and the given information. Make only two selections, one in each column.­


Getting a question like this one correct doesn't take a lot of thinking. So, even though, in a way, it's not an easy question, a question like this one can be a little bit of a break from the intensity of the DI section.

To get a question like this one correct, we have to understand the outlined procedure, keep things straight, and execute precisely.

Key Aspects of the Procedure

From the passage:

In each ordered pair, the first number is Angelica's preference number for that pair, and the second number is Basil's preference number for that pair.

Angelica takes the first turn, and Basil takes the second turn.

Each player's final score is equal to the sum of that player's preference numbers for the ordered pairs he or she has removed.


From the question stem:

Each player always selects the available ordered pair for which his or her preference number is greatest.

Executing the Procedure

(1, 3), (2, 1), (3, 2), (4, 4)

Angelica - (1, 3), (2, 1), (3, 2), (4, 4)

Basil - (1, 3), (2, 1), (3, 2)

Angelica - (2, 1), (3, 2)

Basil - (2, 1)

Angelica's total: 4 + 3 = 7

Basil's total: 3 + 1 = 4

Correct answer: 7, 4
User avatar
ManishaPrepMinds
Joined: 14 Apr 2020
Last visit: 17 Nov 2025
Posts: 139
Own Kudos:
Given Kudos: 10
Location: India
Expert
Expert reply
Posts: 139
Kudos: 123
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Since Angelica goes first and both players play optimally:

Turn 1 (Angelica): She will take (4,4) [her highest preference = 4]

Turn 2 (Basil): From remaining {(1,3), (2,1), (3,2)}, he takes (1,3) [his highest = 3]

Turn 3 (Angelica): From remaining {(2,1), (3,2)}, she takes (3,2) [her highest = 3]

Turn 4 (Basil): Takes (2,1) [only remaining, his preference = 1]

Final scores: Angelica = 4+3 = 7, Basil = 3+1 = 4
Answer: Angelica = 7, Basil = 4

DerekLin
­Angelica and Basil are playing a game with the set of ordered pairs
\(S = {(1, 3), (2, 1), (3, 2), (4, 4)}\).
In each ordered pair, the first number is Angelica's preference number for that pair, and the second number is Basil's preference number for that pair. Angelica takes the first turn and removes an ordered pair from set S. Basil takes the second turn and removes an ordered pair from among those remaining from set S. They continue taking turns until all the ordered pairs have been removed, at which time the game is over. Each player's final score is equal to the sum of that player's preference numbers for the ordered pairs he or she has removed.

Assume that each player always selects the available ordered pair for which his or her preference number is greatest. In the table, select a value for Angelica's final score and a value for Basil's final score that are jointly consistent with this assumption and the given information. Make only two selections, one in each column.­
Moderators:
Math Expert
105379 posts
496 posts