Stirling Numbers

This topic contains 4 replies, has 4 voices, and was last updated by  swastik pramanik 6 months ago.

Viewing 5 posts - 1 through 5 (of 5 total)
  • Author
  • #24379

    Ashani Dasgupta

    Stirling Numbers of Second Kind

    Stirling number recursion


    Ananya Bhattacharya

    Will try. But need to think about how recursion can play a role here.
    Thank You Sir.


    Prasad s

    Sir, solved the first one


    Prasad s

    uploading again

    You must be logged in to view attached files.

    swastik pramanik

    Solution for the second problem:

    Let us consider \(r\) objects which are to be distributed in \(n\) identical boxes with no box empty. So, by definition we can place \(r\) objects in \(n\) identical boxes in \(S(r,n)\).

    Let \(P=\{p_1,p_2,…,p_r\}\) be the set of \(r\) objects and \(T=\{t_1,t_2,…,t_n\}\) be the set of \(n\) identical boxes.

    Now we divide the problem into two disjoint cases.

    Case 1: When box \(t_1\) contains only object \(p_1\) then,

    The remaining \(r-1\) objects can be distributed to the remaining \(n-1\) boxes in \(S(r-1,n-1)\) ways.

    Case 2: When box \(t_1\) will have the object \(p_1\) and also some other objects then,

    The remaining \(r-1\) objects are first put in the \(n\) boxes in \(S(r-1,n)\) ways. After distributing the \(r-1\) objects in \(n\) boxes each box becomes distinct. Hence, we can place \(p_1\) in the \(n\) boxes in \(n\) ways. Thus, the number of ways of such distribution is \(nS(r-1,n)\).

    Thus, we have $$S(r,n)=S(r-1,n-1)+nS(r-1,n)$$ as required.

Viewing 5 posts - 1 through 5 (of 5 total)

You must be logged in to reply to this topic.