Let S={1,2,...50} . Find out the number of ways one can choose a subset of S such that the summation of it's elements is odd.
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.
It's very easy. The sum of the elements of S is 25x51,odd. Now whenever you choose a subset (A) with the sum of it's elements is odd ,then the sum of the elements of the remaining set or complimentary of A is even. Hence, the number of ways N odd = N even .And N odd+ N even= 2^50. So,N_odd= 2^49.