How many regions can you obtain from a single thick piece of cheese by making five straight cuts?(The cheese must stay in original position while you do all the cutting and each slice must correspond to a plane in 3D).Find a recurrence relation for ,the maximum number of three dimensional regions that can be defined by different planes.
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
Well I obtain 18 pieces cut 2 slices with a plane and other 2 with another plane and the last one with the last plane. But I am still thinking of a recurrence relation for Pn
Starting with
```
```
Somebody also think.
ARYΔ
Log in to reply
Hm. I feel like 4 cuts should give us more than 12 pieces. The second to third cut already gives us 4 additional pieces, and I would expect that the third to fourth cut would give us more.