Proof that $n$ planes cut a solid torus into a maximum of $frac16(n^3+3n^2+8n)$ pieces Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Can I cut a lamington into 3 congruent pieces having equal icing?square cake with raisinsWhat is the maximum number of pieces that a pizza can be cut into by 7 knife cuts? (NBHM 2005)Mathematics of paper fold-cuttingLazy Caterer's Problem: why a new line can cut all the othersHow many substantially different ways are there to cut a convex polygon to n convex polygons?Cut up a cube into pieces that form 3 regular tetrahedra?Equal areas of segments in the lazy caterer problem?3D pizza slicingUsing a straightedge, a compass, and a knife to cut a triangular cake into pieces that reassemble into a rectangle

Why did the rest of the Eastern Bloc not invade Yugoslavia?

Echoing a tail command produces unexpected output?

How to bypass password on Windows XP account?

Why are Kinder Surprise Eggs illegal in the USA?

What is Wonderstone and are there any references to it pre-1982?

What's the purpose of writing one's academic biography in the third person?

When do you get frequent flier miles - when you buy, or when you fly?

How to find out what spells would be useless to a blind NPC spellcaster?

Why light coming from distant stars is not discreet?

Why is "Consequences inflicted." not a sentence?

Why are there no cargo aircraft with "flying wing" design?

What is the role of the transistor and diode in a soft start circuit?

Error "illegal generic type for instanceof" when using local classes

How do pianists reach extremely loud dynamics?

What does the "x" in "x86" represent?

Why didn't this character "real die" when they blew their stack out in Altered Carbon?

How can I make names more distinctive without making them longer?

Is it true that "carbohydrates are of no use for the basal metabolic need"?

What exactly is a "Meth" in Altered Carbon?

Generate an RGB colour grid

How does the particle を relate to the verb 行く in the structure「A を + B に行く」?

Bete Noir -- no dairy

How do I keep my slimes from escaping their pens?

When were vectors invented?



Proof that $n$ planes cut a solid torus into a maximum of $frac16(n^3+3n^2+8n)$ pieces



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Can I cut a lamington into 3 congruent pieces having equal icing?square cake with raisinsWhat is the maximum number of pieces that a pizza can be cut into by 7 knife cuts? (NBHM 2005)Mathematics of paper fold-cuttingLazy Caterer's Problem: why a new line can cut all the othersHow many substantially different ways are there to cut a convex polygon to n convex polygons?Cut up a cube into pieces that form 3 regular tetrahedra?Equal areas of segments in the lazy caterer problem?3D pizza slicingUsing a straightedge, a compass, and a knife to cut a triangular cake into pieces that reassemble into a rectangle










5












$begingroup$


Question: How many pieces can a solid torus be cut into with three (affine) planar cuts?



A google search will quickly reveal that the answer is thirteen, as can be read about here. The picture below displays this solution. However, despite being able to look at the diagram and confirm that thirteen pieces is indeed possible, I do not see how one would prove this is the maximum number of cuts. Furthermore, I have found the following general formula for $n$ cuts: $f(n)=frac16(n^3+3n^2+8n)$, but have not been able to find a proof for this either.



Better Question: How does one prove that thirteen is the maximum number of pieces with three cuts, and that $f$ provides the number of pieces with $n$ cuts?












share|cite|improve this question











$endgroup$











  • $begingroup$
    Not answering the question, but more info: mathworld.wolfram.com/TorusCutting.html
    $endgroup$
    – vadim123
    Mar 14 at 22:38















5












$begingroup$


Question: How many pieces can a solid torus be cut into with three (affine) planar cuts?



A google search will quickly reveal that the answer is thirteen, as can be read about here. The picture below displays this solution. However, despite being able to look at the diagram and confirm that thirteen pieces is indeed possible, I do not see how one would prove this is the maximum number of cuts. Furthermore, I have found the following general formula for $n$ cuts: $f(n)=frac16(n^3+3n^2+8n)$, but have not been able to find a proof for this either.



Better Question: How does one prove that thirteen is the maximum number of pieces with three cuts, and that $f$ provides the number of pieces with $n$ cuts?












share|cite|improve this question











$endgroup$











  • $begingroup$
    Not answering the question, but more info: mathworld.wolfram.com/TorusCutting.html
    $endgroup$
    – vadim123
    Mar 14 at 22:38













5












5








5


2



$begingroup$


Question: How many pieces can a solid torus be cut into with three (affine) planar cuts?



A google search will quickly reveal that the answer is thirteen, as can be read about here. The picture below displays this solution. However, despite being able to look at the diagram and confirm that thirteen pieces is indeed possible, I do not see how one would prove this is the maximum number of cuts. Furthermore, I have found the following general formula for $n$ cuts: $f(n)=frac16(n^3+3n^2+8n)$, but have not been able to find a proof for this either.



