cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A327921 Irregular triangle T read by rows: row n gives the values determining the zeros of the minimal polynomial ps(n, x) of 2*sin(Pi/n) (coefficients in A228786), for n >= 1.

Original entry on oeis.org

1, 0, 1, 5, 1, 3, 1, 3, 7, 9, 1, 1, 3, 5, 9, 11, 13, 1, 3, 5, 7, 1, 5, 7, 11, 13, 17, 1, 2, 1, 3, 5, 7, 9, 13, 15, 17, 19, 21, 1, 5, 7, 11, 1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25, 1, 3, 5, 1, 7, 11, 13, 17, 19, 23, 29, 1, 3, 5, 7, 9, 11, 13, 15
Offset: 1

Views

Author

Wolfdieter Lang, Nov 02 2019

Keywords

Comments

The minimal polynomials of the algebraic number s(n) = 2*sin(Pi/n) of degree gamma(n) = A055035(n) = A093819(2*n) has the zeros 2*cos(2*Pi*T(n,m)/c(2*n)), with c(2*n) = A178182(2*n), for m = 1, 2, ..., gamma(n) and n >= 1.
The number s(n) is the length ratio side(n)/R of the regular n-gon inscribed in a circle of radius R.
The motivation to look at these zeros came from the book of Carl Schick, and the paper by Brändli and Beyne. There, only length ratios diagonals/R in 2*(2*m + 1)-gons, for m >= 1, are considered.
If one is interested in length ratios diagonals/side then the minimal polynomials of rho(n) := 2*cos(Pi/n) (smallest diagonal/side) are important. These are given in A187360, called there C(n, x).

Examples

			The irregular triangle T(n,m) begins:
   n\m   1 2  3  4  5  6  7  8  9 10 11 12 ...      A178182(2*n)  A055035(n)
   -------------------------------------------------------------------------
   1:    1                                                4            1
   2:    0                                                1            1
   3:    1 5                                             12            2
   4:    1 3                                              8            2
   5:    1 3  7  9                                       20            4
   6:    1                                                6            1
   7:    1 3  5  9 11 13                                 28            6
   8:    1 3  5  7                                       16            4
   9:    1 5  7 11 13 17                                 36            6
  10:    1 2                                              5            2
  11:    1 3  5  7  9 13 15 17 19 21                     44           10
  12:    1 5  7 11                                       24            4
  13:    1 3  5  7  9 11 15 17 19 21 23 25               52           12
  14:    1 3  5                                          14            3
  15:    1 7 11 13 17 19 23 29                           60            8
  16:    1 3  5  7  9 11 13 15                           32            8
  ...
--------------------------------------------------------------------------
Some zeros are:
n = 1:  2*cos(2*Pi*1/4) = 0 = s(1),
n = 2:  2*cos(2*Pi*1/4) = 2 = s(2) (diameter/R),
n = 3:  2*cos(2*Pi*1/12) = -2*cos(2*Pi*5/12) = sqrt(3) = s(3),
n = 5:  2*cos(2*Pi*1/20) = -2*cos(2*Pi*9/20) = sqrt(2 + tau),
        2*cos(2*Pi*3/20) = -2*cos(2*Pi*7/20) = sqrt(tau - 3) = s(5),
with the golden ratio tau = A001622,
n = 10: 2*cos(2*Pi*1/5) = tau - 1 = s(10),  -2*cos(2*Pi*2/5) = -tau.
--------------------------------------------------------------------------
		

References

  • Carl Schick, Trigonometrie und unterhaltsame Zahlentheorie, ISBN 3-9522917-0-6, Bobos Druck, Zürich, 2003.

Crossrefs

Formula

