Basic Set Theory

Let \(X\) be the set of integers {8,14,20,26,32,....350,356,362,368,374} and \(Y\) be the subset of \(X\) such that no two elements of \(Y\) have a sum of 382 .

Find the maximum number of elements \(Y\) can have .

You can try more of my Questions here .

×

Problem Loading...

Note Loading...

Set Loading...