Consider natural numbers 1,2,3,.......,n-1,n
Further consider n positions at which these are to be placed given that no number occupies its corresponding position.( eg. 1 does not come on first position, 2 does not come on second position etc.)
Let f(n) be the number of ways in which first n natural numbers numbers can be placed at n positions according to the above given condition.
Given that for some natural number n
= a
= b
Then-
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!