Find A Solution That 'Set'isfy The Problem...

P P is a set containing 6 6 elements. A subset A A of P P is chosen and the set P P is reconstructed by replacing the elements of A A . Now a subset B B of P P is chosen again.

If the number of ways of choosing A A and B B such that B B contains just 1 1 element more than A A is x x

And

The number of ways of choosing A A and B B such that B B is a subset of A A is y y .

Find y x y - x


The answer is -63.

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...