TS EAMCET 03 May 2019 Shift 2 Solved Paper

Consider the following statements
i. Number of ways of placing 'n' objects in k bins (k ≤ n) such that no bin is empty is

(n−1)

‌

Ck−1.
ii. Number of ways of writing a positive integer 'n' into a sum of k positive integers is

(n−1)

‌

Ck−1.
iii. Number of ways of placing 'n' objects in k bins such that atleast one bin is non - empty is

(n−1)

‌

Ck−1.
iv.

n

‌

Ck−

n−1

‌

Ck =

(n−1)

‌

Ck−1.
Then which of the above statements are true?