Ant got lost again!

Geometry Level 4

An ant is walking on a very long piece of wood with width 1. The ant wants to walk out of this wood by following a predetermined path, which guarantees that the ant will be able to eventually get out.

Let L L denote the minimum length of such a path.

Which of the following inequalities must be true?

5 7 π L < π \frac57 \pi \leq L< \pi 2 5 L 2 6 2\sqrt5 \leq L \leq 2 \sqrt6 π L 2 3 \pi \leq L \leq 2 \sqrt3

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.

1 solution

Ossama Ismail
Jan 5, 2017

Answre is c \large c

There are three possible solutions for this problem (I am sure there may be much better solutions ):

1- The A n t Ant may walk in a circle with radius 1 2 \large \frac{1}{2} and get out in π \large \pi units at most.

2- The A n t Ant may move 2 2 units at most from its location and get out if it walks distance 2 \large \sqrt 2 units in any direction and then turns left or right and walk another distance 2 \large \sqrt 2 . This make max distance = 2 2 =\large 2 \sqrt 2 .

3- The A n t Ant may move 2 3 \large \frac{2}{\sqrt3} units in any direction and then turns with an angle = 12 0 o = 120^o and walk another 2 3 \large\frac{2}{\sqrt3} . The make max distace will be 4 3 \large \frac{4}{\sqrt3} and the A n t Ant get out after walking distance = 4 3 = \large \frac{4}{\sqrt 3} at most.

How do you know that we cannot do better than 5 7 π \frac{ 5}{7} \pi ?

Calvin Lin Staff - 4 years, 5 months ago

Log in to reply

Because the best results I obtained was 2.28. I don't have a concrete prove right now. I think with some geometry and optimization we may get a better answer. I will work on it when I have time.

Ossama Ismail - 4 years, 5 months ago

Can you prove that one of these three must be optimal?

Geoff Pilling - 4 years, 5 months ago

Log in to reply

I am working on finding an optimal solution. I already have a solution better than 3 !!

Ossama Ismail - 4 years, 5 months ago

Log in to reply

It seems to me that your option (3) would be hard to beat, but can it be proven?

Geoff Pilling - 4 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...