Consider a quadratic equation ax2 + 2bx + c = 0 where a, b, c are positive real numbers. If the equation has no real root, then which of the following is true ?
a, b, c cannot be in A.P. or G.P. but can be in H.P.
A quadratic has no real root exactly when its discriminant is negative. For \(ax^{2} + 2bx + c = 0\) this means \(4b^{2} - 4ac \lt 0\), i.e. \(b^{2} \lt ac\). Each progression is tested against this condition.
Step 1 — A.P.: \(b = \dfrac{a + c}{2}\), so \(b^{2} = \dfrac{(a + c)^{2}}{4} \ge ac\) by AM–GM. The condition fails, so a, b, c cannot be in A.P.
Step 2 — G.P.: \(b^{2} = ac\), giving a zero discriminant and equal real roots. So a, b, c cannot be in G.P.
Step 3 — H.P.: \(b = \dfrac{2ac}{a + c}\), so \(b^{2} = \dfrac{4a^{2}c^{2}}{(a + c)^{2}} \lt ac \iff 4ac \lt (a + c)^{2}\), which holds whenever a ≠ c. For example a = 1, c = 4 gives b = 1.6 and \(b^{2} = 2.56 \lt 4\), so no real root.
A G.P. or an A.P. always leads to real roots, so any statement allowing either of them fails, and the statement ruling out all three progressions fails because the H.P. case works.
a, b, c cannot be in A.P. or G.P. but can be in H.P. option is correct.
A letter lock consists of three rings with 15 different letters. If N denotes the number of ways in which it is possible to make unsuccessful attempts to open the lock, then
If z1 and z2 are two complex numbers satisfying the equation \(\left|\dfrac{z_1 + z_2}{z_1 - z_2}\right| = 1\), then \(\dfrac{z_1}{z_2}\) may be
If R and R1 are equivalence relations on a set A, then so are the relations
Let a1, a2, a3, …, an be positive real numbers. Then the minimum value of
\(\dfrac{a_1}{a_2} + \dfrac{a_2}{a_3} + \ldots + \dfrac{a_n}{a_1}\) is
Let A = \(\begin{pmatrix} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 0 & 0 \end{pmatrix}\), B = \(\begin{pmatrix} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 0 & 0 & 0 \end{pmatrix}\) and P = \(\begin{pmatrix} 0 & 1 & 0 \\ x & 0 & 0 \\ 0 & 0 & y \end{pmatrix}\) be an orthogonal matrix such that B = PAP−1 holds. Then
Let ρ be a relation defined on set of natural numbers ℕ, as ρ = \(\{(x, y) \in \mathbb{N} \times \mathbb{N} : 2x + y = 41\}\). Then domain A and range B are
Let P(n) = 32n + 1 + 2n + 2 where n ∈ ℕ. Then
Let A and B are orthogonal matrices and det A + det B = 0. Then
Let A be a set containing n elements. A subset P of A is chosen, and the set A is reconstructed by replacing the elements of P. A subset Q of A is chosen again. The number of ways of choosing P and Q such that Q contains just one element more than P is
If one root of x2 + px − q2 = 0, p and q are real, be less than 2 and other be greater than 2, then
Let S be the set of the first 11 natural numbers. Then the number of elements in $A = \{B \subseteq S : n(B) \geq 2$ and the product of all elements of B is even is ________.
If $ \left(\frac{1}{^{15}C_0} + \frac{1}{^{15}C_1}\right)$ $\left(\frac{1}{^{15}C_1} + \frac{1}{^{15}C_2}\right)$ $\dots$ $ \left(\frac{1}{^{15}C_{12}} + \frac{1}{^{15}C_{13}}\right)$ = $\frac{\alpha^{13}}{^{14}C_0 ^{14}C_1 \dots ^{14}C_{12}} $, then $30\alpha$ is equal to __________.