Row n gives the first gamma(n) = A055035(n) members of RRS(c(2*n)), for n >= 1, where RRS(k) is the smallest nonnegative restricted residue system modulo k.
The numbers with odd c(2*n) are n = 2 + 8*k, k >= 0.
The zeros x0^{(n)}_m := 2*cos(2*Pi*T(n,m)/c(2*n)) can be written as polynomials of rho(n) := 2*cos(Pi/n) for even n, and as polynomials of rho(2*n) for odd n as follows. x0^{(n)}_m = R(t*T(n,m), rho(b*n)), with b = 1 or 2 for n even or odd, respectively, and t = 1 for n == 1 (mod 2) and 0 (mod 4), t = 2 and 4 for n == 6 and 2 (mod 8), respectively. Here the monic Chebyshev T polynomials R(n, x) enter, with coefficients given in A127672. This results from 2*n/c(2*n) = 4, 2, 1, 1/2 for n == 2, 6 (mod 8), 0 (mod 4), 1 (mod 2), respectively. Note that rho(n)^2 = 4 - s(n)^2.
In terms of s(n) = 2*sin(Pi/n) the zeros x0^{(n)}_m are written with Chebyshev S (A049310) and R polynomials (A127672) as follows.
x0^{(n)}_m = sqrt(4 - s(b*n)^2) * {S((T(n,m)-1)/2, -R(2, s(bn))) - S((T(n,m)-3)/2, -R(2, s(b*n)))}, for n == 1 (mod 2) with b(n) = 2, and for n == 0 (mod 4) with b = 1,
x0^{(n)}_m = (2 - s(n)^2) * {S((T(n,m)-1)/2, R(4, s(n))) - S((T(n,m)-3)/2, R(4, s(n)))}, for n == 6 (mod 8), and
x0^{(n)}_m = R(T(n,m), R(4, sqrt(4 - s(n)^2))), for n == 2 (mod 8).

A055035 Degree of minimal polynomial of sin(Pi/n) over the rationals.

Original entry on oeis.org

1, 1, 2, 2, 4, 1, 6, 4, 6, 2, 10, 4, 12, 3, 8, 8, 16, 3, 18, 8, 12, 5, 22, 8, 20, 6, 18, 12, 28, 4, 30, 16, 20, 8, 24, 12, 36, 9, 24, 16, 40, 6, 42, 20, 24, 11, 46, 16, 42, 10, 32, 24, 52, 9, 40, 24, 36, 14, 58, 16, 60, 15, 36, 32, 48, 10, 66, 32, 44, 12, 70, 24, 72
Offset: 1

Views

Author

Shawn Cokus (Cokus(AT)math.washington.edu)

Keywords

Comments

Also degree of minimal polynomial of function F(n)=(gamma(1/n)*gamma((n-1)/n))/Pi over the rationals. Roots of minimal polynomials of F(n) belonging to algebraic extension of sin(n/Pi) and vice versa (e.g. gamma(1/11)*gamma(10/11)/Pi = 20*sin(Pi/11) - 112*sin(Pi/11)^3 + 256*sin(Pi/11)^5 - 256*sin(Pi/11)^7 + (1024*sin(Pi/11)^9)/11). - Artur Jasinski, Oct 17 2011
The algebraic numbers sin(Pi/(2*l)) are given in A228783 in the power basis of the number field Q(2*cos(Pi/(2*l))) if n is even and of Q(2*cos(Pi/l)) if l is odd. In A228785, sin(Pi/(2*l+1)) is given in the power basis of Q(2*cos(Pi/(2*(2*l+1)))) (only odd powers appear). The minimal polynomials for 2*sin(Pi/n), n>=1, are given in A228786. - Wolfdieter Lang, Oct 10 2013

Crossrefs

Cf. A000010, A228786 (row length), A093819.

Programs

  • Mathematica
    a[n_] := If[n==2, 1, EulerPhi[n]/{1, 1, 2, 1}[[Mod[n, 4]+1]]]; Table[a[n], {n, 80}]
    a[n_] := Exponent[ MinimalPolynomial[Sin[Pi/n]][x], x]; Array[a, 75] (* Robert G. Wilson v, Jul 28 2014 *)

Formula

a(1)=1, a(2)=1, a(n)=phi(n)/(1, 1, 2, 1 for n=0, 1, 2, 3 mod 4) for n>2, where phi is Euler's totient, A000010
a(n) = A093819(2*n), n >= 1.- Wolfdieter Lang, Oct 29 2019

A178182 Minimal polynomials of sin(2Pi/n) are mapped to those of cos(2Pi/a(n)).

Original entry on oeis.org

4, 4, 12, 1, 20, 12, 28, 8, 36, 20, 44, 6, 52, 28, 60, 16, 68, 36, 76, 5, 84, 44, 92, 24, 100, 52, 108, 14, 116, 60, 124, 32, 132, 68, 140, 9, 148, 76, 156, 40, 164, 84, 172, 22, 180, 92, 188, 48, 196, 100, 204, 13, 212, 108, 220, 56, 228, 116, 236, 30, 244, 124, 252, 64, 260, 132, 268, 17, 276, 140, 284, 72, 292, 148, 300, 38, 308, 156, 316, 80
Offset: 1

