JEE MAIN 2014 · 06 APR OFFLINE+4 / −1MEDIUMTRANSCRIBED
JEE Main 2014 Mathematics question — Sets, subsets, power sets and set operations
If X={4n−3n−1:n∈N} and Y={9(n−1):n∈N}, where N is the set of natural numbers, then X∪Y is equal to:
SOLUTION
We have two sets of natural-number valued expressions
X={4n−3n−1:n∈N}andY={9(n−1):n∈N},
where N={1,2,3,…}.
Our task is to identify the union X∪Y.
To do this we shall show that every element of X is already present in Y.
If that is true then X⊆Y, and consequently X∪Y=Y.
For any natural number n, consider the expression
4n−3n−1.
We want to see whether this number is a multiple of 9.
A convenient way to check divisibility by 9 is to look at the remainder (the “modulus”) of the number when divided by 9.
Hence we examine 4n(mod9).
First, note that
4≡4(mod9),
42=16≡7(mod9),
43=64≡1(mod9).
The remainders repeat every three powers because
43=1(mod9)⟹43k=1(mod9),
and multiplying by another 4 or 42 gives the other two remainders.
So we have the periodic pattern
4n≡⎩⎨⎧4,7,1,n≡1(mod3),n≡2(mod3),n≡0(mod3).
Now write n=3k,3k+1, or 3k+2, and compute the whole expression modulo 9 in each case.
1. If n=3k, then 4n≡1.
So
4n−3n−1=1−3(3k)−1=1−9k−1=−9k≡0(mod9).
2. If n=3k+1, then 4n≡4.
So
4n−3n−1=4−3(3k+1)−1=4−9k−3−1=−9k≡0(mod9).
3. If n=3k+2, then 4n≡7.
So
4n−3n−1=7−3(3k+2)−1=7−9k−6−1=−9k≡0(mod9).
In every case the remainder is zero, so
9(4n−3n−1).
Therefore, for each n∈N there exists some non-negative integer m such that
4n−3n−1=9m.
But the set Y={9(n−1):n∈N} contains every non-negative multiple of 9 (namely 0,9,18,27,…).
Hence the number 9m we obtained is automatically an element of Y.
So we have proved
X⊆Y.
Because the union of a set with its superset is the superset itself, we now have
X∪Y=Y.
Thus the union equals Y, which corresponds to Option B.
Hence, the correct answer is Option B.
Tagged Sets, subsets, power sets and set operations. Machine-assigned, so read it as a strong shortlist rather than a verdict.