Better Question: How does one prove that thirteen is the maximum number of pieces with three cuts, and that $f$ provides the number of pieces with $n$ cuts?












share|cite|improve this question











$endgroup$




Question: How many pieces can a solid torus be cut into with three (affine) planar cuts?



A google search will quickly reveal that the answer is thirteen, as can be read about here. The picture below displays this solution. However, despite being able to look at the diagram and confirm that thirteen pieces is indeed possible, I do not see how one would prove this is the maximum number of cuts. Furthermore, I have found the following general formula for $n$ cuts: $f(n)=frac16(n^3+3n^2+8n)$, but have not been able to find a proof for this either.



Better Question: How does one prove that thirteen is the maximum number of pieces with three cuts, and that $f$ provides the number of pieces with $n$ cuts?









geometry proof-explanation puzzle visualization






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 30 at 20:13







Romain S

















asked Mar 13 at 14:52









Romain SRomain S

1,275822




1,275822











  • $begingroup$
    Not answering the question, but more info: mathworld.wolfram.com/TorusCutting.html
    $endgroup$
    – vadim123
    Mar 14 at 22:38
















  • $begingroup$
    Not answering the question, but more info: mathworld.wolfram.com/TorusCutting.html
    $endgroup$
    – vadim123
    Mar 14 at 22:38















$begingroup$
Not answering the question, but more info: mathworld.wolfram.com/TorusCutting.html
$endgroup$
– vadim123
Mar 14 at 22:38




$begingroup$
Not answering the question, but more info: mathworld.wolfram.com/TorusCutting.html
$endgroup$
– vadim123
Mar 14 at 22:38










1 Answer
1






active

oldest

votes


















2





+50







$begingroup$

Here's the intuitive explanation, which can be made rigorous: The maximum number of pieces is not going to change if you change the relative size of the donut and the hole, or if you stretch the donut in one direction. So you can think of a fat, sort of cigar-shaped, donut with a very skinny long hole in it. In fact, taking this equivalence to its logical extreme, you'll get the same number of pieces if your donut is just a cake with a slit cut through the middle of it (the slit does not touch any side of the cake, so from above it looks like $Theta$ -- notice how the crossbar does not actually touch the outer circle).



Now, instead of starting with a slitted cake, we can think of cutting a cake with $n$ planar cuts, and then cutting the slit. But the slit is just like an $(n+1)$st planar cut, except that because it doesn't reach the edges of the cake, there must be (at least) two pieces of cake that it doesn't manage to separate. Therefore, the maximum slitted cake/torus number of pieces with $n$ cuts is just the maximum number of pieces you can cut a cake into with $n+1$ cuts, minus two. But the cake numbers $C(n)$ are already well known; see https://oeis.org/A000125 for a proof that $C(n) = (n^3+5n+6)/6$.



Finally, substituting gives us the torus formula $f(n) = C(n+1) - 2 = ((n+1)^3+5(n+1)+6-12)/6 = (n^3+3n^2+8n)/6$, as expected.






share|cite|improve this answer









