recategorized by
363 views

1 Answer

2 votes
2 votes

Answer: C

Explanation:

Small observation:

Every number is repeated by the same number of times.

Eg. $1$ repeats $1$ time, $2$ repeat $2$ times, $\cdots$

Now, this question reduces to nothing but just a sum of n terms of natural numbers, which is given by:

$\frac{n(n-1)}{2} < 5000 \le \frac{n(n+1)}{2}$

On substituting the options, we will get that 100 satisfies this equation.

$\therefore \mathbf C $ is the right option.

edited by

Related questions

4 votes
4 votes
1 answer
1
gatecse asked Sep 18, 2019
318 views
The sequence $\dfrac{1}{\log_{3} 2},\dfrac{1}{\log_{6} 2},\dfrac{1}{\log_{12} 2},\dfrac{1}{\log_{24} 2}\cdots$ is inArithmetic progression (AP)Geometric progression (GP)H...
1 votes
1 votes
2 answers
2
gatecse asked Sep 18, 2019
662 views
Let $S=\{6,10,7,13,5,12,8,11,9\},$ and $a=\sum_{x\in S}(x-9)^{2}\:\&\: b=\sum_{x\in S}(x-10)^{2}.$ Then$a<b$$a>b$$a=b$None of these
1 votes
1 votes
1 answer
3
gatecse asked Sep 18, 2019
377 views
The coefficient of $x^{2}$ in the product $(1+x)(1+2x)(1+3x)\cdots (1+10x)$ is$1320$$1420$$1120$None of these
0 votes
0 votes
1 answer
4
gatecse asked Sep 18, 2019
264 views
Let $x^{2}-2(4k-1)x+15k^{2}-2k-7>0$ for any real value of $x$. Then the integer value of $k$ is$2$$4$$3$$1$