Difference between revisions of "2007 IMO Problems/Problem 6"
(Created page with "== Problem == Let <math>n</math> be a positive integer. Consider <cmath>S=\{(x,y,z)~:~x,y,z\in \{0,1,\ldots,n \},~x+y+z>0\}</cmath> as a set of <math>(n+1)^3-1</math> points in ...") |
(No difference)
|
Revision as of 00:21, 9 October 2014
Problem
Let be a positive integer. Consider
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 |