I think maybe it may be solved in this way:
Assume that $x^n+p^{n+1}$ is reducible over $\mathbb{Z}[x]$, then there exists two monic polynomials $g,h \in \mathbb{Z}[x]$ such that
$$x^{n}+p^{n+1} = g(x)\cdot h (x)$$
Now let $x = py$ and note that $\deg(g)+\deg(h) = n$, we can cancel out $p^n$ on both sides to get
$$ y^n+p = g_1(y)\cdot h_1(y)$$
for some $g_1,h_1 \in \mathbb{Q}[y]$ are monic. Now if $\deg(g_1),\deg(h_1) >1$, this contradicts the irreducibility of $y^n+p$ in $\mathbb{Q}[y]$ by Eisenstein criterion. So exactly one of $g_1,h_1$ has degree $0$, which means it is a constant. WLOG, let $\deg(g_1)=0$. But $\deg(g) = \deg(g_1)=0$, thus $g(x)$ must be identically an integer. Since the leading coefficient of $x^n+p^{n+1}$ is $1$, the only choice is $g=1$. By definition, the given polynomial must be irreducible.