If $P(x)=\sum_{i=0}^da_i\left(\prod_{j=i}^{d+i-1}(x+j)\right)$ is linear, what is its constant term? Question: Fix $d,m\in\mathbb{N}$ with $0\leq m\leq d$ and define
$$P(x)=\sum_{i=0}^da_i\left(\prod_{j=i}^{d+i-1}(x+j)\right),$$
where each $a_i$ is a constant, $a_m=0$. Suppose that, after expansion, $P(x)=c-x$ for some constant $c$. Show that $c=\frac{m}{d}-d$.
I obtained a rough solution by evaluating $P\left(-(d+k)\right)$ for each $0\leq k\leq m$, which yields $m+1$ linear relations on $a_0,\dots, a_{m-1}$ and $c$, from which one can then solve by scaling and subtracting. However, I am hoping for a cleaner, more succinct answer (in fact, one might even be able to use the above approach in a neater way than I did).

Some thoughts
Clearly, $d\ge 1$.
Let $x = -(m-1), -m, -(m+1), \cdots, -(d-1)$ respectively to get
\begin{align}
P(1-m) &= c + m - 1, \\
P(-m) &= c + m, \\
P(-m - 1) &= c + m+1, \\
&\cdots\cdots\\
P(-d+1) &= c + d - 1.
\end{align}
Then we have (weighted sum of the equations above)
$$\sum_{k=0}^{d-m} P(-m - k + 1)(-1)^k\binom{d+1}{k} = \sum_{k=0}^{d-m} (c + m + k - 1) (-1)^k\binom{d+1}{k}. \tag{1}
$$
Claim 1: It holds that
$$\sum_{k=0}^{d-m} P(-m - k + 1)(-1)^k\binom{d+1}{k} = 0.$$
(The proof is given at the end.)
By (1) and Claim 1, we have
$$\sum_{k=0}^{d-m} (c + m + k - 1) (-1)^k\binom{d+1}{k} = 0$$
which results in
$$c = -m + 1 - \frac{\sum_{k=0}^{d-m} k (-1)^k\binom{d+1}{k}}{\sum_{k=0}^{d-m} (-1)^k\binom{d+1}{k}}
= -m + 1 - (d+1)\frac{d-m}{d} = \frac{m}{d} - d$$
where we have used the identity (see 26.3.10 in https://dlmf.nist.gov/26.3)
$$(-1)^N \binom{M}{N} = \sum_{k=0}^N (-1)^k \binom{M+1}{k}, \quad 0\le N \le M$$
to get
$$\sum_{k=0}^{d-m} (-1)^k\binom{d+1}{k} = (-1)^{d-m}\binom{d}{d-m}$$
and
$$\sum_{k=0}^{d-m} k (-1)^k\binom{d+1}{k} = (d+1)\frac{d-m}{d}(-1)^{d-m}\binom{d}{d-m}. \tag{2}$$
(The proof of (2) is given at the end.)
$\phantom{2}$
Proof of Claim 1: We have
\begin{align}
&\sum_{k=0}^{d-m} P(-m - k + 1)(-1)^k\binom{d+1}{k}\\
=\ & \sum_{k=0}^{d-m} \sum_{i=0}^d a_i\left(\prod_{j=i}^{d+i-1}(-m - k + 1+j)\right)(-1)^k\binom{d+1}{k}\\
=\ & \sum_{i=0}^d a_i \sum_{k=0}^{d-m} \left(\prod_{j=i}^{d+i-1}(-m - k + 1+j)\right)(-1)^k\binom{d+1}{k}\\
=\ & \sum_{i=0}^d a_i A_i
\end{align}
where
$$A_i = \sum_{k=0}^{d-m} \left(\prod_{j=i}^{d+i-1}(-m - k + 1+j)\right)(-1)^k\binom{d+1}{k}.$$
It suffices to prove that $A_i = 0$ for all $i \ne m$.
We split into three cases:

*

*$m = d$: For $0\le i < m$, we have
$$A_i = \prod_{j=i}^{d+i-1}(-d + 1+j) = 0.$$


*$m = 0$: For $1\le i\le d$, noting that $\prod_{j=i}^{d+i-1}(-m - k + 1+j) = 0$ for $i + 1 \le k \le d$, we have
\begin{align}
A_i &= \sum_{k=0}^{d} \left(\prod_{j=i}^{d+i-1}( - k + 1+j)\right)(-1)^k\binom{d+1}{k}\\
&= \sum_{k=0}^i \left(\prod_{j=i}^{d+i-1}( - k + 1+j)\right)(-1)^k\binom{d+1}{k}\\
&= \sum_{k=0}^i \frac{(d+i-k)!}{(i-k)!}(-1)^k\binom{d+1}{k}\\
&= d! \sum_{k=0}^i (-1)^k \binom{d+1}{k} \binom{d+i-k}{i-k}\\
&= 0
\end{align}
where we have used the identity (see @arindam mitra's answer:
Prove combinatorial identity using inclusion/exclusion principle)
$$\sum_{k=0}^M (-1)^k \binom{N}{k}\binom{N + r - k}{M - k} = 0, \quad 0 \le r \le M-1$$
to get (let $M = i$, $N = d + 1$, $r = i - 1$)
$$\sum_{k=0}^i (-1)^k \binom{d+1}{k} \binom{d+i-k}{i-k} = 0.$$


*$1 \le m \le d - 1$: If $0\le i < m$, clearly $\prod_{j=i}^{d+i-1}(-m - k + 1+j) = 0$ and hence $A_i = 0$.
If $m < i \le d$, I $\color{blue}{\textrm{GUESS}}$ $A_i = 0$.
Remark: With the help of Maple, $\color{blue}{\textrm{it appears that}}$
$$\sum_{k=0}^{d-m} \Big(\prod_{j=i}^{d+i-1}(-m - k + 1+j)\Big)(-1)^k\binom{d+1}{k}
= (-1)^{d-m}\binom{d}{m} \prod_{0\le k \le d, \, k\ne m} (i-k). \tag{2}$$
How to prove it?
$\phantom{2}$
Proof of (2): If $d-m = 0$, it is obvious. If $d-m\ge 1$, we have
\begin{align}
\sum_{k=0}^{d-m} k (-1)^k\binom{d+1}{k}
&= \sum_{k=1}^{d-m} k (-1)^k\binom{d+1}{k}\\
&= (d+1) \sum_{k=1}^{d-m} (-1)^k \binom{d}{k-1}\\
&= -(d+1) \sum_{j=0}^{d-m-1} (-1)^j \binom{d}{j}\\
&= -(d+1)(-1)^{d-m-1}\binom{d-1}{d-m-1}\\
&= (d+1)\frac{d-m}{d}(-1)^{d-m}\binom{d}{d-m}.
\end{align}
We are done.
