First, recall that in JEE problems the symbol N N N denotes the set of positive integers { 1 , 2 , 3 , … } \{1,2,3,\ldots\} { 1 , 2 , 3 , … } ; the number 0 0 0 is not included.
We begin with the description of the set A A A . By definition
A = { n ∈ N ∣ n 2 ≤ n + 10000 } . A=\{\,n\in N\mid n^{2}\le n+10000\,\}. A = { n ∈ N ∣ n 2 ≤ n + 10000 } .
To find all such n n n we rearrange the inequality:
n 2 ≤ n + 10000 ⟹ n 2 − n − 10000 ≤ 0. n^{2}\le n+10000
\;\Longrightarrow\;
n^{2}-n-10000\le 0. n 2 ≤ n + 10000 ⟹ n 2 − n − 10000 ≤ 0.
We apply the quadratic-formula roots of n 2 − n − 10000 = 0 n^{2}-n-10000=0 n 2 − n − 10000 = 0 .
The formula is stated first:
If a x 2 + b x + c = 0 , then x = − b ± b 2 − 4 a c 2 a . ax^{2}+bx+c=0,\text{ then }x=\dfrac{-b\pm\sqrt{b^{2}-4ac}}{2a}. a x 2 + b x + c = 0 , then x = 2 a − b ± b 2 − 4 a c .
For the present quadratic a = 1 , b = − 1 , c = − 10000 a=1,\;b=-1,\;c=-10000 a = 1 , b = − 1 , c = − 10000 , so
n = − ( − 1 ) ± ( − 1 ) 2 − 4 ( 1 ) ( − 10000 ) 2 ( 1 ) = 1 ± 1 + 40000 2 = 1 ± 40001 2 . n=\dfrac{-(-1)\pm\sqrt{(-1)^{2}-4(1)(-10000)}}{2(1)}
=\dfrac{1\pm\sqrt{1+40000}}{2}
=\dfrac{1\pm\sqrt{40001}}{2}. n = 2 ( 1 ) − ( − 1 ) ± ( − 1 ) 2 − 4 ( 1 ) ( − 10000 ) = 2 1 ± 1 + 40000 = 2 1 ± 40001 .
The discriminant 40001 40001 40001 lies between 200 2 = 40000 200^{2}=40000 20 0 2 = 40000 and 201 2 = 40401 201^{2}=40401 20 1 2 = 40401 , therefore
200 < 40001 < 201. 200<\sqrt{40001}<201. 200 < 40001 < 201.
Consequently
1 − 40001 2 ≈ − 99.5 and 1 + 40001 2 ≈ 100.5. \dfrac{1-\sqrt{40001}}{2}\approx -99.5
\quad\text{and}\quad
\dfrac{1+\sqrt{40001}}{2}\approx 100.5. 2 1 − 40001 ≈ − 99.5 and 2 1 + 40001 ≈ 100.5.
Because n n n must be a positive integer, the inequality n 2 − n − 10000 ≤ 0 n^{2}-n-10000\le 0 n 2 − n − 10000 ≤ 0 restricts n n n to
1 ≤ n ≤ 100. 1\le n\le 100. 1 ≤ n ≤ 100.
Hence
A = { 1 , 2 , 3 , … , 100 } . A=\{1,2,3,\ldots,100\}. A = { 1 , 2 , 3 , … , 100 } .
Next we examine the set B B B :
B = { 3 k + 1 ∣ k ∈ N } = { 4 , 7 , 10 , 13 , … } . B=\{\,3k+1\mid k\in N\}=\{\,4,7,10,13,\ldots\}. B = { 3 k + 1 ∣ k ∈ N } = { 4 , 7 , 10 , 13 , … } .
The set C C C is
C = { 2 k ∣ k ∈ N } = { 2 , 4 , 6 , 8 , … } , C=\{\,2k\mid k\in N\}=\{\,2,4,6,8,\ldots\}, C = { 2 k ∣ k ∈ N } = { 2 , 4 , 6 , 8 , … } ,
the collection of all positive even integers.
The expression B − C B-C B − C means “all elements of B B B that are not in C C C .”
Because every element of C C C is even, an element 3 k + 1 3k+1 3 k + 1 is removed whenever it is even.
Let us determine the parity of 3 k + 1 3k+1 3 k + 1 :
Parity ( 3 k ) = Parity ( k ) ( since 3 is odd ) . (3k) = \text{Parity}(k)\;(\text{since }3\text{ is odd}). ( 3 k ) = Parity ( k ) ( since 3 is odd ) .
Therefore
3 k + 1 3k+1 3 k + 1 is odd ⟺ k \Longleftrightarrow k ⟺ k is even . . .
Only those k k k that are even survive the subtraction B − C B-C B − C .
Write k = 2 m k=2m k = 2 m with m ∈ N m\in N m ∈ N ; then
3 k + 1 = 3 ( 2 m ) + 1 = 6 m + 1. 3k+1=3(2m)+1=6m+1. 3 k + 1 = 3 ( 2 m ) + 1 = 6 m + 1.
Thus
B − C = { 6 m + 1 ∣ m ∈ N } = { 7 , 13 , 19 , 25 , … } . B-C=\{\,6m+1\mid m\in N\,\}=\{\,7,13,19,25,\ldots\}. B − C = { 6 m + 1 ∣ m ∈ N } = { 7 , 13 , 19 , 25 , … } .
Now we intersect with A A A .
We need all numbers of the form 6 m + 1 6m+1 6 m + 1 that do not exceed 100 100 100 :
6 m + 1 ≤ 100 ⟹ 6 m ≤ 99 ⟹ m ≤ 16.5. 6m+1\le100
\;\Longrightarrow\;
6m\le99
\;\Longrightarrow\;
m\le16.5. 6 m + 1 ≤ 100 ⟹ 6 m ≤ 99 ⟹ m ≤ 16.5.
Because m m m is a positive integer, m m m ranges from 1 1 1 to 16 16 16 inclusive.
For each m m m we obtain
m = 1 : 6 ( 1 ) + 1 = 7 , m = 2 : 6 ( 2 ) + 1 = 13 , m = 3 : 6 ( 3 ) + 1 = 19 , ⋮ m = 16 : ; ; 6 ( 16 ) + 1 = 97. \begin{aligned}
m=1&\;:\;6(1)+1=7,\\
m=2&\;:\;6(2)+1=13,\\
m=3&\;:\;6(3)+1=19,\\
&\;\;\vdots\\
m=16&:;;6(16)+1=97.
\end{aligned} m = 1 m = 2 m = 3 m = 16 : 6 ( 1 ) + 1 = 7 , : 6 ( 2 ) + 1 = 13 , : 6 ( 3 ) + 1 = 19 , ⋮ : ;; 6 ( 16 ) + 1 = 97.
Collecting every value we have the set
A ∩ ( B − C ) = { 7 , 13 , 19 , 25 , 31 , 37 , 43 , 49 , 55 , 61 , 67 , 73 , 79 , 85 , 91 , 97 } . A\cap(B-C)=\{7,13,19,25,31,37,43,49,55,61,67,73,79,85,91,97\}. A ∩ ( B − C ) = { 7 , 13 , 19 , 25 , 31 , 37 , 43 , 49 , 55 , 61 , 67 , 73 , 79 , 85 , 91 , 97 } .
This is an arithmetic progression whose first term is a 1 = 7 a_{1}=7 a 1 = 7 , common difference is d = 6 d=6 d = 6 , and the number of terms is n = 16 n=16 n = 16 .
The sum S n S_{n} S n of the first n n n terms of an arithmetic progression is given by the formula
S n = n 2 ( 2 a 1 + ( n − 1 ) d ) . S_{n}=\dfrac{n}{2}\bigl(2a_{1}+(n-1)d\bigr). S n = 2 n ( 2 a 1 + ( n − 1 ) d ) .
Substituting n = 16 , a 1 = 7 , d = 6 n=16,\;a_{1}=7,\;d=6 n = 16 , a 1 = 7 , d = 6 we obtain
S 16 = 16 2 ( 2 ⋅ 7 + ( 16 − 1 ) ⋅ 6 ) = 8 ( 14 + 15 ⋅ 6 ) = 8 ( 14 + 90 ) = 8 × 104 = 832. S_{16}=\dfrac{16}{2}\bigl(2\cdot7+(16-1)\cdot6\bigr)
=8\bigl(14+15\cdot6\bigr)
=8\bigl(14+90\bigr)
=8\times104
=832. S 16 = 2 16 ( 2 ⋅ 7 + ( 16 − 1 ) ⋅ 6 ) = 8 ( 14 + 15 ⋅ 6 ) = 8 ( 14 + 90 ) = 8 × 104 = 832.
Hence, the correct answer is Option 832.