Answer: P(x)=x2+1x(x4k+2+1) or P(x)=x2+1x(1−x4k) Solution: It is straightforward to plug in and verify the above answers. Hence, we focus on showing that these are all possible solutions. The key claim is the following. Claim: If r=0 is a root of P(z) with multiplicity n, then 1/r is also a root of P(z) with multiplicity n. Proof 1 (Elementary). Let n′ be the multiplicity of 1/r. It suffices to show that n≤n′ because we can apply the same assertion on 1/r to obtain that n′≤n. To that end, suppose that (z−r)n divides P(z). From the equation, we have zN[P(z1)+P(z)]=zN[(z+z1)P(z)P(z1)] where N≫degP+1 to guarantee that both sides are polynomial. Notice that the factor zNP(z) and the right-hand side is divisible by (z−r)n, so (z−r)n must also divide zNP(z1). This means that there exists a polynomial Q(z) such that zNP(z1)=(z−r)nQ(z). Replacing z with z1, we get zNP(z)=(z1−r)nQ(z1)⟹P(z)=zN−n(1−rz)nQ(z1) implying that P(z) is divisible by (z−1/r)n. Proof 2 (Complex Analysis). Here is more advanced proof of the main claim. View both sides of the equations as meromorphic functions in the complex plane. Then, a root r with multiplicity n of P(z) is a pole of P(z)1 of order n. Since the right-hand side is analytic around r, it follows that the other term P(1/z)1 has a pole at r with order n as well. By replacing z with 1/z, we find that P(z)1 has a pole at 1/r of order n. This finishes the claim. The claim implies that there exists an integer k and a constant ϵ such that P(z)=ϵzkP(z1) By replacing z with 1/z, we get that zkP(z1)=ϵP(z) Therefore, ϵ=±1. Moreover, using the main equation, we get that P(z)1+P(z)ϵzk=z+z1⟹P(z)=1+z2z(1+ϵzk) This is a polynomial if and only if (ϵ=1 and k≡2(mod4)) or (ϵ=−1 and k≡0(mod4)), so we are done.