Views

Author

Wolfdieter Lang, Jan 11 2011

Keywords

Comments

The minimal polynomials of cos(2*Pi/n) are treated, e.g. in the Lehmer, Niven and Watkins-Zeitlin references. Lehmer and Niven call them psi_n(x) (eq. (1) and Lemma 3.8, p.37, respectively). In the latter reference they are called Psi_n(x), and we call them Psi(n,x). By definition (Niven, p. 28) these are monic, rational polynomials which have as a root cos(2*Pi/n) and are of minimal degree. They are irreducible (Niven p. 37, Lemma 3.8). See also A181875 for more details and a link with Psi(n,x), n=1..30.
The minimal polynomials of sin(2*Pi/n) are treated, e.g. in the Lehmer and Niven references. Lehmer's theorem 2 is, however, incorrect. See A181872 and the link there for a counterexample. In this link one can also find these polynomials, called Pi(n,x), for n=1..30.
The sequence a(n) translates these polynomials: Pi(n,x) = Psi(a(n),x), n >= 1. This translation is based on the trigonometric identity: sin(2*Pi/n) = cos(2*Pi*r(n)), with r(n):=|(4-n)/(4*n)|.
a(n):=denominator(r(n)) (in lowest terms). Note that the degrees agree with those given in the Niven reference, Theorem 3.9, p. 37.

Examples

			Pi(5,x) = Psi(20,x) because sin(2*Pi/5) = cos(2*Pi/20).
		

References

  • I. Niven, Irrational Numbers, The Math. Assoc. of America, second printing, 1963, distributed by John Wiley and Sons.

Crossrefs

Programs

Formula

a(n) = denominator(|(n-4)/(4*n)|), n >= 1.
a(n) = 4*n/gcd(n-4,16). a(n) = 4*n if n is odd; if n is even then a(n) = 2*n if n/2 == 1, 3, 5, 7 (mod 8), a(n) = n if n/2 == 0, 4 (mod 8), a(n) = n/2 if n/2 == 6 (mod 8) and a(n) = n/4 if n/2 == 2 (mod 8). - Wolfdieter Lang, Dec 01 2013
a(2*n)/(2*n) = 1/4, 1/2, 1, and 2, for n == 2 (mod 8), 6 (mod 8), 0 (mod 4), and 1 (mod 2), for n >= 1. The reciprocal can be used in a formula for the zeros of the minimal polynomials of 2*sin(Pi/2) (A228786). See A327921. - Wolfdieter Lang, Nov 02 2019

A228785 Table of coefficients of the algebraic number s(2*l+1) = 2*sin(Pi/(2*l+1)) as a polynomial in odd powers of rho(2*(2*l+1)) = 2*cos(Pi/(2*(2*l+1))) (reduced version).

Original entry on oeis.org

1, -3, 1, 5, -5, 1, -4, 5, -1, 9, -30, 27, -9, 1, -11, 55, -77, 44, -11, 1, 4, -13, 7, -1, -15, 140, -378, 450, -275, 90, -15, 1, 17, -204, 714, -1122, 935, -442, 119, -17, 1, -4, 25, -26, 9, -1, 0, 21, -385, 2079, -5148, 7007, -5733, 2940, -952, 189, -21, 1, -8, 126, -539, 967, -870, 429, -118, 17, -1, 0
Offset: 1

Views

Author

Wolfdieter Lang, Oct 07 2013

Keywords

Comments

