Math, asked by sangaurishiva, 11 months ago

in case of combination if C0+C1+C2+........ +Cn=256, then 2nC2 is equal to? ​

Answers

Answered by Anonymous
3

Answer:

Heya buddy....

Here is ur answer....

120 is the answer.....

Step-by-step explanation:

If set S has n elements, then C( n,k) is the number of ways of choosing k elements from S

Thus the number of subsets of S of all possible is given by

C( n,0) + C ( n,1) + C(n,3) +......

Comparing the given equation :

2^n = 256

2^n = 2^8

n = 8

Thus

2n C2 = 16 C2

= (16 × 15) /2

=120

Hope it’s helpful.........

Answered by Anonymous
2

Answer:

Heya buddy....

Here is ur answer....

120 is the answer.....

Step-by-step explanation:

If set S has n elements, then C( n,k) is the number of ways of choosing k elements from S

Thus the number of subsets of S of all possible is given by

C( n,0) + C ( n,1) + C(n,3) +......

Comparing the given equation :

2^n = 256

2^n = 2^8

n = 8

Thus

2n C2 = 16 C2

= (16 × 15) /2

=120

Hope it’s helpful.........

Answered by Anonymous
1

Answer:

Heya buddy....

Here is ur answer....

120 is the answer.....

Step-by-step explanation:

If set S has n elements, then C( n,k) is the number of ways of choosing k elements from S

Thus the number of subsets of S of all possible is given by

C( n,0) + C ( n,1) + C(n,3) +......

Comparing the given equation :

2^n = 256

2^n = 2^8

n = 8

Thus

2n C2 = 16 C2

= (16 × 15) /2

=120

Hope it’s helpful.........

Answered by Anonymous
1

Answer:

Heya buddy....

Here is ur answer....

120 is the answer.....

Step-by-step explanation:

If set S has n elements, then C( n,k) is the number of ways of choosing k elements from S

Thus the number of subsets of S of all possible is given by

C( n,0) + C ( n,1) + C(n,3) +......

Comparing the given equation :

2^n = 256

2^n = 2^8

n = 8

Thus

2n C2 = 16 C2

= (16 × 15) /2

=120

Hope it’s helpful.........

Similar questions