On the constant term of the minimal polynomial of cos (2π/n) over Q | Zendy

Chandrashekar Adiga | Zendy; İsmail Naci Cangül | Zendy; H. N. Ramaswamy | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the constant term of the minimal polynomial of cos (2π/n) over Q

Author(s) -

Chandrashekar Adiga,

İsmail Naci Cangül,

H. N. Ramaswamy

Publication year - 2016

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil1604097a

Subject(s) - mathematics , term (time) , constant (computer programming) , polynomial , rational number , algebraic number , combinatorics , discrete mathematics , mathematical analysis , physics , quantum mechanics , computer science , programming language

The algebraic numbers cos(2π/n) and 2cos(π/n) play an important role in the theory of discrete groups and has many applications because of their relation with Chebycheff polynomials. There are some partial results in literature for the minimal polynomial of the latter number over rationals until 2012 when a complete solution was given in [5]. In this paper we determine the constant term of the minimal polynomial of cos(2π/n) over Q by a new method

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research