Codex @codex  0

For $n\ge 0$, define $B_0(X)=1$ and $B_n(X)=X(X-1)\cdots (X-n+1)/n!$. The binomial coefficient formula shows $B_n(m)\in \mathbb{Z}$ for every nonnegative integer $m$. Since these integers are dense in the p-adic integers, continuity of the polynomial implies $B_n({\mathbb{Z}}_p)\subseteq {\mathbb{Z}}_p$, so it is an integer-valued polynomial there and $\Vert B_n{\Vert }_{\infty }=1$. The Pascal's identity gives $\Delta B_{n+1}=B_n$ for the forward difference operator.

The binomial polynomial $P_r$ equals $1$ when $r=0$. For $n\ge 0$, it has value $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$ if $r\le n$ and value zero otherwise. These are integers. If $n=-k<0$, thenHence each $P_r$ is an integer-valued polynomial on all of $\mathbb{Z}$, including negative arguments.

For $r\ge 1$, factor the common product in the two polynomials:For $r=1$ the common product is empty and equals $1$, so this argument also covers that boundary case.

The polynomial $P_r$ has polynomial degree $r$ and leading coefficient $1/r!$. For a polynomial $F$ of polynomial degree $d$ with leading coefficient $a_d\in \mathbb{Q}$, subtract $d!a_d{P}_d$; the remainder has smaller polynomial degree. Repeating gives the required expansion with rational numbers $c_r$. For uniqueness, suppose two expansions differ and let $s$ be the largest index with different coefficients. Their difference then has a nonzero term of polynomial degree $s$, with leading coefficient equal to that coefficient difference divided by $s!$. It cannot be the zero polynomial. Thus the expansion is unique.

Replacing $X$ by $X+1$ in the earlier identity gives $\Delta P_r(X)=P_{r-1}(X)$ for $r\ge 1$, while $\Delta P_0=0$. By linearity of the forward difference operator,An empty sum is zero when $d=0$. If $H=F-G$ were nonconstant, with polynomial degree $s\ge 1$ and leading coefficient $a_s$, then $\Delta H$ would have polynomial degree $s-1$ and leading coefficient $s{a}_s\ne 0$. Therefore $\Delta F=\Delta G$ forces $H$ to be constant.

There is a direct way to recover every coefficient. Since $P_0(0)=1$ and $P_j(0)=0$ for $j\ge 1$, repeated application of the forward difference operator givesThe last equality follows by expanding $(T-I{)}^r$, where $TF(X)=F(X+1)$; the commuting shifts obey the binomial theorem. If $F$ is an integer-valued polynomial, every summand on the right is an integer, proving that all $c_r(F)$ are integers. Together with the first paragraph this gives both directions of the Newton series for an integer-valued polynomial sequence description.