Last visit was: 11 Jun 2024, 23:50 It is currently 11 Jun 2024, 23:50
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
Tags:
Difficulty: 655-705 Level,    Tables,                
Show Tags
Hide Tags
Manager
Manager
Joined: 03 Jun 2019
Posts: 97
Own Kudos [?]: 10014 [32]
Given Kudos: 38
Most Helpful Reply
GRE Forum Moderator
Joined: 02 Nov 2016
Posts: 14010
Own Kudos [?]: 34907 [4]
Given Kudos: 5816
GPA: 3.62
Send PM
General Discussion
Manager
Manager
Joined: 11 May 2019
Posts: 168
Own Kudos [?]: 115 [1]
Given Kudos: 298
Send PM
Senior Manager
Senior Manager
Joined: 15 Jul 2018
Posts: 348
Own Kudos [?]: 438 [1]
Given Kudos: 94
Send PM
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
1
Kudos
So here we can try the permutations and combinations on our own to see how the path is formed

We have to always follow the logic :

John schedules each subsequent meeting according to which client is the least distance from the meeting immediately prior to it.

So here first John goes to E

Now from E ,then from E the closest client is A with a distance of 2,so John will go to A,next from the closest point is F with a distance of 1,so John will go to client F,

Now from F,again the closest is A,but he already met A,so the next closest in the list is B with a distance of 4 ,so from F John will go to B

Now from B,the closest is C with a distance of 2,so John will go to C

Now from C,the closest is B,but John has already met B,so he will go to D(at a distance of 3 from C),so John will go to D.

Now from D,John will not go to A,since he already met A.

So the answers are Yes,Yes,No

Originally posted by Apt0810 on 19 May 2020, 09:30.
Last edited by Apt0810 on 21 May 2020, 08:00, edited 2 times in total.
Retired Moderator
Joined: 05 May 2016
Posts: 782
Own Kudos [?]: 690 [0]
Given Kudos: 1316
Location: India
Send PM
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
Hi SajjadAhmad, could you share the official explanation, I am not able to come to Yes for the second one.

thanks.
Director
Director
Joined: 01 Mar 2015
Posts: 534
Own Kudos [?]: 370 [2]
Given Kudos: 762
Location: India
GMAT 1: 740 Q47 V44
Send PM
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
2
Kudos
First E, so we have E-2-3-4-5-6

Check E's row (or column). A is closest.
So we have E-A-3-4-5-6

Check A's row. Ignore E-A.
F is closest. So we have E-A-F-4-5-6

Check F's row. Exclude E-A-F.
B is closest. So we have E-A-F-B-5-6

Check B's row. Exclude E-A-F-B.
C Is closest. So Jorge's full schedule is E-A-F-B-C-D.

Now check the answer choices
Client B then Client C - Yes
Client C then Client D - Yes
Client D then Client A - No

Posted from my mobile device
Manager
Manager
Joined: 13 Dec 2023
Status:Applying in R1 of 2024 to t15
Affiliations: University of Tennessee
Posts: 134
Own Kudos [?]: 140 [0]
Given Kudos: 48
Location: United States (CO)
Concentration: Strategy, Finance
GMAT Focus 1:
605 Q76 V84 DI80
GMAT Focus 2:
615 Q78 V86 DI78
GPA: 3.62
WE:Analyst (Consumer Products)
Send PM
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
­For part 2, 18 miles is farther away than 12 miles? Therefore it should be D then C, no??
Attachments

11.PNG
11.PNG [ 68.53 KiB | Viewed 5073 times ]

RC & DI Moderator
Joined: 02 Aug 2009
Status:Math and DI Expert
Posts: 11415
Own Kudos [?]: 33394 [0]
Given Kudos: 317
Send PM
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
Expert Reply
Fish181

You are going wrong in measuring distances. The distances has to be measured from the last client visited.

So we start with E.
1. Scan for all the distances to the remaining clients from E. Closest is A, 2 km away.
2. From A, scan the distances to the remaining clients less E from A. Closest is F, 1 km away.
3. Now, he is with F and the closest is B, 2 km away.
4. From B, C is 3 km away
5. Finally, D is 3 km from C.

Thus, the clients visited are E-2-A-1-F-4-B-2-C-3-D.
# Client B then Client C - Yes
# Client C then Client D - Yes
# Client D then Client A - No

On a lighter and logical note, B to D is 15 km while B-C-D is just 5 km. Why would someone call B-D as direct route when a route one-third the length is available.
Manager
Manager
Joined: 19 Dec 2021
Posts: 185
Own Kudos [?]: 56 [0]
Given Kudos: 17
Location: Viet Nam
GPA: 3.55
Send PM
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
­Most urgent: E

1. Sort by E => A is closest

2. Sort by A => F is closest

3. Sort by F => B is closest (since already met A)

4. Sort by B => C is closest

5. Last is D


1. Client B then Client C => Yes

2. Client C then Client D => Yes

3. Client D then Client A => No
Intern
Intern
Joined: 22 Jan 2024
Posts: 2
Own Kudos [?]: 0 [0]
Given Kudos: 11
Location: United States
Send PM
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
Sajjad1994 wrote:
bm2201 wrote:
Hi SajjadAhmad, could you share the official explanation, I am not able to come to Yes for the second one.

thanks.

Official Explanation

The information provided indicates that Jorge’s first meeting (his most urgent of the day) will be with Client E and that he will schedule meetings with each other client in order based on proximity to the previous meeting. From Client E, the closest client is Client A (2 km). From Client A, the closest client is Client F (1 km). From Client F, the closest client is Client A, but that meeting would be scheduled to take place immediately after the meeting with Client E, so among the remaining clients, Client B is closest to Client F (4 km). From Client B, the closest remaining client is Client C (2 km). After Client C, only Client D remains, so the client meetings would be scheduled in the following order: E, A, F, B, C, D. Therefore, Jorge will schedule the meeting with Client B to be immediately before that with Client C.

The correct answer is Yes.

Based on the explanation above, the meeting with Client C would be scheduled to immediately precede the meeting with Client D.

The correct answer is Yes.

Based on the explanation above, the meeting with Client A would be scheduled to be the second of the day and the meeting with Client D would be scheduled to be the last among the six.

The correct answer is No.

­
GMAT Club Bot
Re: Jorge travels to meet once daily with exactly six clients, Clients A [#permalink]
Moderators:
Math Expert
93670 posts
DI Forum Moderator
1000 posts
RC & DI Moderator
11415 posts