MCQ
If $[\mathrm{x}]$ be the greatest integer less than or equal to $\mathrm{x}$, then $\sum_{\mathrm{n}=8}^{100}\left[\frac{(-1)^{n} \mathrm{n}}{2}\right]$ is equal to:
  • A
    $-2$
  • $4$
  • C
    $2$
  • D
    $0$

Answer

Correct option: B.
$4$
b
$\sum_{n=8}^{100}\left[\frac{(-1)^{n} \cdot n}{2}\right]=\left[\frac{8}{2}\right]+\left[\frac{-9}{2}\right]+\left[\frac{10}{2}\right]+\left[\frac{-11}{2}\right]+\ldots+\ldots\left[\frac{-99}{2}\right]+\left[\frac{100}{2}\right]$

$=4-5+5-6+6+\ldots-50+50=4$

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free

Similar questions

Statement $-1:$ The line $x - 2y = 2$ meets the parabola, $y^2 + 2x = 0$ only at the point $(-2, - 2).$

Statement $-2:$ The line $y = mx - \frac{1}{{2m}}(m \ne 0)$ is tangent to the parabola, $y^2 = - 2x$ at the point $\left( { - \frac{1}{{2{m^2}}}, - \frac{1}{m}} \right).$

If the length of the latus rectum of an ellipse is $4\,units$ and the distance between a focus and its nearest vertex on the major axis is $\frac {3}{2}\,units$ , then its eccentricity is?
In any $\triangle\text{ABC},$ the value of $2\text{ac}\sin\Big(\frac{\text{A}-\text{B + C}}{2}\Big)$ is:
Let $t_n$ denote the number of integral-sided triangles with distinct sides chosen from $\{1,2,3, \ldots, n\}$. Then, $t_{20}-t_{19}$ equals
A light ray emits from the origin making an angle $30^{\circ}$ with the positive $x$-axis. After getting reflected by the line $x + y =1$, if this ray intersects $x$-axis at $Q$, then the abscissa of $Q$ is
How many numbers greater than $24000$ can be formed by using digits $1, 2, 3, 4, 5 $when no digit is repeated
If one end of a focal chord of the parabola, $y^2 = 16x$ is at $(1, 4),$ then the length of this focal chord is
Let $S$ be the set of all ordered pairs $(x, y)$ of positive integers, with $HCF (x, y)=16$ and $\operatorname{LCM}(x, y)=48000$. The number of elements in $S$ is
$2^{3 n}-7 n-1$ is divisible by:
Let $S_{ k }=\frac{1+2+\ldots .+ K }{ K }$ and $\sum_{j=1}^n S_j^2=\frac{n}{A}\left( Bn ^2+ Cn + D \right)$, where $A , B , C , D \in N$ and $A$ has least value. Then