Very cool! There's definitely some similarity to Ramanujan Sums, though the approach here sort of packages the fizz-buzz divisibility properties into one function.
https://en.wikipedia.org/wiki/Ramanujan%27s_sum
I can recommend the book Guide to Graph Colouring: Algorithms and Applications by Lewis. It covers techniques including some state of the art methods for getting good but not provably optimal colorings. It discusses in depth local search and hybrid evolutionary algorithms, which tend to be the best performing on academic benchmarks (DIMACS graphs and large random graphs).
That is cool! But no, Music for Hackers was a great combo of ambient/underground music overlaid with old movie audio samples and other stuff. Played from maybe 2000-2008 or something? Can't remember when it died.
I have very fond memories of Music for Hackers ("soundscapes for compromising a remote host"). Have never found anything that fills that particular niche the same way.
Hackers Delight is a pretty fun book on low level algorithms. Lots of little tidbits like how to convert a divide by a constant into a multiple by a different constants and a shift. Thought these days the compilers are good enough to do the same thing but now when you look at the resulting assembly you can figure out how they are doing that.
Even if compilers are usually good enough, people (mostly in the market making/HFT space) are still doing this kind of stuff. For example, division (and to a lesser extent, multiplication) is still avoided/hacked around in the fast path for these kinds of strategies.
That's a good call-out. It's natural for me, but I do see people struggle with bit manipulation regularly. A comprehensive, yet plain language intro, with simple examples, is really useful.
You can tell this was developed after extensive interactions with undergrads. It's really well done.
Penn State has a bunch of their graduate stats courses online [1]. I worked through some of their time series class [2] and found it to be pretty good quality.
