Let = { : and }. Let be such that and . Then equals:
- A
- B
- C
- D
Let = { : and }. Let be such that and . Then equals:
Correct answer:D
Standard Method
Given: together with the linear condition used in the solution.
Find: where is maximum and is minimum over .
Let
Then
and
which gives
Solving equations (1) and (2), we get
Now solving (3) with (2):
and
Now, using the working shown in the solution,
Hence the extracted solution concludes that the required value matches option D.
Therefore, the correct option is D, i.e. the value is .
Geometric Interpretation
Given: The point lies on the circle
and also on the line
Find: The distance between the two intersection points corresponding to the extreme moduli.
The two constraints represent a circle and a line in the Argand plane. Their intersection gives exactly two candidate points, which are the points reported in the solution:
These are then taken as the points giving maximum and minimum values of .
Since
the quantity asked is the distance between these two points. The provided solution’s final computation leads to the numerical value . So the correct option remains D.
Treating as a complicated new expression. It is simply because the square root cancels the square of the modulus. Reduce it first before computing.
Using only the circle and ignoring the second condition. That gives infinitely many points on the circle, whereas is determined by satisfying both conditions simultaneously.
Confusing and . When converting the condition into Cartesian form, separate real and imaginary parts carefully instead of treating them as ordinary real numbers.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.