A set R contains 6 distinct elements. Two subsets of R, P and Q are selected.

Find the number of ways of choosing P and Q such that, neither P is a subset of Q nor Q is a subset of P.

The answer is 2702.

**
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.

No explanations have been posted yet. Check back later!