# Trouble understanding Big O notation for a sum of n integers [duplicate]

This problem is an example in a Discrete Math textbook. How can big-O notation be used to estimate the sum of the first n positive integers?

Solution: Because each of the integers in the sum of the first n positive integers does not exceed n, it follows that $$1+2+...+n \le n+n+...+n=n^2$$ From this inequality it follows that $1+2+...+n$ is $O(n^2)$.

I do not understand how the sum of $n$'s is equal to $n^2$. Can anyone explain to me what the book used to get this?

## marked as duplicate by Antonio Vargas, ml0105, M Turgeon, apnorton, user61527 May 1 '14 at 17:16

• I'm confused as to why you'd want to estimate the sum of the first n positive integers since this is a well-known formula $\frac{n(n+1)}{2}$. – EgoKilla May 1 '14 at 1:54
• How many "$n$"s are in the sum "$n+n+\cdots+n$"? – Eric Towers May 1 '14 at 1:55

The sum of $n$ $n$'s is $n \cdot n$, by definition. $n \cdot n = n^2$.
First, you note that$$1+2+\ldots+n = \frac{n^2+n}{2}$$ Since this is a quadratic polynomial, follows that it is $O(n^2)$.