Animated Solution for Mathematics - Complex Numbers: Let P={z∈C:∣z+2−3i∣≤1} and Q={z∈C:z(1+i)+zˉ(1−i)≤−8}. Let in P∩Q, ∣z−3+2i∣ be maximum and minimum at z1 and z2 respectively. If ∣z1∣2+2∣z2∣2=α+β2, where α,β are integers, then α+β equals
Enter Numerical Value:
Visualized Solution
Region P
Region P={z∈C:∣z+2−3i∣≤1}
This represents a closed disk with:
Center C=(−2,3)
Radius R=1
Region Q
Region Q:z(1+i)+zˉ(1−i)≤−8
Let z=x+iy, then (x+iy)(1+i)+(x−iy)(1−i)≤−8
Expanding: (x−y+i(x+y))+(x−y−i(x+y))≤−8
2x−2y≤−8⟹x−y+4≤0
This is a half-plane bounded by the line L2:y=x+4.
P∩Q
Intersection P∩Q is the segment of the disk where y≥x+4.
Distance from C(−2,3) to x−y+4=0 is d=12+(−1)2∣−2−3+4∣=21≈0.707.
Since d<R, the line cuts the circle.
Target Point A
Objective: Max/Min distance from z to A(3,−2).
Let f(z)=∣z−(3−2i)∣.
Point A=(3,−2) lies outside the disk P.
Line of Symmetry L1
Max/min distances occur along the line joining C and A.
Slope of AC: m=3−(−2)−2−3=−1.
Equation of L1: y−3=−1(x+2)⟹x+y−1=0.
Notice L1⊥L2 (slopes −1 and 1).
Maximum Distance Point z1
z1 is the furthest point in P∩Q from A.
It lies on the circle boundary, opposite to A along L1.
Vector CA=(5,−5), so direction away from A is (−1,1).
Unit vector u^=(−21,21).
Coordinates of z1
z1=C+R⋅u^
z1=(−2,3)+1⋅(−21,21)
z1=(−2−21,3+21)
Minimum Distance Point z2
z2 is the closest point in P∩Q to A.
Since L1⊥L2, z2 is the intersection of L1 and L2.
Solve: x+y=1 and x−y=−4.
Coordinates of z2
Adding equations: 2x=−3⟹x=−23.
Substitute x: y=1−(−23)=25.
z2=(−23,25).
Calculate ∣z1∣2
∣z1∣2=(−2−21)2+(3+21)2
=(4+21+22)+(9+21+32)
=14+52
Calculate ∣z2∣2
∣z2∣2=(−23)2+(25)2
=49+425
=434=217
Final Answer
∣z1∣2+2∣z2∣2=(14+52)+2(217)
=31+52
Compare with α+β2⟹α=31,β=5.
α+β=36.
00:00 / 00:00
The Sigma Insight: Geometrical Applications of Complex Numbers
Solution Diagram
Analyzing the Geometry of Complex Numbers
Welcome, fellow traveler of the complex plane! Today, we are not just solving an equation; we are mapping a landscape. We have two regions, P and Q, and we are hunting for the extreme points of distance within their intersection.
Region P is defined by ∣z+2−3i∣≤1. In the language of geometry, this is a closed disk with center C(−2,3) and radius R=1. Think of this as a solid, circular coin resting on the complex plane.
Now, let us decode region Q, defined by z(1+i)+zˉ(1−i)≤−8. Substituting z=x+iy, the expression becomes:
(x+iy)(1+i)+(x−iy)(1−i)≤−8
When we expand this, the imaginary parts i(x+y) and −i(x+y) vanish, leaving us with 2x−2y≤−8, or simply y≥x+4. This is a half-plane bounded by the line L2:y=x+4.
Our feasible region, P∩Q, is the portion of the disk that lies above this line. To see how they interact, we calculate the distance from the center C(−2,3) to the line x−y+4=0:
d=12+(−1)2∣−2−3+4∣=21≈0.707
Since 0.707<1, the line L2 slices through our disk, creating a circular segment.
The Quest for Extremes
Symmetry and Perpendicularity
Our target is to find the maximum and minimum distances from a fixed point A(3,−2) to any point z in our shaded region. First, we draw the line of symmetry L1 passing through C(−2,3) and A(3,−2).
The slope of L1 is m=3−(−2)−2−3=−1. The equation of this line is y−3=−1(x+2), which simplifies to x+y−1=0.
Here is the magic: the slope of L2 is 1, and the slope of L1 is −1. Their product is −1, meaning L1⊥L2. This perpendicularity is our golden key.
For the minimum distance point z2, we look for the intersection of L1 and L2. Solving x+y=1 and x−y=−4 simultaneously, we add the equations to get 2x=−3, so x=−23.
For the maximum distance point z1, we move from the center C along L1 in the direction away from A. The vector CA=(5,−5), so the unit vector pointing away from A is (−21,21). Adding this to C(−2,3), we get z1=(−2−21,3+21).
The Final Calculation
Bringing it Home
We have our points. Now, we calculate their squared magnitudes. For z1: