>>11787645>>11787684Lmao half of concrete math is continous (literally CON from continuous and CRETE from discrete)
The majority of the latter chapters of Knuth's book hail from analysis and generating functions, and are definitely nontrivial, especially if all you've done is discrete mathematics.
CLRS isn't super *hard* but it's comprehensive and full of material - more than a month's worth for sure, if you want to do everything.
Theory of Computation by Sipser is legitimately very easy though, and can be done in about a month up to complexity. That's the only "trivial" one on the list.
