I am self studying the book of introduction to algorithms third edition by Thomas H. Cormen, Charles E. leiserson, Ronald L Rivest etc.

I am stumbling about these problems in the appendix A and i am unfamiliar with the math introduced here: (Big O notation, Bounded summation, Summation and products etc.). There is also appendix B and C Which is titled "Sets" and "Probabiliy" and i have little background in also some formulas very difficult to understand.

Here are the sample problems by the way.