Let us place the ground set in front of us: S={1,2,3,…,20}.
The task is to pick a subset B⊆S whose elements add up to 203. Because every element of S is either in B or in its complement Bc, the following identity of sums holds:
x∈S∑x=x∈B∑x+x∈Bc∑x.
The left-hand sum is the total of the first twenty natural numbers. Using the familiar formula for an arithmetic progression,
1+2+⋯+20=220⋅21=210.
We are demanding x∈B∑x=203, so substitution gives
210=203+∑x∈Bcx,
which rearranges step by step to
∑x∈Bcx=210−203=7.
Thus a subset B is “nice’’ exactly when its complement has total 7. The mapping B⟷Bc is a perfect one-to-one correspondence between subsets of sum 203 and subsets of sum 7, so counting either family gives the same result. Because 7 is a very small number, it is far easier to enumerate the complements.
We now list every subset of S whose elements are distinct and add to 7. Begin with singletons:
{7}sum=7.
Move on to pairs of distinct elements. We require a+b=7, with 1≤a</p><p>1+6=7\;\Longrightarrow\;\{1,6\},2+5=7\;\Longrightarrow\;\{2,5\},3+4=7\;\Longrightarrow\;\{3,4\}.</p><p>Next,examinetriples.Weneedthreedifferentpositiveintegerswhosesumis7.Theonlypossibilityis</p><p>1+2+4=7\;\Longrightarrow\;\{1,2,4\}.</p><p>Tryingtousefourormoredistinctnumbersfailsimmediately,because1+2+3+4=10>7,andanylargercollectionwouldhaveanevenbiggersum.</p><p>ThereforetheentirecatalogueofsubsetsofSwhosesumis7consistsof</p><p>\bigl\{\; \{7\},\; \{1,6\},\; \{2,5\},\; \{3,4\},\; \{1,2,4\}\;\bigr\}.</p><p>Exactlyfivesubsetsappearinthatlist,sothereare5“nice’’complementsandconsequently5“nice’’subsetswhosesumis203.</p><p>ThesamplespaceintheproblemisthesetofallsubsetsofS,andasetwith20elementshasexactly2^{20}subsets.Therequiredprobabilityistherefore</p><p>\text{Probability}=\frac{\text{number of nice subsets}}{\text{total number of subsets}}=\frac{5}{2^{20}}.$$
Hence, the correct answer is Option B.