- Aat least two of $a_1, a_2, a_3$ are equal
- ✓$a_1=a_2=a_3$
- C$a_1, a_2, a _3$ are all distinct
- D$a_1, a_2, a _3$ are all positive and distinct
We have,
$f(x)=\left(x-a_1\right)\left(x-a_2\right)+\left(x-a_2\right)\left(x-a_3\right)+\left(x- a _3\right)\left(x- a _1\right)$
$f(x)=3 x^2-2\left(a_1+a_2+a_3\right) x+a_1 a_2+a_2 a_3+a_1 a_3$
$f(x) \geq 0$ iff $D \leq 0$
$\therefore 4\left(a_1+a_2+a_3\right)^2-4 \times 3 \left(a_1 a_2+a_2 a_3+a_1 a_3\right) \leq 0$
$=a_1^2+a_2^2+a_3^2-\left(a_1 a_2+a_2 a_3+a_1 a_3\right) \leq 0$
$=\frac{1}{2}\left[\left(a_1-a_2\right)^2+\left(a_2-a_3\right)^2+\left(a_3-a_1\right)^2\right] \leq 0$
It is possible only
$a _{1 .}=a_2, a_2= a _3, a _3= a _1$
$\therefore \quad a_1=a_2=a_3$
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.
$\operatorname{det}\left[\begin{array}{cc}\sum_{k=0}^n k & \sum_{k=0}^n{ }^n C_k k^2 \\ \sum_{k=0}^n{ }^n C_k k & \sum_{k=0}^n{ }^n C_k 3^k\end{array}\right]=0$, holds for some positive integer $n$. Then $\sum_{k=0}^n \frac{{ }^n C_k}{k+1}$ equals