Sorry if the terms I'm going to use is not professional enough:) This is about the complexity analysis of an algorithm.

Let $\alpha$ be the largest zero root of the polynomial $f(x)=x^n-2x^{n-1}-x^{n-k}-2^k$, in which $k$ is a parameter. 

The question is how to choose $k$, $(k=g(n))$ in order to minimize $\alpha$?

We believe that $g$ exists because to minimize $\alpha$, the term $2^k$ requires a small $k$ while the rest needs a big $k$.

Thank you in advance for any idea.