Question
Let z be those complex numbers which satisfy | z + 5 | 4 and z(1 + i) + (1 i) 10, i = . If the maximum value of | z + 1 | 2 is + \beta$$$$\sqrt 2 , then the value of ( + ) is ____________.
Answer: 1
Solution
Key Concepts and Formulas
- Complex Number Representation: , , where .
- Modulus of a Complex Number: . Geometrically, represents the distance between and in the complex plane.
- Euler's Formula (not directly used, but helpful for complex number manipulation): .
Step-by-Step Solution
Step 1: Convert the first inequality into Cartesian form
- Objective: Rewrite in terms of and .
- Method: Substitute and into the inequality and simplify. Thus, the inequality becomes:
- Explanation: This inequality represents the region below the line in the Cartesian plane.
Step 2: Interpret the second inequality geometrically
- Objective: Understand the region defined by .
- Method: Recognize that represents the distance between and in the complex plane.
- Explanation: represents a closed disk centered at (or ) with a radius of . The equation of the circle is .
Step 3: Find the feasible region
- Objective: Determine the region in the complex plane that satisfies both inequalities.
- Method: The feasible region is the intersection of the disk and the region . The line passes through the center of the circle since . Thus, the feasible region is a semi-disk.
- Explanation: The line cuts the circle exactly in half.
Step 4: Express the quantity to be maximized in Cartesian form
- Objective: Rewrite in terms of and .
- Method: Substitute into the expression.
- Explanation: We want to maximize within the feasible region. Geometrically, this is the square of the distance between the point and the point .
Step 5: Maximize within the feasible region
- Objective: Find the point within the semi-disk that maximizes .
- Method: The point lies on the circle , since . Since the feasible region is a semi-disk defined by , we need to find the point on the semi-disk farthest from . The farthest point will lie on the boundary of the semi-disk, specifically on the line or the arc of the circle.
- Explanation: The point diametrically opposite to on the circle is . However, this point does not lie within the feasible region defined by , since . Therefore, the maximizing point must lie on the line segment defined by that forms the diameter of the semi-disk.
Step 6: Find the intersection points of the line and the circle
- Objective: Determine the endpoints of the diameter of the semi-disk.
- Method: Substitute into the equation of the circle : Then, . So, the intersection points are and .
- Explanation: These two points are the endpoints of the diameter of the semi-disk.
Step 7: Calculate at the intersection points
- Objective: Evaluate at the two intersection points.
- Method: Calculate for each point: For : For :
- Explanation: We choose the larger value as the maximum.
Step 8: Determine the maximum value and calculate
- Objective: Find the maximum value of and calculate .
- Method: The maximum value is . Therefore, and .
- Explanation: The problem asks for the sum of the coefficients.
Common Mistakes & Tips
- Incorrectly solving for the intersection of the circle and the line: Be careful with the signs and algebra when substituting and solving.
- Forgetting to check the feasible region: Always verify that your candidate points lie within the defined region. The diametrically opposite point was outside the feasible region, making the line intersection points the candidates.
- Misinterpreting the geometric meaning of the modulus: Remember that represents the distance between and in the complex plane.
Summary
The problem involves finding the maximum value of subject to two constraints on the complex number . By converting the complex inequalities to Cartesian form, we identified the feasible region as a semi-disk. The maximum distance from to a point in the semi-disk occurs at one of the endpoints of the diameter, and by calculating at these two points, we determined the maximum value to be . Thus, and , and .
Final Answer
The final answer is \boxed{48}.