Suppose w^3 = 1 and k is a positive integer

i) Find two possible values of 1 + w^k + w^2k

I have no idea where to begin? Please give me some hints.

Printable View

- August 28th 2010, 08:48 PMLukybearRoots of Unity
Suppose w^3 = 1 and k is a positive integer

i) Find two possible values of 1 + w^k + w^2k

I have no idea where to begin? Please give me some hints. - August 28th 2010, 08:52 PMundefined
Suppose k is a multiple of 3. Then 2k is also a multiple of 3. So 1 + w^k + w^(2k) = 3.

Suppose k gives remainder 1 when divided by 3. Then 2k gives remainder 2 when divided by 3.

Suppose k gives remainder 2 when divided by 3. Then 2k gives remainder 1 when divided by 3.

In either of the two latter cases you get 1 + w + w^2. - August 28th 2010, 08:53 PMProve It

So or

or

.

So the three solutions are

. - August 28th 2010, 10:38 PMLukybear
Thanks for quick reply. Just got a question with the concept of this. If k gives a remainder of 4, that is equivalent to k giving a remainder of 1 right? Also, how was it acquired that if k gives remainder of 1, then 2k gives a remainder of 3 and vice versa.

Thanks really much. - August 28th 2010, 11:22 PMundefined
- August 29th 2010, 02:32 PMHallsofIvy
k

**can't**"give a remainder of 4" when divided by 3. The "remainder" when dividing by the integer n must be less than n.

Quote:

If you get a "remainder of 4" then you have divided incorrectly- increase your divisor by 1 and you will get a remainder of 1. Also, how was it acquired that if k gives remainder of 1, then 2k gives a remainder of 3 and vice versa.

Thanks really much.

If "2, divided by 3, gives a remaider of 2" we can write k= 3m+ 2 for some integer m. Then 2k= 2(3m+2)= 6m+ 4= 6m+ 3+ 1= 3(6m+1)+ 1.