retagged by
1,306 views
2 votes
2 votes
The number of ways in which n distinct objects can be put into two identical boxes so that no box remains empty, is

a) 2^n - 1

b) 2^n - 2

c) 2^(n-1) - 1

d) None of these

Please explain your answer.
retagged by

1 Answer

3 votes
3 votes




S(n,2) =  2^(n-1) - 1

http://www.careerbless.com/aptitude/qa/permutations_combinations_imp7.php
Follow this link, to know it in detail.

edited by

Related questions

0 votes
0 votes
1 answer
2
1 votes
1 votes
1 answer
4
Hattbc asked Feb 17, 2023
491 views
How many 3 digits number are there which are divisible by 3 and repetition of digits NOT allowed.?