Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This question already has an answer here:

Where can I learn about solving Big-Oh problems that are written in algebra?

Such as this

$$\sum_{i=1}^{n} (3i + 2n) = O(n^2)$$

share|cite|improve this question

marked as duplicate by mixedmath Jun 25 '13 at 18:14

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

Can someone explain the process to solving/proving this perhaps? – user1766555 Mar 25 '13 at 10:58

Texts on discrete math usually cover this. Sedgewick and Flajolet's "Introduction to the analysis of algorithms" covers the manipulations to combine such notations (for deriving approximations) in chapter 4. Best presentation I've seen.

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.