Suppose that C is a convex subset of R3 with positive volume. Suppose that C1,C2,…Cn are n translated (not rotated) copies of C such that Ci∩C=0, but Ci and Cj intersect at most on the boundary for i=j. Prove that n≤27 and that 27 is the best bound.
#SetNotation
#Finn
#CanYouProveIt?
#ProveIt
#ConvexSubsets
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.