Given,
A={1,2,3,4,5,6,7}
and
B={T⊆A: either 1∈/T or 2∈T}
Also,
C={T⊆A: sum of elements of T is prime}
We need
n(B∪C)
First find
n(B)
Total subsets of A are
27=128
Now complement of B occurs when
1∈Tand2∈/T
The remaining elements 3,4,5,6,7 can be chosen freely.
Hence,
n(B′)=25=32
Therefore,
n(B)=128−32=96
Now find subsets in B′ whose sum is prime.
For sets in B′,
1∈T,2∈/T
So write
T={1}∪S,
where
S⊆{3,4,5,6,7}
Now total sum becomes
1+sum(S)
Possible prime totals are
5,7,11,13,17,19,23,29
Hence required subset sums are
4,6,10,12,16,18,22,28
Now count them.
Sum 4:
{4}⇒1 case
Sum 6:
{6}⇒1 case
Sum 10:
{3,7},{4,6}⇒2 cases
Sum 12:
{5,7}⇒1 case
Sum 16:
{3,6,7},{4,5,7}⇒2 cases
Sum 18:
{5,6,7}⇒1 case
Sum 22:
{3,4,5,7},{4,5,6,7}⇒2 cases
Sum 28:
{3,4,5,6,7}⇒1 case
Therefore,
n(C∩B′)=1+1+2+1+2+1+2+1
=11
Hence,
n(B∪C)=128−(32−11)
=128−21
=107
Therefore, the required number of elements is
107.