In the regular (2*l+1)-gon, l >= 1, inscribed in a circle of radius R the length ratio side/R is s(2*l+1) = 2*sin(Pi/(2*l+1)). This can be written as a polynomial in the length ratio (smallest diagonal)/side in the (2*(2*l+1))-gon given by rho(2*(2*l+1)) = 2*cos(Pi/(2*(2*l+1))). This leads, in a first step, to the signed triangle A111125. Because of the minimal polynomial of the algebraic number rho(2*(2*l+1)) of degree delta(2*(2*l+1)) = A055034(2*(2*l+1)), called C(2*(2*l+1),x) (with coefficients given in A187360), one can eliminate all powers rho(2*(2*l+1))^k with k >= delta(2*(2*l+1)) by using C(2*(2*l+1),rho(2*(2*l+1))) = 0. This leads to the present table expressing s(2*(l+1)) in terms of odd powers of rho(2*(2*l+1)) with maximal exponent delta(2*(2*l+1))-1.
This table gives the coefficients of s(2*l+1), related to the (2*l+1)-gon, in the power basis of the algebraic number field Q(rho(2*(2*l+1))) of degree delta(2*(2*l+1)), related to rho from the (2*(2*l+1))-gon, provided one inserts zeros for the even powers, starting each row with a zero and filling zeros at the end in order to obtain the row length delta(2*(2*l+1)). Note that some trailing zeros in the present table (e.g., row l = 10) have been given such that the row length for the s(2*l+1) coefficients in the power basis Q(rho(2*(2*l+1))) becomes just twice the one of this table.
Thanks go to Seppo Mustonen for telling me about his findings regarding the square of the sum of all length in the regular n-gon, which led me to consider this entry (even though for odd n this is not needed because only s(2*l+1)^2 = 4 - rho(2*l+1)^2 enters).

Examples

			The table a(l,m), with n = 2*l+1, begins:
n,   l \m  0    1     2     3    4     5    6    7   8   9 10
3,   1:    1
5,   2:   -3    1
7,   3:    5   -5     1
9,   4:   -4    5    -1
11,  5:    9  -30    27    -9    1
13,  6:  -11   55   -77    44  -11     1
15,  7:    4  -13     7    -1
17,  8:  -15  140  -378   450 -275    90  -15    1
19,  9:   17 -204   714 -1122  935  -442  119  -17   1
21, 10:   -4   25   -26     9   -1     0
23, 11:   21 -385  2079 -5148 7007 -5733 2940 -952 189 -21  1
25, 12:   -8  126  -539   967 -870   429 -118   17  -1   0
27, 13:    4  -41    70   -43   11    -1    0    0   0
...
n = 29 l =  14:  -27, 819, -7371, 30888, -72930, 107406, -104652, 69768, -32319, 10395, -2277, 324, -27, 1.
n = 5, l=2: s(5) = -3*rho(10) + rho(10)^3 = (tau - 1)*sqrt(2 + tau), approximately 1.175570504, where tau = (1 + sqrt(5))/2 (golden section).
n = 17, l = 8: s(17) = -15*x + 140*x^3 - 378*x^5 + 450*x^7 - 275*x^9 + 90*x^11 - 15*x^13 + 1*x^15, with x = rho(34) = 2*cos(Pi/34). s(17) is approximately 0.3674990356. With the length row l = 8 the degree of the algebraic number s(17) = 2*sin(Pi/17) is therefore 2*8 = 16. See A228787 for the decimal expansion of s(17) and A228788 for the one of rho(34).
		

Crossrefs

Cf. A055034, A187360, A228783 (even n case), A228786 (minimal polynomials).

Formula

a(l,m) = [x^(2*m+1)](s(2*l+1,x)(mod C(2*(2l+1),x))), with s(2*l+1,x) = sum((-1)^(l-1-s)* A111125(l1,s)*x^(2*s+1), s=0..l-1), l >= 1, m=0, ..., (delta(2*(2*l+1))/2 - 1), with delta(n) = A055034(n).
Rows 9,15,21,27 are coefficients of polynomials in reciprocal powers of u for rows n=2,4,6,8 generated by the o.g.f. (u-4)/(u-ux+x^2) of A267633. These polynomials in u occur in a moving average of the polynomials of A140882 interlaced with these polynomials. - Tom Copeland, Jan 16 2016

A228783 Table of coefficients of the algebraic number s(2*l) = 2*sin(Pi/2*l) as a polynomial in powers of rho(2*l) = 2*cos(Pi/(2*l)) if l is even and of rho(l) = 2*cos(Pi/l) if l is odd (reduced version).

Original entry on oeis.org

2, 0, 1, 1, 0, -3, 0, 1, -1, 1, 0, 4, 0, -1, -1, -1, 1, 0, -7, 0, 14, 0, -7, 0, 1, 2, 1, -1, 0, 8, 0, -18, 0, 8, 0, -1, 1, 2, -3, -1, 1, 0, -8, 0, 6, 0, -1, 0, 0, -1, 3, 3, -4, -1, 1, 0, 12, 0, -67, 0, 96, 0, -52, 0, 12, 0, -1, -2, 3, 1, -1, 0, -15, 0, 140, 0, -378, 0, 450, 0, -275, 0, 90, 0, -15, 0, 1
Offset: 1

