We know that symmetric Boolean functions are easy to compute because they only depend upon the number of 1's in the input.
So one can ask the same question for symmetric polynomials also. In this work, we show that there exist hard symmetric polynomials whose arithmetic complexity is super polynomial (assuming VP \neq VNP). The main tool used in proving this result is the so called "Newton's Iteration" for power series.