Question
If , (m, n N) then the greatest common divisor of the least values of m and n is _______ .
Answer: 1
Solution
Key Concepts and Formulas
- Complex Conjugate: The complex conjugate of is . Multiplying a complex number by its conjugate results in a real number: .
- Powers of i: The powers of the imaginary unit cycle through four values: , , , . Thus, if and only if is a multiple of 4, i.e., for some integer .
- Greatest Common Divisor (GCD): The largest positive integer that divides two or more integers without a remainder.
Step-by-Step Solution
Step 1: Simplify the Base Expression
We simplify the expression by multiplying the numerator and denominator by the complex conjugate of the denominator, which is . This eliminates the imaginary part from the denominator.
Expanding the numerator and denominator:
- Numerator:
- Denominator:
Substituting back into the fraction:
Why this step? Simplifying the base is crucial for making the problem tractable. It transforms a complex fraction into the simple imaginary unit, .
Step 2: Substitute the Simplified Base into the Original Equation
Now that we have , we substitute this into the given equation:
becomes
Why this step? This substitution simplifies the problem, allowing us to focus on the exponents of .
Step 3: Solve for the Least Values of m and n
Since if and only if is a multiple of 4, we require and to be multiples of 4.
For : We have , where is a positive integer (since ). Solving for :
To find the least value of , we take :
For : We have , where is a positive integer. Solving for :
To find the least value of , we take :
Why this step? This step uses the cyclical property of to establish the conditions for and . Finding the least values ensures we satisfy the problem's constraints.
Step 4: Calculate the Greatest Common Divisor (GCD)
We need to find the GCD of the least values of and , which are 8 and 12, respectively.
Listing the divisors:
- Divisors of 8: {1, 2, 4, 8}
- Divisors of 12: {1, 2, 3, 4, 6, 12}
The greatest common divisor is 4.
Alternatively, using prime factorization:
The GCD is the product of the lowest powers of their common prime factors: .
Why this step? This is the final calculation required by the problem statement.
Common Mistakes & Tips
- Tip: Memorize the simplification and to save time.
- Mistake: Forgetting that and are natural numbers, so the constants and must be positive integers (not zero).
- Mistake: Confusing the powers of . Remember , not .
Summary
We simplified the complex fraction to , then used the property that when is a multiple of 4 to find the least values of and . We found and , and then calculated their greatest common divisor, which is 4.
The final answer is .