Olympic Tracing Challenge

Can you trace this entire figure?

Things to keep in mind while tracing:

1 ) 1) No picking up your writing or tracing tool.

2 ) 2) No doubling back along a line already traced.

Bonus :

  • If it's impossible, can you prove why?
  • If it's possible, how many different ways there to accomplish the tracing if you must start at one of the intersection points?
Yes, I can No, it's impossible

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Zandra Vinegar Staff
Nov 26, 2015

This is one of my favorite tracing puzzles because most people fail the first time they try to trace (I've even seen some mathematicians fail when they first try to trace it out, even though they are certain that it's possible theoretically! :D).

So, yes, it's a trap. ;-) It's easy to get stuck thinking about the figure as a collection of overlapping circles, the 5 Olympic rings in particular. They're usually colored like this:

When you think about the rings this way, it's easy to get stuck when tracing, tempted by a natural desire to finish an entire ring before moving on to the next part of the design. However, given a different perspective on the same figure, as colored below, here is a simple tracing strategy:
(1) Start anywhere on the black curve.
(2) Trace along the black curve until you hit a colored leaf, as soon as you do, take a break from black and trace that entire colored leaf (both sides). In doing so, you'll return to where you paused on the black curve and can continue to on to the next leaf and so on. Continue until you return to where you started on the black curve.

If you think about this figure colored as it's colored above, it becomes far easier to trace the figure & also to further study the puzzle in more depth mathematically. For example, after you've found your own path for tracing this figure, can you figure out how many different ways there actually are to accomplish the tracing if you must start at one of the 8 intersection points?

I guess there is 4 * (2!) * 5 * 3 = 120 different ways, but i am not sure. there are 4 "colored edges", and 2! ways to trace each one of them, each colored way takes two steps, so you have 3 options to travel from one colored trace to another -or to trace the black edges- (before tracing or after each of the two steps), and you have to travel from the colored edges 5 times since there are four pairs of colored edges and two additional black edges (I assumed that those two additional black edges at the sides of the graph can be considered the same as those which connects to different pairs of colored edges, maybe this isn't right and may cause a bug in that solution).

please correct me if i was wrong.

Mohamed Hessien - 5 years, 6 months ago

Log in to reply

It's Noticeable that 120 = 5! , which is the number of circles in the graph, if my answer was right that suggests that probably there are an easier way to answer this.

Mohamed Hessien - 5 years, 6 months ago
Daniel Yang
Jan 5, 2016

The degree of each vertex is 2 so it is possible to trace a eulerian graph.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...