In substitution method, using induction for proving the general case for n

In substitution method, using induction for proving the general case for n always ignore the lower order term only consider the lower order terms without ignoring lower order terms, we must prove exact inequality. proving for any ken is sufficient Moving to another question will save this response