In this article, we focuss on. sequences of polynomials with {$pm1$} coefficients constructed by recursive argument that is known as Rudin-Shapiro polynomials. The asymptotic behavior of these polynomials defines as the ratio of their 2q-norm with 2-norm to be dominated by some number depending on q or "the best" by an absolute constant. In this work we first show the conjecture holds for some finite numbers of m and then introduce a technique that give the result for any positive odd integer m whenever it holds for all pervious even numbers.