The Amazon Poser: Can You Solve This?
Here is another challenge for you based on one of the questions in The Amazing Sri Nibong Hunt (see below).
==========================Q11: Is it possible to walk from the first tree (nearest the plant shown in picture) to the tree furthest from it, by visiting each of the other trees in between only once and not crossing paths? Yes
Q11a: If you were to start walking from the same first tree towards a similar tree nearest to it, then from that tree to another similar tree nearest to that and so on, will you ever reach the furthest tree from the first one?
(you cannot go back to the tree you just walked from as well as the one before that)
(nearest is defined as the shortest distance between trees as measured by footlengths on the ground between them)
No
The answers to folllowing questions are located at a third bunch of trees that all come from the same stock. (13 in total)
Q12: Using a giant rubberband to encircle the whole bunch of trees, how many trees would be physically touched by the band? (the band should be less than a foot above ground)
5 Trees
Q13: Then using another giant rubber band on the remaining trees how many trees would be physically touched by the second band? (the band should be less than a foot above ground)
5 Trees
The question 11 above can be posed as a universal puzzle.
Take the Amazon jungle. It stretches from the eastern shores of South America to the foothill of the Andes. There are probably a 100 billion trees in it.
Based on the 16 trees in the question above, it seems we can do the same feat for the 100 billion trees in the Amazon (meaning we can walk from the easternmost tree to the westernmost tree, touching every tree in between without ever crossing our path).
There might be formal mathematical proofs that such a feat is possible.
However, my poser is this:
is there a visual proof that such is feat is possible?
(A visual proof consists in using a diagram which will clinch the argument that such a feat is possible for any forest of the world)
Can you solve this poser of mine with a visual proof?
You can reply below or email in your diagram to: info {at} webmazers {dot} com.
Regards,
JayMen
Click to share thisClick to share this