Challenging mathematical problems with elementary solutions
Challenging mathematical problems with elementary solutions
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
The forest hiding problem: an illumination problem for maximal disk packings
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
Imagine that you are standing at the center of a circular orchard, with trees centered at all of the lattice points except there is no tree at the origin itself (where you are standing). How large must the radius of the trees be in order to completely block your view (in every direction). Let R be the radius of the orchard, and r be the radius of the trees. It turns out that if R (the radius of the orchard) is an integer then you can see out if and only if r