$endgroup$













    Your Answer








    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "69"
    ;
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function()
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled)
    StackExchange.using("snippets", function()
    createEditor();
    );

    else
    createEditor();

    );

    function createEditor()
    StackExchange.prepareEditor(
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader:
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    ,
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    );



    );













    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146697%2fproof-that-n-planes-cut-a-solid-torus-into-a-maximum-of-frac16n33n28n%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    2





    +50







    $begingroup$

    Here's the intuitive explanation, which can be made rigorous: The maximum number of pieces is not going to change if you change the relative size of the donut and the hole, or if you stretch the donut in one direction. So you can think of a fat, sort of cigar-shaped, donut with a very skinny long hole in it. In fact, taking this equivalence to its logical extreme, you'll get the same number of pieces if your donut is just a cake with a slit cut through the middle of it (the slit does not touch any side of the cake, so from above it looks like $Theta$ -- notice how the crossbar does not actually touch the outer circle).



    Now, instead of starting with a slitted cake, we can think of cutting a cake with $n$ planar cuts, and then cutting the slit. But the slit is just like an $(n+1)$st planar cut, except that because it doesn't reach the edges of the cake, there must be (at least) two pieces of cake that it doesn't manage to separate. Therefore, the maximum slitted cake/torus number of pieces with $n$ cuts is just the maximum number of pieces you can cut a cake into with $n+1$ cuts, minus two. But the cake numbers $C(n)$ are already well known; see https://oeis.org/A000125 for a proof that $C(n) = (n^3+5n+6)/6$.



    Finally, substituting gives us the torus formula $f(n) = C(n+1) - 2 = ((n+1)^3+5(n+1)+6-12)/6 = (n^3+3n^2+8n)/6$, as expected.






    share|cite|improve this answer









    $endgroup$

















      2





      +50







      $begingroup$

      Here's the intuitive explanation, which can be made rigorous: The maximum number of pieces is not going to change if you change the relative size of the donut and the hole, or if you stretch the donut in one direction. So you can think of a fat, sort of cigar-shaped, donut with a very skinny long hole in it. In fact, taking this equivalence to its logical extreme, you'll get the same number of pieces if your donut is just a cake with a slit cut through the middle of it (the slit does not touch any side of the cake, so from above it looks like $Theta$ -- notice how the crossbar does not actually touch the outer circle).



      Now, instead of starting with a slitted cake, we can think of cutting a cake with $n$ planar cuts, and then cutting the slit. But the slit is just like an $(n+1)$st planar cut, except that because it doesn't reach the edges of the cake, there must be (at least) two pieces of cake that it doesn't manage to separate. Therefore, the maximum slitted cake/torus number of pieces with $n$ cuts is just the maximum number of pieces you can cut a cake into with $n+1$ cuts, minus two. But the cake numbers $C(n)$ are already well known; see https://oeis.org/A000125 for a proof that $C(n) = (n^3+5n+6)/6$.



      Finally, substituting gives us the torus formula $f(n) = C(n+1) - 2 = ((n+1)^3+5(n+1)+6-12)/6 = (n^3+3n^2+8n)/6$, as expected.






      share|cite|improve this answer









      $endgroup$















        2





        +50







        2





        +50



        2




        +50



        $begingroup$

        Here's the intuitive explanation, which can be made rigorous: The maximum number of pieces is not going to change if you change the relative size of the donut and the hole, or if you stretch the donut in one direction. So you can think of a fat, sort of cigar-shaped, donut with a very skinny long hole in it. In fact, taking this equivalence to its logical extreme, you'll get the same number of pieces if your donut is just a cake with a slit cut through the middle of it (the slit does not touch any side of the cake, so from above it looks like $Theta$ -- notice how the crossbar does not actually touch the outer circle).



        Now, instead of starting with a slitted cake, we can think of cutting a cake with $n$ planar cuts, and then cutting the slit. But the slit is just like an $(n+1)$st planar cut, except that because it doesn't reach the edges of the cake, there must be (at least) two pieces of cake that it doesn't manage to separate. Therefore, the maximum slitted cake/torus number of pieces with $n$ cuts is just the maximum number of pieces you can cut a cake into with $n+1$ cuts, minus two. But the cake numbers $C(n)$ are already well known; see https://oeis.org/A000125 for a proof that $C(n) = (n^3+5n+6)/6$.



        Finally, substituting gives us the torus formula $f(n) = C(n+1) - 2 = ((n+1)^3+5(n+1)+6-12)/6 = (n^3+3n^2+8n)/6$, as expected.






        share|cite|improve this answer









        $endgroup$



        Here's the intuitive explanation, which can be made rigorous: The maximum number of pieces is not going to change if you change the relative size of the donut and the hole, or if you stretch the donut in one direction. So you can think of a fat, sort of cigar-shaped, donut with a very skinny long hole in it. In fact, taking this equivalence to its logical extreme, you'll get the same number of pieces if your donut is just a cake with a slit cut through the middle of it (the slit does not touch any side of the cake, so from above it looks like $Theta$ -- notice how the crossbar does not actually touch the outer circle).



        Now, instead of starting with a slitted cake, we can think of cutting a cake with $n$ planar cuts, and then cutting the slit. But the slit is just like an $(n+1)$st planar cut, except that because it doesn't reach the edges of the cake, there must be (at least) two pieces of cake that it doesn't manage to separate. Therefore, the maximum slitted cake/torus number of pieces with $n$ cuts is just the maximum number of pieces you can cut a cake into with $n+1$ cuts, minus two. But the cake numbers $C(n)$ are already well known; see https://oeis.org/A000125 for a proof that $C(n) = (n^3+5n+6)/6$.



        Finally, substituting gives us the torus formula $f(n) = C(n+1) - 2 = ((n+1)^3+5(n+1)+6-12)/6 = (n^3+3n^2+8n)/6$, as expected.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 31 at 4:48









        Glen WhitneyGlen Whitney

        471311




        471311



























            draft saved

            draft discarded
















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid


            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.

            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function ()
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3146697%2fproof-that-n-planes-cut-a-solid-torus-into-a-maximum-of-frac16n33n28n%23new-answer', 'question_page');

            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

            random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

            Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye