In CLRS (Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein), for a function
f(n) = an2 + bn
P(n) = an2 + bn + c = an2( 1 + b / ( an ) + c / ( an2 )) = an2( 1 ± ( | b | / a ) / n ± ( √( | c | / a ) / n )2
so if we take for example q = max( | b | / a, √( | c | / a )) than
P(n) ≤ an2( 1 + ( q / n ) + ( q / n )2 ) and if we take n0 = q than we'll get the second constant
c2 = 3a analogically for the lower bound