in Combinatory
110 views
0 votes
0 votes
Let $S(m, n)$ denote the number of onto functions from a set with m elements to a set with $n$ elements. Show that $S(m, n)$ satisfies the recurrence relation

$$S(m, n) = n^{m} − \sum_{k=1 }^{n−1} C(n, k)S(m, k)$$ whenever $m \geq  n$ and $n > 1,$ with the initial condition $S(m, 1) = 1.$
in Combinatory
by
110 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true