A cross-country runner trains by running
three predetermined routes every day.
Each day, her total distance travelled is 10 miles.
She does not run any of the routes more than two days in a row and never avoids a route two days in a row.
Based on the above info, we will have to pick 3 routes in such a way that her total distance travelled is 10 miles.
Let's call Route 1 as R1, Route 2 as R2 and .... Route 5 as R5.
Let's look at how to lay down the routes for each day keeping the constraints in mind.
Day1 R1 R2 R4 (sum is 10 miles)
Day2 R2 R3 R5 (sum is 10 miles, not avoiding any route)
Day3 R1 R3 R4 (sum is 10 miles, not avoiding any route and not running a route more than two days)
This is good as we meet all the constraints.
From the below info, let's calculate the number of times the runner will run towards the
City Centre over the span of above 3-day period.
Route 1: City Centre – Market Square – Songbird Park – City Centre (3 miles)
Route 2: City Centre – Laurel Lane – Market Square – City Centre (3 miles)
Route 3: City Centre – City Hall – Laurel Lane – City Centre (3 miles)
Route 4: City Centre – City Hall – Market Square – Laurel Lane – City Centre (4 miles)
Route 5: City Centre – Songbird Park – Market Square – Laurel Lane – City Centre (4 miles)
Counting the number of times the runner will run towards the
City Centre over the span of above 3-day period, we get
Day1 3
Day2 3
Day3 3
Now, let's count the number of times the runner will run towards the
Laurel Lane over the span of above 3-day period
Day1 2
Day2 3
Day3 2
Therefore, the answer choices for City Centre and Laurel Lane are 9 and 7 respectively.