[" The number of ways in which "n" distinct objects "],[" can be put into two different boxes is "]

Find the total number of way in which n distinct objects can be put into two different boxes

Find the total number of way in which n distinct objects can be put into two different boxes

Find the total number of ways in which n distinct objects can be put into two different boxes.

Find the total number of ways in which n distinct objects can be put into two different boxes.

Find the total number of ways in which n distinct objects can be put into two different boxes.

Find the total number of ways in which n distinct objects can be put into two different boxes so that no box remains empty.

Find the total number of ways in which n distinct objects can be put into two different boxes so that no box remains empty.

Statement 1: let E={1,2,3,4}a n dF={a ,b}dot Then the number of onto functions from EtoFi s14. Statement 2: Number of ways in which four distinct objects can be distributed into two different boxes is 14 if no box remains empty.

Statement 1: let E={1,2,3,4}a n dF={a ,b}dot Then the number of onto functions from EtoFi s14. Statement 2: Number of ways in which four distinct objects can be distributed into two different boxes is 14 if no box remains empty.

Statement 1: let E={1,2,3,4}andF={a,b}. Then the number of onto functions from E rarr Fis14 . Statement 2: Number of ways in which four distinct objects can be distributed into two different boxes is 14 if no box remains empty.