Library / UKMT Junior Mathematical Challenge /212 of 274

UKMT Junior Mathematical Challenge, 2019

Combinatorics Difficulty 2.0 Junior Find the answer United Kingdom

Each edge in the diagram has length $1\text{ cm}$ . What is the length of the longest path that can be followed along the edges, starting at a vertex and without revisiting any vertex?

(A) $7\text{ cm}$ (B) $8\text{ cm}$ (C) $9\text{ cm}$ (D) $10\text{ cm}$ (E) $11\text{ cm}$

Figure for this problem

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

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.