Editing Talk:2626: d65536

Jump to: navigation, search
Ambox notice.png Please sign your posts with ~~~~

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 12: Line 12:
 
::I believe the suggested scheme would be to take a dodecahedron or icosohedron (either of the two duals can be used to start with) and then subdivide each face in such a manner that equally-sized (but differently distorted) hexagons – and 12 little regular pentagons of identical area fitting in at the old dodecahedron centre/the old icosahedron vertex – emerge from the required segmentation/vertex-truncation and readjustment the radiality of all new mid-edge vertices (or maybe the newer-edges' centres or the newer-faces' centres) to touch the unit sphere. If done symmetrically, it should be entirely fair.
 
::I believe the suggested scheme would be to take a dodecahedron or icosohedron (either of the two duals can be used to start with) and then subdivide each face in such a manner that equally-sized (but differently distorted) hexagons – and 12 little regular pentagons of identical area fitting in at the old dodecahedron centre/the old icosahedron vertex – emerge from the required segmentation/vertex-truncation and readjustment the radiality of all new mid-edge vertices (or maybe the newer-edges' centres or the newer-faces' centres) to touch the unit sphere. If done symmetrically, it should be entirely fair.
 
::The face-count might be troublesome, though. The twelve necessary pentagonal faces leaves 65524 hexagons, to split evenly between* either 12 or 20 zones, and it should be obvious that neither is possible**, in whole numbers, given the starting point of 2<sup>n</sup> faces...
 
::The face-count might be troublesome, though. The twelve necessary pentagonal faces leaves 65524 hexagons, to split evenly between* either 12 or 20 zones, and it should be obvious that neither is possible**, in whole numbers, given the starting point of 2<sup>n</sup> faces...
:::(* - you can, and probably will in this design, have some that cross between two of the top-level polygons, but you can fully 'donate' as many as you then fully ''get'' donated from the next face around, so it might as well be just counted as a group of whole tiles on an a set of Escher-like interlocking 'rough' polygons.)
+
:::(* - you can, and probably will in this design, have some that cross between two of the top-level polygons, but you can fully 'donate' as many as you then fully ''get'' donated from the next face around, so it might as well be just counted as a group of while tiles on an a set of Escher-like interlocking 'rough' polygons.)
:::(** - If you're using 12 zones, that's 3x4x(however many in the zone + one corner each) and there's no factor of 3 in ''any'' value that is 2<sup>n</sup>. Arranging into 20 symmetrical zones (5x4), you will find that 65524 isn't divisible by 5, either...)
+
:::(** - If you're using 12 zones, that's 3x4x(however many in the zone + one corner each) and there's no factor of 3 in '''any''' value that is 2usup>n</sup>. Arranging into 20 symmetrical zones (5x4), you will find that 65524 isn't divisible by 5, either...)
 
::You could probably arrange an N-ahedron with the number of faces being 12+(12a) or 12+(20b), for some higher value (a bit of mental arithmatic suggests 65592 might be that value) and mark all the 'excess' faces (56?) with "Roll Again!". Or perhaps some pithy motivational slogans that also convey roughly the same meaning... :P [[Special:Contributions/172.70.162.5|172.70.162.5]] 11:32, 31 May 2022 (UTC)
 
::You could probably arrange an N-ahedron with the number of faces being 12+(12a) or 12+(20b), for some higher value (a bit of mental arithmatic suggests 65592 might be that value) and mark all the 'excess' faces (56?) with "Roll Again!". Or perhaps some pithy motivational slogans that also convey roughly the same meaning... :P [[Special:Contributions/172.70.162.5|172.70.162.5]] 11:32, 31 May 2022 (UTC)
 
::Postcript: Ok, so this is my idea for face-placing. Take a D8 (octahedron) and divide each of its 8 originally triangular faces into 8192 smaller faces (alternatively, start with a cube and progressively truncate its corners towards the same end). This is not a divisible by three number (neither can you put one in the centre, the rest are divisble by three and can surround it symmetrically), but you don't need strict rotational symmetry in any way. The opposing side can reflect/copy the non-symmetry as required to create any useful symmetry across the whole of the structure (and make floored-base/upmost-face pairings, amongst other things).
 
::Postcript: Ok, so this is my idea for face-placing. Take a D8 (octahedron) and divide each of its 8 originally triangular faces into 8192 smaller faces (alternatively, start with a cube and progressively truncate its corners towards the same end). This is not a divisible by three number (neither can you put one in the centre, the rest are divisble by three and can surround it symmetrically), but you don't need strict rotational symmetry in any way. The opposing side can reflect/copy the non-symmetry as required to create any useful symmetry across the whole of the structure (and make floored-base/upmost-face pairings, amongst other things).

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)