Possible Duplicate:
Number of elements in the set {1,…,n}*{1,..,n}
Writing $[n]$ for the set $\lbrace1,2,...,n\rbrace$, let $P_n$ denote the product set $[n].[n]$, i.e. $$ P_n = \lbrace ab : a,b \in [n]\rbrace .$$
Since the set $[n]$ is quite far from looking like a geometric progression, one would suspect that the set $P_n$ is quite large. Let $$ c_n = \frac{|P_n|}{n^2} .$$
I was hoping to find out what the asymptotics are for $c_n$; I suspect the answer is well known to additive combinatorialists. In particular, is $c_n$ bounded away from $0$ or is it $o(1)$?
@everyone: Thanks for all the references.
@quid: Thank you, that sort of estimate will suffice for my purposes.
To those wondering, I'd asked if there were any obvious ways of lower bounding $c_n$.
– user31074 Apr 18 '13 at 18:29