Library / /43 of 122

, 2026

Combinatorics Difficulty 2.0 Junior Find the answer United Kingdom

There are three different routes from Exe to Wye. There are five different routes from Wye to Zed. Ahmed travels from Exe to Zed via Wye. He wants to travel back from Zed to Exe via Wye using a route that is not completely the same as the route he used from Exe to Zed. How many different routes could he use for his return trip?

(A) $5$ (B) $6$ (C) $10$ (D) $12$ (E) $14$

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; past papers published free at ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.