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
Equal distances from −z2 and z2 (equivalently equal moduli of the sum and difference) force the real part of \(z_1\bar{z}_2\) to vanish, which fixes the nature of the ratio.
Step 1 — \(|z_1 + z_2|^{2} = |z_1 - z_2|^{2}\) gives \(2\,\mathrm{Re}(z_1\bar{z}_2) = -2\,\mathrm{Re}(z_1\bar{z}_2)\), so \(\mathrm{Re}(z_1\bar{z}_2) = 0\).
Step 2 — \(\dfrac{z_1}{z_2} = \dfrac{z_1\bar{z}_2}{|z_2|^{2}}\), so its real part is zero: the ratio is purely imaginary, or zero when z1 = 0.
Step 3 — z1 = 0 with z2 ≠ 0 satisfies the equation (both moduli equal |z2|), giving the ratio zero; z1 = i, z2 = 1 gives |1 + i| = |i − 1| and ratio i, purely imaginary.
A non-zero real ratio k would need |k + 1| = |k − 1|, which forces k = 0, so neither a positive nor a negative real value is possible; zero and purely imaginary values both occur.
zero and purely imaginary options are 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 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
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 ?
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 __________.