CTK Exchange
CTK Wiki Math
Front Page
Movie shortcuts
Personal info
Awards
Terms of use
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about Search CTK Buying a book is a commitment to learning Table of content Products to download and subscription Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "Gardner's Torus cutting puzzle... 13 pieces?"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange This and that Topic #775
Reading Topic #775
itineracy
Member since Jul-29-07
Jul-29-07, 08:31 AM (EST)
Click to EMail itineracy Click to send private message to itineracy Click to view user profileClick to add this user to your buddy list  
"Gardner's Torus cutting puzzle... 13 pieces?"
 
   In a well-known puzzle, Martin Gardner asked for the maximum number of pieces into which a torus could be sliced by three planes. Based on the formula X(n)=(n^3+3n^2+8n)/6 for n planes, the answer is given as 13.

The formula however, assumes the torus to be a solid, where I thought a torus was supposed to be a surface.
Now, when slicing the torus in such a way that it would produce 13 pieces if it were a donut, it actually produces 14 pieces if it were an inner tube (see attached image).

My question: is there a way to modify the above formula for solid pieces in order to yield the number of surface pieces, or do I have to go about it in an entirely different manner?

Yours truly,
Walter

Attachments
https://www.cut-the-knot.org/htdocs/dcforum/User_files/46ac73787316dae1.gif

  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
Predrag
guest
Aug-20-07, 01:36 PM (EST)
 
1. "RE: Gardner's Torus cutting puzzle... 13 pieces?"
In response to message #0
 
   There is (and it isn't very complicated).
Surely,you must be crazy of happiness due to great interest
and all the help you received about your question here,mustn't you?
Just like me..
Well Walter,solve/show me how to solve any of my two problems here:
https://www.cut-the-knot.org/htdocs/dcforum/DCForumID4/770.shtml

and I'll give you your formulae.

regards,
Predrag


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
Itineracy
guest
Dec-23-07, 08:48 AM (EST)
 
2. "RE: Gardner's Torus cutting puzzle... 13 pieces?"
In response to message #1
 
   Hi Predrag,

I totally forgot about me having posted my question here... :-O
So much for the huge delay in answering to your response...

Interesting puzzles you put up.
Re: https://www.mathlinks.ro/Forum/viewtopic.php?t=70759
I think the solution would be A3F1
I'll be happy to provide you with the rationale of that, but will not do so on this public forum... If my solution is the correct one, that would spoil the fun somewhat, me reckons...

Cheers


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
itineracy
guest
Nov-02-08, 11:22 PM (EST)
 
3. "RE: Gardner's Torus cutting puzzle... 13 pieces?"
In response to message #1
 
   I think I found it: 2^(c+1)-2, where c is the number of cuts...

Thanks for the input.
And please feel free to comment, should I be mistaken... :P


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top
itineracy
guest
Jan-02-09, 10:10 AM (EST)
 
4. "RE: Gardner's Torus cutting puzzle... 13 pieces?"
In response to message #3
 
   Hm... 2^(c+1) - 2 doesn't seem to bring home the bacon...
I'm more inclined to (c^3 + 5c) / 3 now... Hard time proving it, though...


  Alert | IP Printer-friendly page | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to have a look at the old CTK Exchange archive.
Please do not post there.

Copyright © 1996-2018 Alexander Bogomolny

Search:
Keywords:

Google
Web CTK