Skip to main content
Back to Complex Numbers
JEE Main 2020
Complex Numbers
Complex Numbers
Medium

Question

If α\alpha is a root of the equation x2+x+1=0x^2+x+1=0 and \sum_\limits{\mathrm{k}=1}^{\mathrm{n}}\left(\alpha^{\mathrm{k}}+\frac{1}{\alpha^{\mathrm{k}}}\right)^2=20, then n is equal to _________.

Answer: 1

Solution

Key Concepts and Formulas

  • Roots of x2+x+1=0x^2 + x + 1 = 0 are ω\omega and ω2\omega^2, where ω\omega is a complex cube root of unity.
  • Properties of ω\omega: ω3=1\omega^3 = 1 and 1+ω+ω2=01 + \omega + \omega^2 = 0.
  • 1ω=ω2\frac{1}{\omega} = \omega^2 and 1ω2=ω\frac{1}{\omega^2} = \omega. In general, 1ωk=ω2k\frac{1}{\omega^k} = \omega^{2k}.

Step-by-Step Solution

Step 1: Identify α\alpha and its properties

Since α\alpha is a root of x2+x+1=0x^2 + x + 1 = 0, we know that α=ω\alpha = \omega or α=ω2\alpha = \omega^2. Without loss of generality, let's assume α=ω\alpha = \omega. The properties ω3=1\omega^3 = 1 and 1+ω+ω2=01 + \omega + \omega^2 = 0 will be crucial.

Step 2: Simplify the general term

We want to simplify (αk+1αk)2\left(\alpha^k + \frac{1}{\alpha^k}\right)^2. Substituting α=ω\alpha = \omega, we have: (ωk+1ωk)2\left(\omega^k + \frac{1}{\omega^k}\right)^2 Using the property 1ωk=ω2k\frac{1}{\omega^k} = \omega^{2k}, we get: (ωk+ω2k)2(\omega^k + \omega^{2k})^2

Step 3: Analyze cases based on k(mod3)k \pmod 3

We need to consider the value of the expression based on the remainder when kk is divided by 3, because ω3=1\omega^3 = 1.

  • Case 1: k0(mod3)k \equiv 0 \pmod 3 If kk is a multiple of 3, then k=3mk = 3m for some integer mm. Thus, ωk=ω3m=(ω3)m=1m=1\omega^k = \omega^{3m} = (\omega^3)^m = 1^m = 1 and ω2k=ω6m=(ω3)2m=12m=1\omega^{2k} = \omega^{6m} = (\omega^3)^{2m} = 1^{2m} = 1. Therefore, (ωk+ω2k)2=(1+1)2=22=4(\omega^k + \omega^{2k})^2 = (1 + 1)^2 = 2^2 = 4

  • Case 2: k≢0(mod3)k \not\equiv 0 \pmod 3 If kk is not a multiple of 3, then k1(mod3)k \equiv 1 \pmod 3 or k2(mod3)k \equiv 2 \pmod 3. If k1(mod3)k \equiv 1 \pmod 3, then ωk=ω\omega^k = \omega and ω2k=ω2\omega^{2k} = \omega^2. If k2(mod3)k \equiv 2 \pmod 3, then ωk=ω2\omega^k = \omega^2 and ω2k=ω4=ω\omega^{2k} = \omega^4 = \omega. In either case, ωk+ω2k=ω+ω2=1\omega^k + \omega^{2k} = \omega + \omega^2 = -1 (since 1+ω+ω2=01 + \omega + \omega^2 = 0). Therefore, (ωk+ω2k)2=(1)2=1(\omega^k + \omega^{2k})^2 = (-1)^2 = 1

Step 4: Evaluate the summation

We are given k=1n(αk+1αk)2=20\sum_{k=1}^n \left(\alpha^k + \frac{1}{\alpha^k}\right)^2 = 20. We know that the term is 4 when kk is a multiple of 3, and 1 otherwise. Let's write out the first few terms:

  • k=1k=1: (ω1+1ω1)2=1\left(\omega^1 + \frac{1}{\omega^1}\right)^2 = 1
  • k=2k=2: (ω2+1ω2)2=1\left(\omega^2 + \frac{1}{\omega^2}\right)^2 = 1
  • k=3k=3: (ω3+1ω3)2=4\left(\omega^3 + \frac{1}{\omega^3}\right)^2 = 4
  • k=4k=4: (ω4+1ω4)2=1\left(\omega^4 + \frac{1}{\omega^4}\right)^2 = 1
  • k=5k=5: (ω5+1ω5)2=1\left(\omega^5 + \frac{1}{\omega^5}\right)^2 = 1
  • k=6k=6: (ω6+1ω6)2=4\left(\omega^6 + \frac{1}{\omega^6}\right)^2 = 4

The pattern is 1,1,4,1,1,4,1, 1, 4, 1, 1, 4, \dots. The sum of each cycle of 3 terms is 1+1+4=61 + 1 + 4 = 6.

We want the sum to be 20.

  • 3×6=183 \times 6 = 18. So, the first 9 terms sum to 18.
  • We need 2 more to reach 20. The 10th term is 1 and the 11th term is 1.
  • 18+1+1=2018 + 1 + 1 = 20.

Therefore, the sum reaches 20 when n=11n=11.

Common Mistakes & Tips

  • Forgetting the properties of ω\omega: The properties ω3=1\omega^3 = 1 and 1+ω+ω2=01 + \omega + \omega^2 = 0 are essential.
  • Incorrectly simplifying 1ωk\frac{1}{\omega^k}: Remember that 1ωk=ω2k\frac{1}{\omega^k} = \omega^{2k}.
  • Not recognizing the pattern: The terms repeat in a cycle of 3, making the summation easier to evaluate.

Summary

By recognizing that α\alpha is a cube root of unity, simplifying the general term based on the properties of ω\omega, and identifying the repeating pattern in the summation, we found that n=11n=11.

The final answer is \boxed{11}.

Practice More Complex Numbers Questions

View All Questions