Thanks for the shoutout! I've recently added all of these problems to my website so that you no longer have to download the PDF.

Two in a row for Amarnath Murthy!

If you like that, you might like this challenge codegolf.stackexchange.com/q/214638/53884 based on OEIS sequence oeis.org/A337517 (the number of distinct resistances that can be produced from a circuit with exactly n unit resistors.)

I just heard from David that he found (and fixed!) a subtle bug in the collision checking.

It turns out that you can have two tetrahedra, T₁ and T₂ whose interiors intersect, but where T₁ (in red) does not have any edges that intersect T₂'s faces, as shown in this illustration that David sent me.

instead of time zones and daylight savings clocks should all be UTC and in some parts of the world, people eat lunch at 3AM

Thanks to David Ellsworth's work with some clever mathematical ideas and C++ tricks, the largest known term of the sequence has increased from A276272(5) = 10 to A276272(17) = 1848740638 > 1.8 billion!

If you have a StackExchange account, I'd encourage you to go and upvote his incredible work!

The 35 was the perfect line for me for many seasons of my life! I took it from the suburbs to PSU when I was a student there, to UP for four years to visit my (now) wife, from John’s Landing to downtown when l was working in software…

I recently wrote a story about Peter Putnam, a forgotten physicist-turned-janitor with a groundbreaking theory of the mind, for @nautil.us. I was able to piece together Putnam's incredible story thanks to a few people who kept the ember of his work glowing for decades after his tragic death.

Finally registered! See you in San Francisco!

Made poutine tonight to celebrate 🇨🇦

Fixed both of them—thanks for letting me know!