Viewing profile — bustermellotron

Size of a finite set. It’s common notation in this field.

The grid of squares actually gets > Cn for any C. (More in fact… C can grow like n^a/loglog(n).) The AI proved > n^{1 + b} for some small b > 0, which a human (Will Sawin) has now …

You could use air scrubbers https://en.wikipedia.org/wiki/Soda_lime

I saw Tim Gowers give a talk at the AMS-MAA joint meeting in Seattle about ten years ago where he predicted that in 100 years humans would no longer be doing research mathematics. …

Go go Gadget arms!

I found it easy to adapt to the x-bows keyboard (column staggered and splayed). The thumb buttons and large ctrl, alt, space are great for emacs. My only complaint is that the brac…

I think the book "The Now Habit" discusses this well. (Could be another book though...) I once completed a 3000 mile cycling tour across the US (and didn't take ADHD meds while on …

This covers most of what you need for "housekeeping" scripts in Python: https://automatetheboringstuff.com

On the other hand, your proof really only needs the binomial theorem and geometric series.

The “claim” more or less proves that k-1 th root of k is less than 2 if k is larger than 2. So I think your argument is equivalent.

Here is an elementary proof: Since m and n are distinct, we may assume that m > n >= 2. From the equation and unique factorization, we know that n divides m, so write m = nd. Then …