Difference between revisions of "Talk:2740: Square Packing"
(will it blend?) |
|||
| Line 19: | Line 19: | ||
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 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) | ||
Revision as of 09:28, 22 February 2023
I suspect Randall saw the same social media post that I did (or maybe a repost of the same social media post, who knows or cares). I don't really want to make an explanation, but anyone who does, here's a link to a bunch of square packing findings... of course, no hydraulic press allowed for these packings. https://erich-friedman.github.io/packing/squinsqu/ Tsumikiminiwa (talk) 22:07, 20 February 2023 (UTC)
- Yeah, this was on r/mathmemes the other day. 172.64.238.48 00:03, 21 February 2023 (UTC)
Welcome to the Hydraulic Press Channel. Today we have a set of squares that are usually used in packing problems. You are supposed to fit them into other squares by arranging them. But I think we can get them to fit easier if we put them on the press, and just try to make them smaller. We are going to start with one square, and see how much smaller we can make this. And here we go.
- Needs to include a mention of the "Square Packer Five Meeellion"... 172.68.51.141 16:48, 21 February 2023 (UTC)
The post where I saw this said: “God is dead, and what killed him was learning [the similarly inelegant-appearing n=17 solution].” 172.70.254.216 13:08, 21 February 2023 (UTC)
172.70.54.77 19:26, 21 February 2023 (UTC) Welcome to the Hydraulic Press channel
What does "s<" mean? 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.) 172.71.242.191 23:17, 21 February 2023 (UTC)
I think I saw this new solution in a paper authored by USPS et al. 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. --172.69.79.133 09:28, 22 February 2023 (UTC)
