In the Introduction to algorithms book, the definition of Θ(g(n)) is given by:
Θ(g(n)) = { f(n): there exist positive constants c1, c2, and n