I'm not such a fan of trying to cram everything-mathematically-relevant into a single huge book (and it is huge - 1048 pages).

Anyway, this reminds me of a rather different initiative in the same vein: The building of Mathematical principles based on the expediences of Computer Science: CONCRETE MATHEMATICS

by Donald Knuth, Ronald Graham and Oren Patashnik.

https://www-cs-faculty.stanford.edu/~knuth/gkp.html

https://en.wikipedia.org/wiki/Concrete_Mathematics

available on the Internet Archive: https://archive.org/download/concrete-mathematics/Concrete%2...

▲

generationP 2 days ago | parent [-]

Graham/Knuth/Patashnik is a lot less "basic discrete maths you're most likely to need" and a lot more "number sequences we've known and loved". Almost more useful for physicists due to the amount of summation fu you'll learn there.

	▲	svat a day ago \| parent [-]
		The book Concrete Mathematics started as course notes for a class whose textbook initially was the (dense) "Mathematical Preliminaries" chapter of The Art of Computer Programming (Chapter 1 and roughly the first half of Volume 1), so it can be seen as an expanded and leisurely (and even more delightful, because of all the student jokes and other marginalia) version of that chapter. This is mathematics that Knuth needed for the rest of TAOCP. So it's more "mathematics for the analysis of algorithms" (incidentally the title of another book by Greene and co-authored by Knuth), and so probably most applicable to the field of "AofA" rather than physics or computer science in general. Lovely book, very few math books fill one with as much joy as this one.