MedVision ad

DMT (de moive's theorem) q. (1 Viewer)

astj

New Member
Joined
Aug 6, 2023
Messages
13
Gender
Female
HSC
2024
IMG_F0A08878246D-1.jpeg
I've converted 1+i and 1-i into mod-arg form and subbed the n in but I don't know how to get the RHS as well as part ii. Thanks in advance
 

cossine

Well-Known Member
Joined
Jul 24, 2020
Messages
628
Gender
Male
HSC
2017
View attachment 42144
I've converted 1+i and 1-i into mod-arg form and subbed the n in but I don't know how to get the RHS as well as part ii. Thanks in advance
I think what is going on they are applying binomial theorem.

Basically you should try expand (1+i)^n and (1-i)^n.

I will need to double check to make sure.
 

WeiWeiMan

Well-Known Member
Joined
Aug 7, 2023
Messages
1,021
Location
behind you
Gender
Male
HSC
2026
View attachment 42144
I've converted 1+i and 1-i into mod-arg form and subbed the n in but I don't know how to get the RHS as well as part ii. Thanks in advance
1+i=√2cisπ/4
1-i = √2cis(-π/4)

(√2cisπ/4)^n+(√2cis(-π/4))^n

= √2^n (cis(nπ/4)+cis(-nπ/4))

=2(√2)^n cos(nπ/4) QED as req blah blah blah

for part ii do as cossine said (use binomial expansion) and see what happens
 

astj

New Member
Joined
Aug 6, 2023
Messages
13
Gender
Female
HSC
2024
1+i=√2cisπ/4
1-i = √2cis(-π/4)

(√2cisπ/4)^n+(√2cis(-π/4))^n

= √2^n (cis(nπ/4)+cis(-nπ/4))

=2(√2)^n cos(nπ/4) QED as req blah blah blah

for part ii do as cossine said (use binomial expansion) and see what happens
okk cool thanks, how would you do part ii then?
 

Lith_30

o_o
Joined
Jun 27, 2021
Messages
158
Location
somewhere
Gender
Male
HSC
2022
Uni Grad
2025
part ii)
The question states that we should use the result from part i. Lets use the statement that n is divisible by 4, that is we suppose that .
Then we put that into the result from part i, convert it back into terms of n, .

Now the LHS of that question contains a bunch of n choose expressions, which suggests binomial expansion, so we will expand
which simplifies to

now equating these two new expressions gives us the answer.
 

Users Who Are Viewing This Thread (Users: 0, Guests: 1)

Top