explain xkcd - User contributions [en]

Talk:3131: Cesium

2025-08-20T18:56:40Z

94.73.52.245:

I think that's called a recipe for disaster. NOTE: I am also 104.225.172.143. [[Special:Contributions/138.43.101.123|138.43.101.123]] 14:36, 20 August 2025 (UTC)
: No, ''I'' am 104.225.172.143! [[Special:Contributions/82.13.184.33|82.13.184.33]] 15:09, 20 August 2025 (UTC)

My best recipe comes with a Notice to Mariners [[User:Hcs|Hcs]] ([[User talk:Hcs|talk]]) 14:45, 20 August 2025 (UTC)

I added a transcript. Hopefully it's okay. [[Special:Contributions/104.225.172.143|104.225.172.143]] 14:54, 20 August 2025 (UTC)

A gram of gold runs on the order of ~$100 USD as of writing; a gram of cs-137 looks to be in the millions~billions range. --[[Special:Contributions/158.91.163.9|158.91.163.9]] 14:55, 20 August 2025 (UTC)
:Caesium contamination usually is caused by nuclear accidents (or atmospheric nuclear weapon tests) https://en.wikipedia.org/wiki/Caesium-137#Environmental_contamination. It is unlikely that someone acquired pure Cs-137 and then "accidentally" contaminated the shrimp with that. --[[Special:Contributions/134.102.219.31|134.102.219.31]] 15:31, 20 August 2025 (UTC)

Bothering the NSA shouldn't be hard, just write some of their secrets on a cake (with frosting is optional) and post it online. [[Special:Contributions/212.101.26.209|212.101.26.209]] 14:57, 20 August 2025 (UTC)

What would IMO do, revoke your math license? [[Special:Contributions/216.73.162.10|216.73.162.10]] 15:22, 20 August 2025 (UTC)
: They have numerous penalties at their disposal. [[Special:Contributions/82.13.184.33|82.13.184.33]] 15:27, 20 August 2025 (UTC)
: I imagined the reason the IMO would get involved would be because the recipe created some interesting mathematical problem that could be used for the next competition. For example, something like [https://www.youtube.com/watch?v=Ct3lCfgJV_A this video], where a grocery order taken too literally creates a seemingly harmless Diophantine equation whose smallest positive solutions are on the order of 10^80. [[Special:Contributions/137.25.230.78|137.25.230.78]] 15:56, 20 August 2025 (UTC)

Maybe The IATA could get involved if your ruined recipe caused food poisoning on a commercial airliner that then resulted in an in-air emergency (whole flight deck passed out).
:Or if you create a column of dense toxic fumes that spreads over a wide area (on the level of a volcano eruption). On the other hand, I wonder what could bring the attention of the IMO when Terryology seemingly couldn't.--[[Special:Contributions/94.73.52.245|94.73.52.245]] 18:56, 20 August 2025 (UTC)

Talk:3125: Snake-in-the-Box Problem

2025-08-06T23:19:09Z

94.73.52.245:

The math problem in question is https://oeis.org/A099155 [[User:Mei|Mei]] ([[User talk:Mei|talk]]) 21:57, 6 August 2025 (UTC)

why is d>8 unsolved? stevethenoob 21:59, 6 August 2025 (UTC)
:Computational power, I guess, although I'm going to go out on a limb and predict that for N=9 snake=196. [[Special:Contributions/94.73.52.245|94.73.52.245]] 23:18, 6 August 2025 (UTC)

I would argue that computer science has one as well with the China room problem. [[User:Ctinsman|Ctinsman]] ([[User talk:Ctinsman|talk]]) 22:14, 6 August 2025 (UTC)

: Humans aren't cute animals (mostly), so I propose a variant of the problem called the Chinese Red Panda Room [[Special:Contributions/177.12.49.23|177.12.49.23]] 22:38, 6 August 2025 (UTC)

Interesting. Just a few days ago I was investigating a very similar idea (looking at a path that transitioned between adjacent ''faces'' of a polyhedron, which was effectively going from vertex to connected vertex upon that chosen polyhedron's ''dual''), but for the opposite reason, i.e. looking for the paths that actually maximised proximity (along the path) between neighbouring faces (upon the polyhedra), so that it actually minimised the search back/forth along the path-chain to establish what value the adjacent polyhedron faces (beyond the ones automatically at ±1 positions on the chain) inherited.
 As to solving this one (basically disallowing visiting of any nodes adjacent to prior visits ''other'' than the single one that the +1 position of the chain has to first go to), I've got a basic idea of how I'd N-dimensionally space-search the possible routes (after all, visiting any given node at {0,1} value for dimensions [a, b, c, ...] rules out now visiting all of [!a, b, c, ...], [a, !b, c, ...], [a, b, !c, ...], etc, ''except'' whichever one of these was chosen for the next step of onward travel), for valid foldings across the appropriate N-polytype cuboidal analogue. Though I suspect that the exponental (or greater!) growth in the potential search-trees you'd use would be the sticking point. No point in setting off an exhaustive algorithm if it seemed likely to take three years to check just 1% of possibilities, and no doubt more dedicated analysis than my own brute-forcing method has already hit other problems in trying a more nuanced extrapolation between each level of added dimensionality, which is where the unsolved nature of this starts to bite.
 But also think it'd be far more interesting to investigate the possibilities in the N>3-Dimensional extensions of non-cubic platonic solids, like the {{w|600-cell}} and beyond, and establish what allowable lengths of traversal ''they'' would allow, under similar stipulations.
 Great! I love getting things like this to think about. If I can spare the time needed... [[Special:Contributions/82.132.245.59|82.132.245.59]] 22:22, 6 August 2025 (UTC)
: I think you've been nerd-sniped. [[Special:Contributions/177.12.49.23|177.12.49.23]] 22:42, 6 August 2025 (UTC)

Psychology is way ahead of y'all, they've been putting actual mice in weird boxes for ''decades''. [[Special:Contributions/177.12.49.23|177.12.49.23]] 22:45, 6 August 2025 (UTC)

Reading (just) the comments of the underlying research suggests that 98 is the longest found snake. Perhaps that means a longer one has not been explicitly eliminated (making 8 also not solved to some extent) [[Special:Contributions/2A02:A45B:8867:0:BED8:F2BA:838E:765|2A02:A45B:8867:0:BED8:F2BA:838E:765]] 22:52, 6 August 2025 (UTC)

I suppose Randall doesn't consider beetles cute, or else [https://en.wikipedia.org/wiki/Philosophical_Investigations#Wittgenstein's_beetle philosophy of language] would be included. [[Special:Contributions/137.25.230.78|137.25.230.78]] 23:15, 6 August 2025 (UTC)

Talk:3125: Snake-in-the-Box Problem

2025-08-06T23:18:20Z

94.73.52.245:

The math problem in question is https://oeis.org/A099155 [[User:Mei|Mei]] ([[User talk:Mei|talk]]) 21:57, 6 August 2025 (UTC)

why is d>8 unsolved? stevethenoob 21:59, 6 August 2025 (UTC)
:Computational power, I guess, although I'm going to go out on a limb and predict that for N=9 snake=196.[[Special:Contributions/94.73.52.245|94.73.52.245]] 23:18, 6 August 2025 (UTC)

I would argue that computer science has one as well with the China room problem. [[User:Ctinsman|Ctinsman]] ([[User talk:Ctinsman|talk]]) 22:14, 6 August 2025 (UTC)

: Humans aren't cute animals (mostly), so I propose a variant of the problem called the Chinese Red Panda Room [[Special:Contributions/177.12.49.23|177.12.49.23]] 22:38, 6 August 2025 (UTC)

Interesting. Just a few days ago I was investigating a very similar idea (looking at a path that transitioned between adjacent ''faces'' of a polyhedron, which was effectively going from vertex to connected vertex upon that chosen polyhedron's ''dual''), but for the opposite reason, i.e. looking for the paths that actually maximised proximity (along the path) between neighbouring faces (upon the polyhedra), so that it actually minimised the search back/forth along the path-chain to establish what value the adjacent polyhedron faces (beyond the ones automatically at ±1 positions on the chain) inherited.
 As to solving this one (basically disallowing visiting of any nodes adjacent to prior visits ''other'' than the single one that the +1 position of the chain has to first go to), I've got a basic idea of how I'd N-dimensionally space-search the possible routes (after all, visiting any given node at {0,1} value for dimensions [a, b, c, ...] rules out now visiting all of [!a, b, c, ...], [a, !b, c, ...], [a, b, !c, ...], etc, ''except'' whichever one of these was chosen for the next step of onward travel), for valid foldings across the appropriate N-polytype cuboidal analogue. Though I suspect that the exponental (or greater!) growth in the potential search-trees you'd use would be the sticking point. No point in setting off an exhaustive algorithm if it seemed likely to take three years to check just 1% of possibilities, and no doubt more dedicated analysis than my own brute-forcing method has already hit other problems in trying a more nuanced extrapolation between each level of added dimensionality, which is where the unsolved nature of this starts to bite.
 But also think it'd be far more interesting to investigate the possibilities in the N>3-Dimensional extensions of non-cubic platonic solids, like the {{w|600-cell}} and beyond, and establish what allowable lengths of traversal ''they'' would allow, under similar stipulations.
 Great! I love getting things like this to think about. If I can spare the time needed... [[Special:Contributions/82.132.245.59|82.132.245.59]] 22:22, 6 August 2025 (UTC)
: I think you've been nerd-sniped. [[Special:Contributions/177.12.49.23|177.12.49.23]] 22:42, 6 August 2025 (UTC)

Psychology is way ahead of y'all, they've been putting actual mice in weird boxes for ''decades''. [[Special:Contributions/177.12.49.23|177.12.49.23]] 22:45, 6 August 2025 (UTC)

Reading (just) the comments of the underlying research suggests that 98 is the longest found snake. Perhaps that means a longer one has not been explicitly eliminated (making 8 also not solved to some extent) [[Special:Contributions/2A02:A45B:8867:0:BED8:F2BA:838E:765|2A02:A45B:8867:0:BED8:F2BA:838E:765]] 22:52, 6 August 2025 (UTC)

I suppose Randall doesn't consider beetles cute, or else [https://en.wikipedia.org/wiki/Philosophical_Investigations#Wittgenstein's_beetle philosophy of language] would be included. [[Special:Contributions/137.25.230.78|137.25.230.78]] 23:15, 6 August 2025 (UTC)