2007 IMO Problems/Problem 6
Problem
Let 
be a positive integer. Consider
![\[S=\{(x,y,z)~:~x,y,z\in \{0,1,\ldots,n \},~x+y+z>0\}\]](http://latex.artofproblemsolving.com/0/9/3/093e2981f00291b1f43718a1442f9967e2df0a27.png)
as a set of 
points in three-dimensional space.
Determine the smallest possible number of planes, the union of which contain 
but does not include 
.
Solution
Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.
| 2007 IMO (Problems) • Resources | ||
| Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 6 |
| All IMO Problems and Solutions | ||
