Benchmark AI / Public workspace
OlympiadBench / 1662 / Let n>1 be an integer. In the space, consider the set
Problem
Answer published by the source. Consult the official source to check your work against its answer.
answer type
Expression
is multiple answer
false
language
English
question
Let be an integer. In the space, consider the set
Find the smallest number of planes that jointly contain all points of but none of them passes through the origin.
Plain-text mathematical notation (without MathML)
Let n>1 be an integer. In the space, consider the set
S={(x,y,z)∣x,y,z∈{0,1,…,n},x+y+z>0}
Find the smallest number of planes that jointly contain all (n+1)³−1 points of S but none of them passes through the origin.Original LaTeX notation
Let $n>1$ be an integer. In the space, consider the set
$$
S=\{(x, y, z) \mid x, y, z \in\{0,1, \ldots, n\}, x+y+z>0\}
$$
Find the smallest number of planes that jointly contain all $(n+1)^{3}-1$ points of $S$ but none of them passes through the origin.question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Artifacts
Code, notes and reproducible work shared by participants. Files are served from a separate origin.
No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import