recategorized by
448 views

2 Answers

2 votes
2 votes

So, option $B$ is the correct answer.

PS: In the last line of scanned paper, it is $n\geq 0$

edited by
0 votes
0 votes

Correct Answer - Option (B)

Let, $X = 3^{2n+1} + 2^{n+2} = 3(3)^{2n} + 4(2)^{2n}$

If we were to go from options, 

The edge cases to check here that would distinguish each option would be, 

$n \in \{0, 1,2\}$

now,

putting $n=0$, $3(1) + 4(1) = 7$  which is divisible by 7. So, that makes option (D) and (A) wrong.

putting $n=1$, $3(9) + 4(2) = 35$  which is divisible by 7. So, that makes option (C) wrong.

No need to check further since (B) is the only remaining option.

However, even for $n=2$, $3(81) + 4(4) = 243 + 16 = 259$ which is divisible by 7.

Here, option (B) is the only one that contains $\{0,1,2\}$, so it's the only correct choice. 

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Sep 18, 2019
248 views
Let $S=\{0,1,2,\cdots,25\}$ and $T=\{n\in S\: : \: n^{2}+3n+2\: \text{is divisible by}\: 6\}$. Then the number of elements in the set $T$ is$16$$17$$18$$10$
0 votes
0 votes
1 answer
2
gatecse asked Sep 18, 2019
273 views
Let $a$ be the $81$-digit number of which all the digits are equal to $1.$ Then the number $a$ is ,divisible by $9$ but not divisible by $27$ divisible by $27$ but not di...
1 votes
1 votes
1 answer
3
gatecse asked Sep 18, 2019
281 views
The highest power of $3$ contained in $1000!$ is$198$$891$$498$$292$
0 votes
0 votes
1 answer
4
gatecse asked Sep 18, 2019
333 views
For all the natural number $n\geq 3,\: n^{2}+1$ isdivisible by $3$not divisible by $3$divisible by $9$None of these