This is indeed a very fun problem, so I couldn't resist making a quick @observablehq notebook for it https://observablehq.com/@mourner/collatz-conjecture-3x-1 … — thank you @michael_nielsen @AlexKontorovich!https://twitter.com/michael_nielsen/status/1172915708038004736 …
-
-
Replying to @mourner @observablehq and
Heh, I made something similar yesterday!https://observablehq.com/@bryangingechen/3x-1-paths-in-binary …
1 reply 0 retweets 5 likes -
Replying to @blockspins @mourner and
bgc Retweeted bgc
It's buried in the thread here:https://twitter.com/blockspins/status/1173645713345064960 …
bgc added,
1 reply 0 retweets 0 likes -
Replying to @blockspins @observablehq and
Heh, I suspected someone already did it! Anyway, really cool to explore this. I was also surprised by how fast BigInts work in modern browsers — the chart updates very fast in my notebook even for very big numbers.
1 reply 0 retweets 2 likes
Replying to @mourner @observablehq and
Agreed about the performance! Though I had an amusing early bug with a while loop that checked for n === 1 with n a BigInt...
9:32 AM - 17 Sep 2019
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.