If the system of equations \[ x + 2y - 3z = 2, \quad 2x + \lambda y + 5z = 5, \quad 14x + 3y + \mu z = 33 \]
has infinitely many solutions, then \( \lambda + \mu \) is equal to:
The largest $ n \in \mathbb{N} $ such that $ 3^n $ divides 50! is:
Two light beams fall on a transparent material block at point 1 and 2 with angle \( \theta_1 \) and \( \theta_2 \), respectively, as shown in the figure. After refraction, the beams intersect at point 3 which is exactly on the interface at the other end of the block. Given: the distance between 1 and 2, \( d = 4/3 \) cm and \( \theta_1 = \theta_2 = \cos^{-1} \frac{n_2}{2n_1} \), where \( n_2 \) is the refractive index of the block and \( n_1 \) is the refractive index of the outside medium, then the thickness of the block is cm.
A bob of mass \(m\) is suspended at a point \(O\) by a light string of length \(l\) and left to perform vertical motion (circular) as shown in the figure. Initially, by applying horizontal velocity \(v_0\) at the point ‘A’, the string becomes slack when the bob reaches at the point ‘D’. The ratio of the kinetic energy of the bob at the points B and C is:
Two light beams fall on a transparent material block at point 1 and 2 with angle \( \theta_1 \) and \( \theta_2 \), respectively, as shown in the figure. After refraction, the beams intersect at point 3 which is exactly on the interface at the other end of the block. Given: the distance between 1 and 2, \( d = \frac{4}{3} \) cm and \( \theta_1 = \theta_2 = \cos^{-1} \left( \frac{n_2}{2n_1} \right) \), where \( n_2 \) is the refractive index of the block and \( n_1 \) is the refractive index of the outside medium, then the thickness of the block is …….. cm.
Let \( y^2 = 12x \) be the parabola and \( S \) its focus. Let \( PQ \) be a focal chord of the parabola such that \( (SP)(SQ) = \frac{147}{4} \). Let \( C \) be the circle described by taking \( PQ \) as a diameter. If the equation of the circle \( C \) is: \[ 64x^2 + 64y^2 - \alpha x - 64\sqrt{3}y = \beta, \] then \( \beta - \alpha \) is equal to:
Let R = {(1, 2), (2, 3), (3, 3)}} be a relation defined on the set \( \{1, 2, 3, 4\} \). Then the minimum number of elements needed to be added in \( R \) so that \( R \) becomes an equivalence relation, is: