| Latest revision |
Your text |
| Line 13: |
Line 13: |
| | [[Special:Contributions/172.70.54.77|172.70.54.77]] 19:26, 21 February 2023 (UTC) | | [[Special:Contributions/172.70.54.77|172.70.54.77]] 19:26, 21 February 2023 (UTC) |
| | Welcome to the Hydraulic Press channel | | Welcome to the Hydraulic Press channel |
| − |
| |
| − | What does "s<" mean? [[User:Kev|Kev]] ([[User talk:Kev|talk]]) 22:54, 21 February 2023 (UTC)
| |
| − | :"S" (the size of the square, within which lie the N small squares) is less than the following number. i.e. that any S of that amount or greater is more than enough space to contain N unit squares. But it isn't fully established what the ''smallest'' value of S is, just that it will not be bigger than (or equal to) that provisional limit.
| |
| − | :(Do we need a wikilink to inequality notation in the explanation, then? Maybe you can tell us, Kev.) [[Special:Contributions/172.71.242.191|172.71.242.191]] 23:17, 21 February 2023 (UTC)
| |
| − | ::Please! I came to the discussion to ask that an explanation of what s means. I did have a look in the Wikipedia article about it, but they don't use it there. So an explanation in the text with perhaps a link to something that expands on the explanation would be greatly appreciated by me :-) [[Special:Contributions/172.70.91.198|172.70.91.198]] 12:45, 22 February 2023 (UTC)
| |
| − | :::Added something about this. Seems too wordy and partly a repeat of the above. Future editors will refine, no doubt. [[Special:Contributions/141.101.98.77|141.101.98.77]] 19:43, 22 February 2023 (UTC)
| |
| − | :::Well, I ''had'' added it. Someone [https://www.explainxkcd.com/wiki/index.php?title=2740:_Square_Packing&curid=26065&diff=306648&oldid=306624 rewrote it] and it now just says something not at all what the above people wanted it to say... Go figure... [[Special:Contributions/172.70.90.35|172.70.90.35]] 01:10, 23 February 2023 (UTC)
| |
| − | ::::Is there a solution to the problem of the smallest explanation into which n explanations can be packed? [[Special:Contributions/172.70.90.35|172.70.90.35]] 11:29, 23 February 2023 (UTC)
| |
| − | :::::Probably, that's [one of] the issue[s] addressed by compression algorithms. [[Special:Contributions/172.70.114.88|172.70.114.88]] 23:26, 26 February 2023 (UTC)
| |
| − |
| |
| − | I think I saw this new solution in a paper authored by USPS et al. [[Special:Contributions/108.162.216.159|108.162.216.159]] 23:33, 21 February 2023 (UTC)
| |
| − |
| |
| − | I believe we can get S<3.32 for this problem... if it will Blend. --[[Special:Contributions/172.69.79.133|172.69.79.133]] 09:28, 22 February 2023 (UTC)
| |
| − |
| |
| − | Assuming that when Randall says "some upgrades", he means the strongest hydraulic press humanity has created, what would be the compressive strength of the square in the title text? ~ [[user:megan|Megan]] <sup>she</sup>/<sub>her</sub> <sup>[[user talk:megan|talk]]</sup>/<sub>[[special:contribs/megan|contribs]]</sub> 01:57, 23 February 2023 (UTC)
| |
| − |
| |
| − | First time I've seen a citation in an Explain XKCD explanation, LOL! And if I haven't read all 2740 up until here, I'm close (MAYBE the first few hundred I skipped the explanation if I understood the comic). :) [[User:NiceGuy1|NiceGuy1]] ([[User talk:NiceGuy1|talk]]) 05:07, 26 February 2023 (UTC)
| |
| − |
| |
| − | I'm on mobile so can't easily edit it myself but I think the reference to 11 square packing in 2765: escape speed should be linked to here :) [[Special:Contributions/162.158.34.23|162.158.34.23]] 11:37, 29 September 2023 (UTC)
| |
