A quadratic polynomial \( (x - \alpha)(x - \beta) \) over complex numbers is said to be square invariant if \[ (x - \alpha)(x - \beta) = (x - \alpha^2)(x - \beta^2). \] Suppose from the set of all square invariant quadratic polynomials we choose one at random. The probability that the roots of the chosen polynomial are equal is ___________. (rounded off to one decimal place)
Given that the quadratic polynomial satisfies the square invariance property: \[ (x - \alpha)(x - \beta) = (x - \alpha^2)(x - \beta^2). \] Expanding both sides, we get: \[ x^2 - (\alpha + \beta)x + \alpha\beta = x^2 - (\alpha^2 + \beta^2)x + \alpha^2\beta^2. \] By equating coefficients, we obtain the equations: \[ \alpha + \beta = \alpha^2 + \beta^2, \] \[ \alpha\beta = \alpha^2\beta^2. \] Step 1: Solving for equal roots For equal roots, we assume \( \alpha = \beta \). Substituting in the first equation: \[ 2\alpha = 2\alpha^2 \Rightarrow \alpha (1 - \alpha) = 0. \] Thus, \( \alpha = 0 \) or \( \alpha = 1 \).
Step 2: Probability Calculation Among all possible values of \( \alpha, \beta \) satisfying the quadratic constraints, half of them lead to equal roots. Therefore, the required probability is: \[ \frac{1}{2} = 0.5. \]
P and Q play chess frequently against each other. Of these matches, P has won 80% of the matches, drawn 15% of the matches, and lost 5% of the matches.
If they play 3 more matches, what is the probability of P winning exactly 2 of these 3 matches?
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative
According to the map shown in the figure, which one of the following statements is correct?
Note: The figure shown is representative.
A disk of size 512M bytes is divided into blocks of 64K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block reserves 4 bytes to store the pointer to the next data block. The link part of the last data block contains a NULL pointer (also of 4 bytes). Suppose a file of 1M bytes needs to be stored in the disk. Assume, 1K = \(2^{10}\) and 1M = \(2^{20}\). The amount of space in bytes that will be wasted due to internal fragmentation is ___________. (Answer in integer)