John Carlos Baez on Nostr: Wow! If the side length of this "Sierpiński triangle" is 1, the average distance ...
Wow! If the side length of this "Sierpiński triangle" is 1, the average distance between its points is 466/885.
Double wow! The average number of moves in a shortest path between two random states in the n-disc Tower of Hanoi puzzle is asymptotically (466/885)·2ⁿ as n → ∞.
(1/n)
Published at
2026-07-18 15:21:05 UTCEvent JSON
{
"id": "ff53a498ace78dfed74756b08ff2cd3a1bac04b983b942db4d4859bd0ea0e39e",
"pubkey": "9a6a1a8eefd0b53d7e0c966ab35bd904151246f03b1be98fa0d2d0eeb4940320",
"created_at": 1784388065,
"kind": 1,
"tags": [
[
"proxy",
"https://mathstodon.xyz/@johncarlosbaez/116941656281519059",
"web"
],
[
"imeta",
"url https://media.mathstodon.xyz/media_attachments/files/116/941/648/918/120/080/original/0486b5e72611e3e6.png",
"m image/png"
],
[
"proxy",
"https://mathstodon.xyz/users/johncarlosbaez/statuses/116941656281519059",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://mathstodon.xyz/users/johncarlosbaez/statuses/116941656281519059",
"pink.momostr"
],
[
"-"
]
],
"content": "Wow! If the side length of this \"Sierpiński triangle\" is 1, the average distance between its points is 466/885. \n\nDouble wow! The average number of moves in a shortest path between two random states in the n-disc Tower of Hanoi puzzle is asymptotically (466/885)·2ⁿ as n → ∞. \n\n(1/n)\nhttps://media.mathstodon.xyz/media_attachments/files/116/941/648/918/120/080/original/0486b5e72611e3e6.png\n",
"sig": "d5924309f9f298e8d68a195f6a249243d21897a3ffbc5aada98c196214cba9459faccec40713a54972af94bb8f11c6ab62f2447336eaf2e327fd18867d9e60f2"
}
