Let $P(x)$ be a polynomial with integer coefficients of degree $d>0$. Prove that the number of distinct integer roots of $P^2(x)-1$ is at most $d+2$.
My approach: Note that $P^2(x)-1=(P(x)-1)(P(x)+1), \forall x.$ Now since $\deg P(x)=d\implies \deg(P(x)-1)=\deg(P(x)+1)=d.$ Also note that the leading coefficient of $P(x)-1$ and $P(x)+1$ are the same; let it be $a\in\mathbb{Z}$. So, let that $\alpha_1,\alpha_2,\dots,\alpha_d$ be the roots of $P(x)-1$ and $\beta_1,\beta_2,\dots,\beta_d$ be the roots of $P(x)+1$. This implies that $$P^2(x)-1=a^2(x-\alpha_1)\cdots(x-\alpha_d)(x-\beta_1)\cdots(x-\beta_d),$$ that is $\deg(P^2(x)-1)=2d$ and $\alpha_1,\dots,\alpha_d,\beta_1,\dots,\beta_d$ are its roots and $a^2$ is it's leading coefficient. Also, since $P(x)\in\mathbb{Z}[X]$, implies that, $P^2(x)-1\in\mathbb{Z}[X]$. Next note that if $\gamma$ is a root of $P(x)-1$, then $\gamma$ is not a root of $P(x)+1$. This implies that $\alpha_i\neq \beta_j, \forall 1\le i,j\le d.$
Now note that if $\alpha_i,\beta_j\in\mathbb{Z}$ for some $1\le i,j\le d,$ then $2$ is divisible by $|\alpha_i-\beta_j|$, that is $\alpha_i-\beta_j=-2,-1,1,2.$
So, for the sake of contradiction let us assume that $P^2(x)-1$ has at least $d+3$ distinct integer roots.
I was not able to make any significant progress after this. So, can someone help me proceed?