Solution
The route is .
A ticket may be booked only from an earlier station to a later station, and it occupies a seat on every segment it spans.
We track the number of tickets for each origin–destination (OD) pair.
Main table: rows are the origin, columns are the destination. Cells where the destination is not ahead of the origin are marked .
| From \ To | B | C | D | E |
|---|---|---|---|---|
| A | ||||
| B | ||||
| C | ||||
| D |
A second table tracks the seats reserved on each segment (capacity ) and its occupancy factor.
| Segment | Reserved | Occupancy |
|---|---|---|
| A–B | ||
| B–C | ||
| C–D | ||
| D–E |
Which tickets load each segment:
A–B:
B–C:
C–D:
D–E:
Goal: fill every OD cell.
| From \ To | B | C | D | E |
|---|---|---|---|---|
| A | 0 | |||
| B | 40 | 0 | 30 | |
| C | ||||
| D | 0 |
| Segment | Reserved | Occupancy |
|---|---|---|
| A–B | ||
| B–C | ||
| C–D | ||
| D–E |
From clue (5): no tickets , , , so those three cells are .
From clue (2):
| From \ To | B | C | D | E |
|---|---|---|---|---|
| A | 0 | |||
| B | 40 | 0 | 30 | |
| C | ||||
| D | 0 |
| Segment | Reserved | Occupancy |
|---|---|---|
| A–B | ||
| B–C | 200 | 100% |
| C–D | 190 | 95% |
| D–E |
From clue (1), C–D has occupancy :
B–C is the only segment higher than C–D, so it is the maximum.
Every OD count is a multiple of , so each segment load is a multiple of , and cannot exceed .
The only multiple of above is .
| From \ To | B | C | D | E |
|---|---|---|---|---|
| A | 0 | |||
| B | 40 | 0 | 30 | |
| C | ||||
| D | 0 |
| Segment | Reserved | Occupancy |
|---|---|---|
| A–B | 130 | 65% |
| B–C | 200 | 100% |
| C–D | 190 | 95% |
| D–E |
The B–C load gives:
Since , the A–B load is:
Occupancy .
From clue (4): and .
So with (as ).
| From \ To | B | C | D | E |
|---|---|---|---|---|
| A | 0 | 50 | 30 | 50 |
| B | 40 | 0 | 30 | |
| C | ||||
| D | 0 |
| Segment | Reserved | Occupancy |
|---|---|---|
| A–B | 130 | 65% |
| B–C | 200 | 100% |
| C–D | 190 | 95% |
| D–E |
Candidates from :
From clue (3), on D–E the seats from stations before C (that is A and B) are of the total, leaving from C.
Before-C seats , and from-C seats .
So , i.e. .
Testing:
(not a multiple of ) — reject
— valid
— reject
So , , .
| From \ To | B | C | D | E |
|---|---|---|---|---|
| A | 0 | 50 | 30 | 50 |
| B | 40 | 0 | 30 | |
| C | 60 | |||
| D | 0 |
| Segment | Reserved | Occupancy |
|---|---|---|
| A–B | 130 | 65% |
| B–C | 200 | 100% |
| C–D | 190 | 95% |
| D–E | 140 | 70% |
From the previous slide, .
The D–E load is:
Occupancy .
Verify clue (3): before-C seats , and . This matches.
| From \ To | B | C | D | E |
|---|---|---|---|---|
| A | 0 | 50 | 30 | 50 |
| B | 40 | 0 | 30 | |
| C | 20 | 60 | ||
| D | 0 |
| Segment | Reserved | Occupancy |
|---|---|---|
| A–B | 130 | 65% |
| B–C | 200 | 100% |
| C–D | 190 | 95% |
| D–E | 140 | 70% |
The C–D load gives:
All OD values are now uniquely determined.
Occupancy order: B–C > C–D > D–E > A–B , so only B–C exceeds C–D, consistent with clue (1).
From the solved table, .
This was fixed because , , and the value is the only candidate making a valid multiple of .
Tickets from A to E .
More from this set:
Question 11