Re: cos(PI/N)




JohnCreighton_@xxxxxxxxxxx wrote:
> > 2*cos(pi/n)
> > =exp(i*pi/n)+exp(-i*pi/n)
> > =exp(i*pi)^(1/n)+exp(-i*pi)^(1/n)
> > = (-1)^(1/n) + (-1)^(1/n)
>
> Hmmm.....Thinking about what this means the first root in the sum
> should be the root with the smallest angle greater then zero. I think
> this would be called the principle root and the root chosen for the
> second term in the sum should be the complex conjugate of the root
> chosen in the first term in the sum. So the answer should be written
> as:
> 2*cos(pi/n)=principle nth root of (-1) + conjugate of the principle nth
> root of (-1)
>
> So basically we are saying if we have a complex vector in polar form
> exp(-i*pi/n), then the cosine is the real part of this. Well, Duh
> (slaps self on forehead). Although the result is obvious it is useful
> for computer algebra systems which wish to reduce the number of
> functions that the use to represent a mathematical expression. The
> advantage of this is it reduces the function space simplification
> routines need to search though. It however does not seem useful as a
> method of computing the cosine.
>
> Perhaps the original poster had in mind and answer based on trig
> identities of cosines with known radical solutions.
>
After some more thought if we want to obtain an expression that is easy
to compute we can recognize that the problem reduces to finding roots
of negative one. If we want these roots in rectangular form we can
write:
(x+i*y)^n=-1
Before we solve this we recognize that all the roots lie in a circle.
If n is odd then
(x=-1, y=0 is a solution and if n is even {x=0, y=1} {x=0,y=-1} are two
solutions solution). Notice also that:

x=-1, y=0 is the solution for n=1 and {x=0, y=1} {x=0,y=-1} are the
solutions for n=2. After the equation is expanded and rearranged so
p(x)=0 these solutions can be divided out. Remember we are in search of
the solution with the smallest angle. From the algebra done so far it
appears that the solution for the smallest angles can be found by
dividing the solution out for the largest angel, and then doing the
same for the remaining polynomial until we are left with a polynomial
that can be factored using the quadratic formula. I'll give this some
more thought.

.



Relevant Pages

  • Re: counting divisors/submultisets
    ... be found, and perhaps that prior study of sum Cover arithmetic ... with the generating function. ... Let w be a primitive cube root of 1. ...
    (sci.math)
  • Re: Fortran vs Python - Newbie Question
    ... crunching" involves anything beyond linear systems, run, don't walk, to ... the foibles of numerical computation, ... square root, then do the sum and the difference of the square root with ... either the sum or the difference will be a difference between two ...
    (comp.lang.python)
  • Re: Numerical for you ....from vectors
    ... other when placed tail to tail.Prove,by taking components along two ... Say that the vector c is the sum of a and b. ... To simplify the computation we can look at the square of the magnitude of c so we do not have to carry on any square root until the final answer. ...
    (sci.math)
  • Re: Help with equation
    ... how do you simplify that by taking the log of both sides? ... to me like you have a sum there on the right side, ... minus 30th root of ... take the positive root, because then you get a number that makes the ...
    (comp.sys.hp48)
  • Re: Angle Trisection
    ... Angle trisection: ... ... Then does angle bisection require taking the square root of an ... ray intersects the circle at "an arbitrary complex number with absolute ... perpendicular to this through 0 to represent the imaginary axis. ...
    (sci.math)

Loading