Shortcut for pattern to ensure all cases are covered :This is the pattern to notice immediately:
* B flights are every 20 min
* C flights are every 60 min
And:
60 is a multiple of 20.
That means:
Every time you delay your B departure by 20 min, your arrival at C also shifts by exactly 20 min within the same repeating 60-minute cycle.
So:
* waiting at B increases by 20
* waiting at C decreases by 20
→ total waiting stays the same.
Mental shortcut:
If:
* one schedule repeats every `a` minutes
* another repeats every multiple of `a`
then delaying by `a` minutes simply redistributes waiting time.
You are not changing total waiting.
In this problem:
At B, your choices differ by:
20-minute chunks
That shifts arrival at C by:
20-minute chunks
Since C departures repeat every 60 min (= 3 chunks of 20),
all you are doing is moving waiting time between B and C.
Total waiting remains constant.
So once one valid route gives:
10 + 55 = 65 minutes
you already know every other route also gives 65 minutes.
Solution :The real GMAT concern is:
> “How do I KNOW another flight choice won’t reduce the total waiting time?”
Here’s the clean pattern logic.
---
STEP 1: Notice repeating schedules
* Flights from A leave every 60 min
* Flights from B leave every 20 min
Since 60 is a multiple of 20:
Every time you shift the starting flight from A by 1 hour, everything downstream shifts by exactly 1 hour too.
So the waiting pattern repeats identically.
---
STEP 2: Focus only on clock endings
A → B travel time = 2 hr 30 min
A flights:
* 8:00 → 10:30
* 9:00 → 11:30
* 10:00 → 12:30
Notice:
You ALWAYS arrive at B at :30.
---
STEP 3: Next available B flight
B flights leave every 20 min:
* :00
* :20
* :40
If you arrive at :30, the next flight is always :40.
Examples:
* 10:30 → 10:40
* 11:30 → 11:40
* 12:30 → 12:40
So:
* waiting at B is ALWAYS 10 min
* departure from B is ALWAYS at :40
---
STEP 4: Arrival pattern at C
B → C travel time = 1 hr 10 min
Starting from :40:
* :40 + 1:10 = :50
Examples:
* 10:40 → 11:50
* 11:40 → 12:50
* 12:40 → 1:50
So you ALWAYS arrive at C at :50.
---
STEP 5: Waiting at C
Flights from C leave every hour at :45.
If you arrive at :50, you just missed the :45 flight.
Example:
* arrive 11:50
* next flight 12:45
So waiting at C is ALWAYS:
55 min.
---
Total waiting:
* B wait = 10 min
* C wait = 55 min
Total:
65 min = 1 hr 5 min
---
What if you intentionally skip a B flight?
Example:
* instead of taking :40, take :00
Then:
* B wait increases by 20 min
* but C wait decreases by 20 min
Why?
Because:
* B flights repeat every 20 min
* C flights repeat every 60 min (= 3 chunks of 20)
So delaying by 20 minutes simply redistributes waiting time between B and C.
The total waiting time never changes.
That is why solving ONE valid path is enough to prove the minimum total is always:
65 minutes.