Views

Author

Wolfdieter Lang, Oct 06 2013

Keywords

Comments

In the regular (2*l)-gon inscribed in a circle of radius R the length ratio side/R is s(2*l) = 2*sin(Pi/(2*l)). This can be written as a polynomial in the length ratio (smallest diagonal)/side given by rho(2*l) = 2*cos(Pi/(2*l)). (For the 2-gon there is no such diagonal and rho(2) = 0). This leads, in a first step, to the triangle A127672 (see the Oct 05 2013 comment there referring also to the bisections signed A111125 and A127677). Because the minimal polynomial of the algebraic number rho(2*l) of degree delta(2*l) = A055034(2*l), called C(2*l,x) (with coefficients given in A187360) one can eliminate all powers rho(2*l)^k with k >= delta(2*l) by using C(2*l,rho(2*l)) = 0. Furthermore, because for odd l only even powers of rho(2*l) appear, but rho(2*l)^2 = 2 + rho(l), one will obtain a reduced table for s(2*l) with powers rho(2*l)^(2*k+1), k= 0, ..., (delta(2*l)-2)/2 if l is even, and with powers rho(l)^m, m=0, ... , delta(l)-1 if l is odd.
This leads to a reduction of the triangle A127672, when applied for the s(2*l) computation, giving the present table with row length delta(4*L) = A055034(4*L) = phi(8*L)/2 if l =2*L, if L >= 1, and phi(2*L+1)/2 = A055035(4*L+2), if l = 2*L + 1, L >= 1, where phi(n) = A000010(n) (Euler totient).
This table gives the coefficients of s(2*l) in the power basis of the algebraic number field Q(rho(2*l)) of degree delta(2*l) = A055034(2*l) if l is even, and in Q(rho(l)) of degree delta(2*l)/2 if l is odd. s(2) and s(6) are rational integers of degree 1.
Thanks go to Seppo Mustonen whose question about the square of the sum of all length in a regular n-gon, led me to this computation.
If l = 2*L+1, L >= 0, that is n == 2 (mod 4), one can obtain s(2*l) more directly in powers of rho(l) by s(2*l) = R(l-1, rho(l)) (mod C(l,rho(l))), with the monic (except for l=1) Chebyshev T-polynomials, called R, in A127672, and the C polynomials from A187360. - Wolfdieter Lang, Oct 10 2013

Examples

			The table a(l,m), with n = 2*l, begins:
n,  l \m  0   1   2    3   4   5   6    7   8   9  10  11 ...
2   1:    2
4   2:    0   1
6   3:    1
8   4:    0  -3   0    1
10  5:   -1   1
12  6:    0   4   0   -1
14  7:   -1  -1   1
16  8:    0  -7   0   14   0  -7   0    1
18  9:    2   1  -1
20 10:    0   8   0  -18   0   8   0   -1
22 11:    1   2  -3   -1   1
24 12:    0  -8   0    6   0  -1   0    0
26 13:   -1   3   3   -4  -1   1
28 14:    0  12   0  -67   0  96   0  -52  0  12  0  -1
30 15:   -2   3   1   -1
...
n = 8, l = 4:  s(8)  = -3*rho(8) + rho(8)^3 = -3*sqrt(2 + sqrt(2)) + (sqrt(2 + sqrt(2)))^3 = (sqrt(2) - 1)*sqrt(2 + sqrt(2)).
n = 10, l = 5:  s(10) =  -1 + rho(5), where rho(5) = tau = (1 + sqrt(5))/2, the golden section.
		

Crossrefs

Cf. A127672, A111125, A127677, A055034, A187360, A228785 (odd n case), A228786 (minimal polynomials).

Formula

a(2*L,m) = [x^m](s(4*L,x)(mod C(4*L,x))), with s(4*L,x) = sum((-1)^(L-1-s)*A111125(L-1,s)*x^(2*s+1),s=0..L-1), L >= 1, m =0, ..., delta(4*L)-1, and
a(2*L+1,m) = [x^m](s(4*L+2,x)(mod C(2*L+1,x))), with s(4*L+2,x) = sum(A127677(L,s)*(2+x)^(L-s)),s=0..L) (with s(2,x) = 2 for L = 0), L >= 0, m = 0, ..., delta(4*L+2)/2, with delta(n) = A055034(2*l).
Showing 1-5 of 5 results.