Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Consider a following recursion relation:

\begin{equation} a_s^{(m+1)} = s a_s^{(m)} 1_{s \le m} + a_{s-1}^{(m)} 1_{s\ge 2} \end{equation} for $s=1,\dots,m+1$ subject to $a^{(1)}_1= 1$.

The solution to that recursion is given by: \begin{equation} a_s^{(m)} = \frac{1}{s!} \sum\limits_{q=1}^s q^m C^{s}_q (-1)^{s-q} \end{equation} and \begin{equation} a_{m-s+1}^{(m)} = C^m_s P_s^{(s-2)}(m) \end{equation} Here the quantities $P_s^{(s-2)}(m)$ are polynomials of order $s-2$ and for $s=2,\dots,6$ they read: \begin{eqnarray} P_2^{(0)}(m) &=& 1 \\ P_3^{(1)}(m) &=& 1/4 (3m-5) \\ P_4^{(2)}(m) &=& 1/2 (m-2)(m-3) \\ P_5^{(3)}(m) &=& 1/48 (15 m^3 - 150 m^2 + 485 m - 502) \\ P_6^{(4)}(m) &=& 1/16 (m-4)(m-5) (3 m^2 - 23 m + 38) \end{eqnarray}

Find the polynomials $P_s^{(s-2)}(m)$ for arbitrary values of $s$.

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.