This is the problem:
=
it is given that n must be >=2
I tried to solve things by ofcourse using and that sorting and calculating to see what will I get but I just cant get anything usseful,so if u have some ideas please reply.
This is the problem:
=
it is given that n must be >=2
I tried to solve things by ofcourse using and that sorting and calculating to see what will I get but I just cant get anything usseful,so if u have some ideas please reply.
Thank you for trying to help.Your answer on my previous question was great.And yes,mathematical inuduction could probably help here,too.I've tried to solve it with different aproach,by trying to make some combinations of geometrical rows,but that didnt really help. I'l try again so if I come up with something i will post.
You want to know where I find these problems?Ask my teacher
Let me just say something about your first post.
The relationship is not entirely correct. Let me explain, we define where for as a real number such as . Now we can prove that such a real number always exists and is unique.
Now the problem with defining is that the complex-numbers have no sense of positive or negative. Mathematically we say that they lack ordering thus we cannot define what it means a positive complex or negative complex number as in the first paragraph.
The first thing you have to do is show that:Originally Posted by mahadeva
,
for . We can do this by induction, starting from
,
I will leave the rest of the induction for this result to the reader.
Now the main problem:
=
is true for . Now if it is true for some :
= .
The RHS of this may be rewritten using our earlier result:
= ,
Hence the identity to be proven is true for , which is sufficient to complete the induction.
RonL