Can you see out of the forest?
$begingroup$
You are standing at the centre of a circular forest of radius 500 metres. The trees of this very regularly planted forest stand in a precise rectangular lattice on the plane, each 10 metres from the next: the points $(m,n)$ within the disc-shaped forest with $m,ninmathbb{Z}$ not both zero (since $(0,0)$ is the point where you're standing). Each tree is a perfect cylinder with radius at least 20 centimetres.
Can you see out of the forest?
Source: Leith Hathout, Crimes and Mathdemeanors.
mathematics geometry
$endgroup$
|
show 11 more comments
$begingroup$
You are standing at the centre of a circular forest of radius 500 metres. The trees of this very regularly planted forest stand in a precise rectangular lattice on the plane, each 10 metres from the next: the points $(m,n)$ within the disc-shaped forest with $m,ninmathbb{Z}$ not both zero (since $(0,0)$ is the point where you're standing). Each tree is a perfect cylinder with radius at least 20 centimetres.
Can you see out of the forest?
Source: Leith Hathout, Crimes and Mathdemeanors.
mathematics geometry
$endgroup$
1
$begingroup$
@tmpearce Because you're also on the same rectangular grid, so there's no two rows you can look directly between. And it's not straightforward :-)
$endgroup$
– Rand al'Thor
Sep 13 '16 at 0:09
2
$begingroup$
IMO the trees should be given a radius of exactly 20cm. The phrase at least implies it doesnt matter if they are bigger in which case i would say you cant see out. And if you are making them perfectly cylindrical on a perfect grid they might as well be an exact size as well.
$endgroup$
– gtwebb
Sep 13 '16 at 0:10
1
$begingroup$
To start with, suppose the grid is aligned NS-EW. You only have to consider the angle from North through to North-East (or any of the equivalent sectors between adjacent primary and secondary cardinal directions) because of the eight-fold symmetry. Either it can be done in one and thence all of the sectors, or it can't be done in any of them...
$endgroup$
– Nij
Sep 13 '16 at 0:28
11
$begingroup$
lateral-thinking solution: yes, just look up :) (although I guess these perfect cyliners extend to infinity :/)
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:17
2
$begingroup$
...hence why it's a comment not an answer
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:34
|
show 11 more comments
$begingroup$
You are standing at the centre of a circular forest of radius 500 metres. The trees of this very regularly planted forest stand in a precise rectangular lattice on the plane, each 10 metres from the next: the points $(m,n)$ within the disc-shaped forest with $m,ninmathbb{Z}$ not both zero (since $(0,0)$ is the point where you're standing). Each tree is a perfect cylinder with radius at least 20 centimetres.
Can you see out of the forest?
Source: Leith Hathout, Crimes and Mathdemeanors.
mathematics geometry
$endgroup$
You are standing at the centre of a circular forest of radius 500 metres. The trees of this very regularly planted forest stand in a precise rectangular lattice on the plane, each 10 metres from the next: the points $(m,n)$ within the disc-shaped forest with $m,ninmathbb{Z}$ not both zero (since $(0,0)$ is the point where you're standing). Each tree is a perfect cylinder with radius at least 20 centimetres.
Can you see out of the forest?
Source: Leith Hathout, Crimes and Mathdemeanors.
mathematics geometry
mathematics geometry
edited Sep 13 '16 at 0:19
Rand al'Thor
asked Sep 12 '16 at 23:59
Rand al'ThorRand al'Thor
70.3k14233468
70.3k14233468
1
$begingroup$
@tmpearce Because you're also on the same rectangular grid, so there's no two rows you can look directly between. And it's not straightforward :-)
$endgroup$
– Rand al'Thor
Sep 13 '16 at 0:09
2
$begingroup$
IMO the trees should be given a radius of exactly 20cm. The phrase at least implies it doesnt matter if they are bigger in which case i would say you cant see out. And if you are making them perfectly cylindrical on a perfect grid they might as well be an exact size as well.
$endgroup$
– gtwebb
Sep 13 '16 at 0:10
1
$begingroup$
To start with, suppose the grid is aligned NS-EW. You only have to consider the angle from North through to North-East (or any of the equivalent sectors between adjacent primary and secondary cardinal directions) because of the eight-fold symmetry. Either it can be done in one and thence all of the sectors, or it can't be done in any of them...
$endgroup$
– Nij
Sep 13 '16 at 0:28
11
$begingroup$
lateral-thinking solution: yes, just look up :) (although I guess these perfect cyliners extend to infinity :/)
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:17
2
$begingroup$
...hence why it's a comment not an answer
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:34
|
show 11 more comments
1
$begingroup$
@tmpearce Because you're also on the same rectangular grid, so there's no two rows you can look directly between. And it's not straightforward :-)
$endgroup$
– Rand al'Thor
Sep 13 '16 at 0:09
2
$begingroup$
IMO the trees should be given a radius of exactly 20cm. The phrase at least implies it doesnt matter if they are bigger in which case i would say you cant see out. And if you are making them perfectly cylindrical on a perfect grid they might as well be an exact size as well.
$endgroup$
– gtwebb
Sep 13 '16 at 0:10
1
$begingroup$
To start with, suppose the grid is aligned NS-EW. You only have to consider the angle from North through to North-East (or any of the equivalent sectors between adjacent primary and secondary cardinal directions) because of the eight-fold symmetry. Either it can be done in one and thence all of the sectors, or it can't be done in any of them...
$endgroup$
– Nij
Sep 13 '16 at 0:28
11
$begingroup$
lateral-thinking solution: yes, just look up :) (although I guess these perfect cyliners extend to infinity :/)
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:17
2
$begingroup$
...hence why it's a comment not an answer
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:34
1
1
$begingroup$
@tmpearce Because you're also on the same rectangular grid, so there's no two rows you can look directly between. And it's not straightforward :-)
$endgroup$
– Rand al'Thor
Sep 13 '16 at 0:09
$begingroup$
@tmpearce Because you're also on the same rectangular grid, so there's no two rows you can look directly between. And it's not straightforward :-)
$endgroup$
– Rand al'Thor
Sep 13 '16 at 0:09
2
2
$begingroup$
IMO the trees should be given a radius of exactly 20cm. The phrase at least implies it doesnt matter if they are bigger in which case i would say you cant see out. And if you are making them perfectly cylindrical on a perfect grid they might as well be an exact size as well.
$endgroup$
– gtwebb
Sep 13 '16 at 0:10
$begingroup$
IMO the trees should be given a radius of exactly 20cm. The phrase at least implies it doesnt matter if they are bigger in which case i would say you cant see out. And if you are making them perfectly cylindrical on a perfect grid they might as well be an exact size as well.
$endgroup$
– gtwebb
Sep 13 '16 at 0:10
1
1
$begingroup$
To start with, suppose the grid is aligned NS-EW. You only have to consider the angle from North through to North-East (or any of the equivalent sectors between adjacent primary and secondary cardinal directions) because of the eight-fold symmetry. Either it can be done in one and thence all of the sectors, or it can't be done in any of them...
$endgroup$
– Nij
Sep 13 '16 at 0:28
$begingroup$
To start with, suppose the grid is aligned NS-EW. You only have to consider the angle from North through to North-East (or any of the equivalent sectors between adjacent primary and secondary cardinal directions) because of the eight-fold symmetry. Either it can be done in one and thence all of the sectors, or it can't be done in any of them...
$endgroup$
– Nij
Sep 13 '16 at 0:28
11
11
$begingroup$
lateral-thinking solution: yes, just look up :) (although I guess these perfect cyliners extend to infinity :/)
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:17
$begingroup$
lateral-thinking solution: yes, just look up :) (although I guess these perfect cyliners extend to infinity :/)
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:17
2
2
$begingroup$
...hence why it's a comment not an answer
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:34
$begingroup$
...hence why it's a comment not an answer
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:34
|
show 11 more comments
4 Answers
4
active
oldest
votes
$begingroup$
Let's call a tree front-row iff there are no other trees directly between you and it. Clearly any non-front-row trees are covered by front-row trees.
We call a pair of front-row trees adjacent iff, from your perspective, no other tree's midpoint appears between the midpoints of those two trees.
Claim: You cannot see through the gap between any two adjacent front-row trees.
If this is true, then clearly you cannot see out of the forest, since any sightline passes between some two adjacent front-row trees.
Proof of claim: Let's take any two adjacent front-row trees $A$ and $B$.
Suppose you can see between them. Then you can see their midpoint $C$, since the line $UC$ (pun intended) has equal distance to $A$ and $B$.
We know that the distance $|UC|$ is greater than $250m$, since otherwise there would be a tree at the integer coordinates $A + B = 2C$ in contradiction to the adjacency of $A$ and $B$.
Now let's look at the area of $UAB$. By Pick's Theorem, we know that $UAB$ has $0.5$ times the area of a grid square, so in this case the area of $UAB$ is $50m^2$.
Now consider the triangles $UCA$ and $UCB$ which make up $UAB$. They each have a base of over $250m$ and a height of at least $20cm$, so they must each be over $25m^2$ large. Together they must therefore have an area of strictly more than $50m^2$, which is clearly a contradiction to the previous paragraph. This proves the claim.
$endgroup$
2
$begingroup$
@randal'thor After submitting this solution, I had a look at the source you gave and oh wow the solution there seems ridiculously overcomplicated.
$endgroup$
– Anon
Sep 13 '16 at 3:23
1
$begingroup$
@ArturKirkoryan No, it involves proving Minkowski's Theorem using Blichfeldt's Lemma, then using that on an arbitrary 80cm strip across the origin to find a tree whose center lies on that strip (and thus blocks the axis of that strip). Wait a second, that's not true at all, this means that the proof given in the book isn't even correct! And just reducing the strip width to 40cm doesn't work either, because that would break an important inequality necessary for Minkowski's Theorem to work! It appears the proof in the book is in fact irreparably broken.
$endgroup$
– Anon
Sep 13 '16 at 3:53
1
$begingroup$
@ArturKirkoryan Here you go
$endgroup$
– Anon
Sep 13 '16 at 3:57
2
$begingroup$
+1 for avoiding Minkowski's theorem. And for "the line $UC$" :)
$endgroup$
– Rosie F
Sep 13 '16 at 5:50
1
$begingroup$
Brilliant proof! And my sincere apologies for the book proof being wrong; we're lucky that there was still an elementary proof, otherwise my question might have inadvertently been unsolvable or even wrong.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 12:26
|
show 13 more comments
$begingroup$
Case 1:
Assumptions: My eyes are in the exact center of my head; The trees are exactly 0.2m in radius.
Result: I cannot see out of the forest. There is a 2mm interference on the tree closest to the edge of the forest blocking my line of sight.
Case 2:
Assumptions: My eyes are like those of a normal human and they are each located 30mm from the center of my head; The trees are exactly 0.2m in radius.
Result: I can see out of the forest. There is a 1.438m gap (measured at the outer edge of the forest) between the edge of the tree closest to me and the edge of the tree farthest from me.
Kudos to the math proof (especially since I can't do that), but I'm an engineer, so I just drew it and measured it in CAD.
$endgroup$
$begingroup$
You're hired! Just one more question... What's the volume of this light bulb?
$endgroup$
– Mazura
Sep 14 '16 at 1:48
$begingroup$
Archimedes can tell you..,
$endgroup$
– Stewbob
Sep 14 '16 at 2:30
add a comment |
$begingroup$
Facts:
- I am standing
- Trees are not less than 20cm radius
Assumptions:
- I am an average human, at least 140cm tall (lo-ball estimate)
- My eyes are positioned near the top of my body
- The majority of trees have a radius below 70cm
Therefore I can easily see out of the forest over the tops of the trees.
NB: This would have been a comment (I don't feel it really meets the spirit of the question) but I don't have the rep.
NNB: I don't perceive this as lateral thinking, just making reasonable assumptions from the stated question, but happy to be argued down!
$endgroup$
1
$begingroup$
The trees are cylindrical, not spherical. And this isn't a lateral-thinking puzzle.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:32
$begingroup$
Ah. My bad. So, assuming a cylindrical tree with a reasonable height (let's say, taller thank an average human), no, you can't. That'll teach me to scan questions
$endgroup$
– jymbob
Sep 13 '16 at 15:34
$begingroup$
But you still need to prove that you can't ...
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:36
2
$begingroup$
I'm happy to defer to the proof offered by @McFry above
$endgroup$
– jymbob
Sep 13 '16 at 15:46
1
$begingroup$
I don't see how your height is relevant to the radius of the trees
$endgroup$
– njzk2
Sep 13 '16 at 17:08
|
show 1 more comment
$begingroup$
I can see out. I gotta chainsaw!
New contributor
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f42452%2fcan-you-see-out-of-the-forest%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
4 Answers
4
active
oldest
votes
4 Answers
4
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Let's call a tree front-row iff there are no other trees directly between you and it. Clearly any non-front-row trees are covered by front-row trees.
We call a pair of front-row trees adjacent iff, from your perspective, no other tree's midpoint appears between the midpoints of those two trees.
Claim: You cannot see through the gap between any two adjacent front-row trees.
If this is true, then clearly you cannot see out of the forest, since any sightline passes between some two adjacent front-row trees.
Proof of claim: Let's take any two adjacent front-row trees $A$ and $B$.
Suppose you can see between them. Then you can see their midpoint $C$, since the line $UC$ (pun intended) has equal distance to $A$ and $B$.
We know that the distance $|UC|$ is greater than $250m$, since otherwise there would be a tree at the integer coordinates $A + B = 2C$ in contradiction to the adjacency of $A$ and $B$.
Now let's look at the area of $UAB$. By Pick's Theorem, we know that $UAB$ has $0.5$ times the area of a grid square, so in this case the area of $UAB$ is $50m^2$.
Now consider the triangles $UCA$ and $UCB$ which make up $UAB$. They each have a base of over $250m$ and a height of at least $20cm$, so they must each be over $25m^2$ large. Together they must therefore have an area of strictly more than $50m^2$, which is clearly a contradiction to the previous paragraph. This proves the claim.
$endgroup$
2
$begingroup$
@randal'thor After submitting this solution, I had a look at the source you gave and oh wow the solution there seems ridiculously overcomplicated.
$endgroup$
– Anon
Sep 13 '16 at 3:23
1
$begingroup$
@ArturKirkoryan No, it involves proving Minkowski's Theorem using Blichfeldt's Lemma, then using that on an arbitrary 80cm strip across the origin to find a tree whose center lies on that strip (and thus blocks the axis of that strip). Wait a second, that's not true at all, this means that the proof given in the book isn't even correct! And just reducing the strip width to 40cm doesn't work either, because that would break an important inequality necessary for Minkowski's Theorem to work! It appears the proof in the book is in fact irreparably broken.
$endgroup$
– Anon
Sep 13 '16 at 3:53
1
$begingroup$
@ArturKirkoryan Here you go
$endgroup$
– Anon
Sep 13 '16 at 3:57
2
$begingroup$
+1 for avoiding Minkowski's theorem. And for "the line $UC$" :)
$endgroup$
– Rosie F
Sep 13 '16 at 5:50
1
$begingroup$
Brilliant proof! And my sincere apologies for the book proof being wrong; we're lucky that there was still an elementary proof, otherwise my question might have inadvertently been unsolvable or even wrong.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 12:26
|
show 13 more comments
$begingroup$
Let's call a tree front-row iff there are no other trees directly between you and it. Clearly any non-front-row trees are covered by front-row trees.
We call a pair of front-row trees adjacent iff, from your perspective, no other tree's midpoint appears between the midpoints of those two trees.
Claim: You cannot see through the gap between any two adjacent front-row trees.
If this is true, then clearly you cannot see out of the forest, since any sightline passes between some two adjacent front-row trees.
Proof of claim: Let's take any two adjacent front-row trees $A$ and $B$.
Suppose you can see between them. Then you can see their midpoint $C$, since the line $UC$ (pun intended) has equal distance to $A$ and $B$.
We know that the distance $|UC|$ is greater than $250m$, since otherwise there would be a tree at the integer coordinates $A + B = 2C$ in contradiction to the adjacency of $A$ and $B$.
Now let's look at the area of $UAB$. By Pick's Theorem, we know that $UAB$ has $0.5$ times the area of a grid square, so in this case the area of $UAB$ is $50m^2$.
Now consider the triangles $UCA$ and $UCB$ which make up $UAB$. They each have a base of over $250m$ and a height of at least $20cm$, so they must each be over $25m^2$ large. Together they must therefore have an area of strictly more than $50m^2$, which is clearly a contradiction to the previous paragraph. This proves the claim.
$endgroup$
2
$begingroup$
@randal'thor After submitting this solution, I had a look at the source you gave and oh wow the solution there seems ridiculously overcomplicated.
$endgroup$
– Anon
Sep 13 '16 at 3:23
1
$begingroup$
@ArturKirkoryan No, it involves proving Minkowski's Theorem using Blichfeldt's Lemma, then using that on an arbitrary 80cm strip across the origin to find a tree whose center lies on that strip (and thus blocks the axis of that strip). Wait a second, that's not true at all, this means that the proof given in the book isn't even correct! And just reducing the strip width to 40cm doesn't work either, because that would break an important inequality necessary for Minkowski's Theorem to work! It appears the proof in the book is in fact irreparably broken.
$endgroup$
– Anon
Sep 13 '16 at 3:53
1
$begingroup$
@ArturKirkoryan Here you go
$endgroup$
– Anon
Sep 13 '16 at 3:57
2
$begingroup$
+1 for avoiding Minkowski's theorem. And for "the line $UC$" :)
$endgroup$
– Rosie F
Sep 13 '16 at 5:50
1
$begingroup$
Brilliant proof! And my sincere apologies for the book proof being wrong; we're lucky that there was still an elementary proof, otherwise my question might have inadvertently been unsolvable or even wrong.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 12:26
|
show 13 more comments
$begingroup$
Let's call a tree front-row iff there are no other trees directly between you and it. Clearly any non-front-row trees are covered by front-row trees.
We call a pair of front-row trees adjacent iff, from your perspective, no other tree's midpoint appears between the midpoints of those two trees.
Claim: You cannot see through the gap between any two adjacent front-row trees.
If this is true, then clearly you cannot see out of the forest, since any sightline passes between some two adjacent front-row trees.
Proof of claim: Let's take any two adjacent front-row trees $A$ and $B$.
Suppose you can see between them. Then you can see their midpoint $C$, since the line $UC$ (pun intended) has equal distance to $A$ and $B$.
We know that the distance $|UC|$ is greater than $250m$, since otherwise there would be a tree at the integer coordinates $A + B = 2C$ in contradiction to the adjacency of $A$ and $B$.
Now let's look at the area of $UAB$. By Pick's Theorem, we know that $UAB$ has $0.5$ times the area of a grid square, so in this case the area of $UAB$ is $50m^2$.
Now consider the triangles $UCA$ and $UCB$ which make up $UAB$. They each have a base of over $250m$ and a height of at least $20cm$, so they must each be over $25m^2$ large. Together they must therefore have an area of strictly more than $50m^2$, which is clearly a contradiction to the previous paragraph. This proves the claim.
$endgroup$
Let's call a tree front-row iff there are no other trees directly between you and it. Clearly any non-front-row trees are covered by front-row trees.
We call a pair of front-row trees adjacent iff, from your perspective, no other tree's midpoint appears between the midpoints of those two trees.
Claim: You cannot see through the gap between any two adjacent front-row trees.
If this is true, then clearly you cannot see out of the forest, since any sightline passes between some two adjacent front-row trees.
Proof of claim: Let's take any two adjacent front-row trees $A$ and $B$.
Suppose you can see between them. Then you can see their midpoint $C$, since the line $UC$ (pun intended) has equal distance to $A$ and $B$.
We know that the distance $|UC|$ is greater than $250m$, since otherwise there would be a tree at the integer coordinates $A + B = 2C$ in contradiction to the adjacency of $A$ and $B$.
Now let's look at the area of $UAB$. By Pick's Theorem, we know that $UAB$ has $0.5$ times the area of a grid square, so in this case the area of $UAB$ is $50m^2$.
Now consider the triangles $UCA$ and $UCB$ which make up $UAB$. They each have a base of over $250m$ and a height of at least $20cm$, so they must each be over $25m^2$ large. Together they must therefore have an area of strictly more than $50m^2$, which is clearly a contradiction to the previous paragraph. This proves the claim.
answered Sep 13 '16 at 3:11
AnonAnon
2,5541718
2,5541718
2
$begingroup$
@randal'thor After submitting this solution, I had a look at the source you gave and oh wow the solution there seems ridiculously overcomplicated.
$endgroup$
– Anon
Sep 13 '16 at 3:23
1
$begingroup$
@ArturKirkoryan No, it involves proving Minkowski's Theorem using Blichfeldt's Lemma, then using that on an arbitrary 80cm strip across the origin to find a tree whose center lies on that strip (and thus blocks the axis of that strip). Wait a second, that's not true at all, this means that the proof given in the book isn't even correct! And just reducing the strip width to 40cm doesn't work either, because that would break an important inequality necessary for Minkowski's Theorem to work! It appears the proof in the book is in fact irreparably broken.
$endgroup$
– Anon
Sep 13 '16 at 3:53
1
$begingroup$
@ArturKirkoryan Here you go
$endgroup$
– Anon
Sep 13 '16 at 3:57
2
$begingroup$
+1 for avoiding Minkowski's theorem. And for "the line $UC$" :)
$endgroup$
– Rosie F
Sep 13 '16 at 5:50
1
$begingroup$
Brilliant proof! And my sincere apologies for the book proof being wrong; we're lucky that there was still an elementary proof, otherwise my question might have inadvertently been unsolvable or even wrong.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 12:26
|
show 13 more comments
2
$begingroup$
@randal'thor After submitting this solution, I had a look at the source you gave and oh wow the solution there seems ridiculously overcomplicated.
$endgroup$
– Anon
Sep 13 '16 at 3:23
1
$begingroup$
@ArturKirkoryan No, it involves proving Minkowski's Theorem using Blichfeldt's Lemma, then using that on an arbitrary 80cm strip across the origin to find a tree whose center lies on that strip (and thus blocks the axis of that strip). Wait a second, that's not true at all, this means that the proof given in the book isn't even correct! And just reducing the strip width to 40cm doesn't work either, because that would break an important inequality necessary for Minkowski's Theorem to work! It appears the proof in the book is in fact irreparably broken.
$endgroup$
– Anon
Sep 13 '16 at 3:53
1
$begingroup$
@ArturKirkoryan Here you go
$endgroup$
– Anon
Sep 13 '16 at 3:57
2
$begingroup$
+1 for avoiding Minkowski's theorem. And for "the line $UC$" :)
$endgroup$
– Rosie F
Sep 13 '16 at 5:50
1
$begingroup$
Brilliant proof! And my sincere apologies for the book proof being wrong; we're lucky that there was still an elementary proof, otherwise my question might have inadvertently been unsolvable or even wrong.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 12:26
2
2
$begingroup$
@randal'thor After submitting this solution, I had a look at the source you gave and oh wow the solution there seems ridiculously overcomplicated.
$endgroup$
– Anon
Sep 13 '16 at 3:23
$begingroup$
@randal'thor After submitting this solution, I had a look at the source you gave and oh wow the solution there seems ridiculously overcomplicated.
$endgroup$
– Anon
Sep 13 '16 at 3:23
1
1
$begingroup$
@ArturKirkoryan No, it involves proving Minkowski's Theorem using Blichfeldt's Lemma, then using that on an arbitrary 80cm strip across the origin to find a tree whose center lies on that strip (and thus blocks the axis of that strip). Wait a second, that's not true at all, this means that the proof given in the book isn't even correct! And just reducing the strip width to 40cm doesn't work either, because that would break an important inequality necessary for Minkowski's Theorem to work! It appears the proof in the book is in fact irreparably broken.
$endgroup$
– Anon
Sep 13 '16 at 3:53
$begingroup$
@ArturKirkoryan No, it involves proving Minkowski's Theorem using Blichfeldt's Lemma, then using that on an arbitrary 80cm strip across the origin to find a tree whose center lies on that strip (and thus blocks the axis of that strip). Wait a second, that's not true at all, this means that the proof given in the book isn't even correct! And just reducing the strip width to 40cm doesn't work either, because that would break an important inequality necessary for Minkowski's Theorem to work! It appears the proof in the book is in fact irreparably broken.
$endgroup$
– Anon
Sep 13 '16 at 3:53
1
1
$begingroup$
@ArturKirkoryan Here you go
$endgroup$
– Anon
Sep 13 '16 at 3:57
$begingroup$
@ArturKirkoryan Here you go
$endgroup$
– Anon
Sep 13 '16 at 3:57
2
2
$begingroup$
+1 for avoiding Minkowski's theorem. And for "the line $UC$" :)
$endgroup$
– Rosie F
Sep 13 '16 at 5:50
$begingroup$
+1 for avoiding Minkowski's theorem. And for "the line $UC$" :)
$endgroup$
– Rosie F
Sep 13 '16 at 5:50
1
1
$begingroup$
Brilliant proof! And my sincere apologies for the book proof being wrong; we're lucky that there was still an elementary proof, otherwise my question might have inadvertently been unsolvable or even wrong.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 12:26
$begingroup$
Brilliant proof! And my sincere apologies for the book proof being wrong; we're lucky that there was still an elementary proof, otherwise my question might have inadvertently been unsolvable or even wrong.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 12:26
|
show 13 more comments
$begingroup$
Case 1:
Assumptions: My eyes are in the exact center of my head; The trees are exactly 0.2m in radius.
Result: I cannot see out of the forest. There is a 2mm interference on the tree closest to the edge of the forest blocking my line of sight.
Case 2:
Assumptions: My eyes are like those of a normal human and they are each located 30mm from the center of my head; The trees are exactly 0.2m in radius.
Result: I can see out of the forest. There is a 1.438m gap (measured at the outer edge of the forest) between the edge of the tree closest to me and the edge of the tree farthest from me.
Kudos to the math proof (especially since I can't do that), but I'm an engineer, so I just drew it and measured it in CAD.
$endgroup$
$begingroup$
You're hired! Just one more question... What's the volume of this light bulb?
$endgroup$
– Mazura
Sep 14 '16 at 1:48
$begingroup$
Archimedes can tell you..,
$endgroup$
– Stewbob
Sep 14 '16 at 2:30
add a comment |
$begingroup$
Case 1:
Assumptions: My eyes are in the exact center of my head; The trees are exactly 0.2m in radius.
Result: I cannot see out of the forest. There is a 2mm interference on the tree closest to the edge of the forest blocking my line of sight.
Case 2:
Assumptions: My eyes are like those of a normal human and they are each located 30mm from the center of my head; The trees are exactly 0.2m in radius.
Result: I can see out of the forest. There is a 1.438m gap (measured at the outer edge of the forest) between the edge of the tree closest to me and the edge of the tree farthest from me.
Kudos to the math proof (especially since I can't do that), but I'm an engineer, so I just drew it and measured it in CAD.
$endgroup$
$begingroup$
You're hired! Just one more question... What's the volume of this light bulb?
$endgroup$
– Mazura
Sep 14 '16 at 1:48
$begingroup$
Archimedes can tell you..,
$endgroup$
– Stewbob
Sep 14 '16 at 2:30
add a comment |
$begingroup$
Case 1:
Assumptions: My eyes are in the exact center of my head; The trees are exactly 0.2m in radius.
Result: I cannot see out of the forest. There is a 2mm interference on the tree closest to the edge of the forest blocking my line of sight.
Case 2:
Assumptions: My eyes are like those of a normal human and they are each located 30mm from the center of my head; The trees are exactly 0.2m in radius.
Result: I can see out of the forest. There is a 1.438m gap (measured at the outer edge of the forest) between the edge of the tree closest to me and the edge of the tree farthest from me.
Kudos to the math proof (especially since I can't do that), but I'm an engineer, so I just drew it and measured it in CAD.
$endgroup$
Case 1:
Assumptions: My eyes are in the exact center of my head; The trees are exactly 0.2m in radius.
Result: I cannot see out of the forest. There is a 2mm interference on the tree closest to the edge of the forest blocking my line of sight.
Case 2:
Assumptions: My eyes are like those of a normal human and they are each located 30mm from the center of my head; The trees are exactly 0.2m in radius.
Result: I can see out of the forest. There is a 1.438m gap (measured at the outer edge of the forest) between the edge of the tree closest to me and the edge of the tree farthest from me.
Kudos to the math proof (especially since I can't do that), but I'm an engineer, so I just drew it and measured it in CAD.
answered Sep 13 '16 at 17:07
StewbobStewbob
1414
1414
$begingroup$
You're hired! Just one more question... What's the volume of this light bulb?
$endgroup$
– Mazura
Sep 14 '16 at 1:48
$begingroup$
Archimedes can tell you..,
$endgroup$
– Stewbob
Sep 14 '16 at 2:30
add a comment |
$begingroup$
You're hired! Just one more question... What's the volume of this light bulb?
$endgroup$
– Mazura
Sep 14 '16 at 1:48
$begingroup$
Archimedes can tell you..,
$endgroup$
– Stewbob
Sep 14 '16 at 2:30
$begingroup$
You're hired! Just one more question... What's the volume of this light bulb?
$endgroup$
– Mazura
Sep 14 '16 at 1:48
$begingroup$
You're hired! Just one more question... What's the volume of this light bulb?
$endgroup$
– Mazura
Sep 14 '16 at 1:48
$begingroup$
Archimedes can tell you..,
$endgroup$
– Stewbob
Sep 14 '16 at 2:30
$begingroup$
Archimedes can tell you..,
$endgroup$
– Stewbob
Sep 14 '16 at 2:30
add a comment |
$begingroup$
Facts:
- I am standing
- Trees are not less than 20cm radius
Assumptions:
- I am an average human, at least 140cm tall (lo-ball estimate)
- My eyes are positioned near the top of my body
- The majority of trees have a radius below 70cm
Therefore I can easily see out of the forest over the tops of the trees.
NB: This would have been a comment (I don't feel it really meets the spirit of the question) but I don't have the rep.
NNB: I don't perceive this as lateral thinking, just making reasonable assumptions from the stated question, but happy to be argued down!
$endgroup$
1
$begingroup$
The trees are cylindrical, not spherical. And this isn't a lateral-thinking puzzle.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:32
$begingroup$
Ah. My bad. So, assuming a cylindrical tree with a reasonable height (let's say, taller thank an average human), no, you can't. That'll teach me to scan questions
$endgroup$
– jymbob
Sep 13 '16 at 15:34
$begingroup$
But you still need to prove that you can't ...
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:36
2
$begingroup$
I'm happy to defer to the proof offered by @McFry above
$endgroup$
– jymbob
Sep 13 '16 at 15:46
1
$begingroup$
I don't see how your height is relevant to the radius of the trees
$endgroup$
– njzk2
Sep 13 '16 at 17:08
|
show 1 more comment
$begingroup$
Facts:
- I am standing
- Trees are not less than 20cm radius
Assumptions:
- I am an average human, at least 140cm tall (lo-ball estimate)
- My eyes are positioned near the top of my body
- The majority of trees have a radius below 70cm
Therefore I can easily see out of the forest over the tops of the trees.
NB: This would have been a comment (I don't feel it really meets the spirit of the question) but I don't have the rep.
NNB: I don't perceive this as lateral thinking, just making reasonable assumptions from the stated question, but happy to be argued down!
$endgroup$
1
$begingroup$
The trees are cylindrical, not spherical. And this isn't a lateral-thinking puzzle.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:32
$begingroup$
Ah. My bad. So, assuming a cylindrical tree with a reasonable height (let's say, taller thank an average human), no, you can't. That'll teach me to scan questions
$endgroup$
– jymbob
Sep 13 '16 at 15:34
$begingroup$
But you still need to prove that you can't ...
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:36
2
$begingroup$
I'm happy to defer to the proof offered by @McFry above
$endgroup$
– jymbob
Sep 13 '16 at 15:46
1
$begingroup$
I don't see how your height is relevant to the radius of the trees
$endgroup$
– njzk2
Sep 13 '16 at 17:08
|
show 1 more comment
$begingroup$
Facts:
- I am standing
- Trees are not less than 20cm radius
Assumptions:
- I am an average human, at least 140cm tall (lo-ball estimate)
- My eyes are positioned near the top of my body
- The majority of trees have a radius below 70cm
Therefore I can easily see out of the forest over the tops of the trees.
NB: This would have been a comment (I don't feel it really meets the spirit of the question) but I don't have the rep.
NNB: I don't perceive this as lateral thinking, just making reasonable assumptions from the stated question, but happy to be argued down!
$endgroup$
Facts:
- I am standing
- Trees are not less than 20cm radius
Assumptions:
- I am an average human, at least 140cm tall (lo-ball estimate)
- My eyes are positioned near the top of my body
- The majority of trees have a radius below 70cm
Therefore I can easily see out of the forest over the tops of the trees.
NB: This would have been a comment (I don't feel it really meets the spirit of the question) but I don't have the rep.
NNB: I don't perceive this as lateral thinking, just making reasonable assumptions from the stated question, but happy to be argued down!
edited Sep 13 '16 at 15:33
answered Sep 13 '16 at 15:30
jymbobjymbob
1212
1212
1
$begingroup$
The trees are cylindrical, not spherical. And this isn't a lateral-thinking puzzle.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:32
$begingroup$
Ah. My bad. So, assuming a cylindrical tree with a reasonable height (let's say, taller thank an average human), no, you can't. That'll teach me to scan questions
$endgroup$
– jymbob
Sep 13 '16 at 15:34
$begingroup$
But you still need to prove that you can't ...
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:36
2
$begingroup$
I'm happy to defer to the proof offered by @McFry above
$endgroup$
– jymbob
Sep 13 '16 at 15:46
1
$begingroup$
I don't see how your height is relevant to the radius of the trees
$endgroup$
– njzk2
Sep 13 '16 at 17:08
|
show 1 more comment
1
$begingroup$
The trees are cylindrical, not spherical. And this isn't a lateral-thinking puzzle.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:32
$begingroup$
Ah. My bad. So, assuming a cylindrical tree with a reasonable height (let's say, taller thank an average human), no, you can't. That'll teach me to scan questions
$endgroup$
– jymbob
Sep 13 '16 at 15:34
$begingroup$
But you still need to prove that you can't ...
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:36
2
$begingroup$
I'm happy to defer to the proof offered by @McFry above
$endgroup$
– jymbob
Sep 13 '16 at 15:46
1
$begingroup$
I don't see how your height is relevant to the radius of the trees
$endgroup$
– njzk2
Sep 13 '16 at 17:08
1
1
$begingroup$
The trees are cylindrical, not spherical. And this isn't a lateral-thinking puzzle.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:32
$begingroup$
The trees are cylindrical, not spherical. And this isn't a lateral-thinking puzzle.
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:32
$begingroup$
Ah. My bad. So, assuming a cylindrical tree with a reasonable height (let's say, taller thank an average human), no, you can't. That'll teach me to scan questions
$endgroup$
– jymbob
Sep 13 '16 at 15:34
$begingroup$
Ah. My bad. So, assuming a cylindrical tree with a reasonable height (let's say, taller thank an average human), no, you can't. That'll teach me to scan questions
$endgroup$
– jymbob
Sep 13 '16 at 15:34
$begingroup$
But you still need to prove that you can't ...
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:36
$begingroup$
But you still need to prove that you can't ...
$endgroup$
– Rand al'Thor
Sep 13 '16 at 15:36
2
2
$begingroup$
I'm happy to defer to the proof offered by @McFry above
$endgroup$
– jymbob
Sep 13 '16 at 15:46
$begingroup$
I'm happy to defer to the proof offered by @McFry above
$endgroup$
– jymbob
Sep 13 '16 at 15:46
1
1
$begingroup$
I don't see how your height is relevant to the radius of the trees
$endgroup$
– njzk2
Sep 13 '16 at 17:08
$begingroup$
I don't see how your height is relevant to the radius of the trees
$endgroup$
– njzk2
Sep 13 '16 at 17:08
|
show 1 more comment
$begingroup$
I can see out. I gotta chainsaw!
New contributor
$endgroup$
add a comment |
$begingroup$
I can see out. I gotta chainsaw!
New contributor
$endgroup$
add a comment |
$begingroup$
I can see out. I gotta chainsaw!
New contributor
$endgroup$
I can see out. I gotta chainsaw!
New contributor
New contributor
answered 10 mins ago
Peter HarrisPeter Harris
1
1
New contributor
New contributor
add a comment |
add a comment |
Thanks for contributing an answer to Puzzling Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f42452%2fcan-you-see-out-of-the-forest%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
@tmpearce Because you're also on the same rectangular grid, so there's no two rows you can look directly between. And it's not straightforward :-)
$endgroup$
– Rand al'Thor
Sep 13 '16 at 0:09
2
$begingroup$
IMO the trees should be given a radius of exactly 20cm. The phrase at least implies it doesnt matter if they are bigger in which case i would say you cant see out. And if you are making them perfectly cylindrical on a perfect grid they might as well be an exact size as well.
$endgroup$
– gtwebb
Sep 13 '16 at 0:10
1
$begingroup$
To start with, suppose the grid is aligned NS-EW. You only have to consider the angle from North through to North-East (or any of the equivalent sectors between adjacent primary and secondary cardinal directions) because of the eight-fold symmetry. Either it can be done in one and thence all of the sectors, or it can't be done in any of them...
$endgroup$
– Nij
Sep 13 '16 at 0:28
11
$begingroup$
lateral-thinking solution: yes, just look up :) (although I guess these perfect cyliners extend to infinity :/)
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:17
2
$begingroup$
...hence why it's a comment not an answer
$endgroup$
– Jonathan Allan
Sep 13 '16 at 1:34