Home
Class 12
MATHS
Suppose A is a complex number and n in ...

Suppose `A` is a complex number and `n in N ,` such that `A^n=(A+1)^n=1,` then the least value of `n` is `3` b. `6` c. `9` d. `12`

A

`3`

B

`6`

C

`9`

D

`12`

Text Solution

Verified by Experts

The correct Answer is:
B

`(b)` Let `A=x+iy`,
`A^(n)=(A+1)^(n)=1`
`implies|A|=1`
`implies x^(2)+y^(2)=1` ………`(i)`
And `|A+1|=1`
`implies(x+1)^(2)+y^(2)=1` …………`(ii)`
`impliesx=-(1)/(2)` and `y=+-(sqrt(3))/(2)`
`impliesA=omega` or `omega^(2)`
`implies (omega)^(n)=(1+omega)^(n)=(-omega^(2))^(n)`
`impliesn` must be even and divisible by `3`.
`implies` Least value of `n` is `6`
Promotional Banner

Topper's Solved these Questions

  • COMPLEX NUMBERS

    CENGAGE PUBLICATION|Exercise Multiple Correct Answer|11 Videos
  • COMPLEX NUMBERS

    CENGAGE PUBLICATION|Exercise Matching Column|1 Videos
  • CIRCLES

    CENGAGE PUBLICATION|Exercise Comprehension Type|8 Videos
  • CONIC SECTIONS

    CENGAGE PUBLICATION|Exercise All Questions|102 Videos

Similar Questions

Explore conceptually related problems

If (i)^-n =1(ninN) ,then least value of n will be

If S denotes the sum to infinity and S_n the sum of n terms of the series 1+1/2+1/4+1/8+ , such that S-S_n<1/(1000), then the least value of n is 8 b. 9 c. 10 d. 11

If "^(2n+1)P_(n-1):^(2n-1)P_n=3:5, then find the value of n .

Twos ets A and B are such that n(A)=3 nad n(B)=6 find the least value as well as the greatest values of n(Acup B)

If (a^(n)+b^n)/ (a^(n-1) +b^(n-1)) is the A.M. between a and b, then find the value of n.

If (a^n+b^n)/(a^(n-1)+b^(n-1)) is the A.M. between a and b, then find the value of n.

If in the expansion of (x^(3)-(2)/(sqrt(x)))^(n) a term like x^(2) exists and 'n' is a double digit number, then least value of 'n' is (a) 10 (b) 11 (c) 12 (d) 13

If (a^(n+1)+b^(n+1))/(a^n+b^n) is the A.M between a and b then find the value of n.

Find the least value of n for which 1+3+3^2+ .... +3^(n-1) gt 1000 .

If cot^(-1)n/pi>pi/6,n in N , then the maximum value of n is (a) 6 (b) 7 (c) 5 (d) none of these