On consecutive primitive \(n\)th roots of unity modulo \(q\) (Q503742): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 06:20, 30 January 2024

scientific article
Language Label Description Also known as
English
On consecutive primitive \(n\)th roots of unity modulo \(q\)
scientific article

    Statements

    On consecutive primitive \(n\)th roots of unity modulo \(q\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    The authors give conditions under which a finite field of prime order \(q\) has adjacent elements (i.e of form \(\alpha\) and \(\alpha+1\)) of multiplicative order \(n\in{\mathbb N}\). Properties of the \(n\)th cyclotomic polynomial \(\Phi_n(x)\) imply that such an \(\alpha\) exists if and only if \(\Phi_n(x)\) and \(\Phi_n(x+1)\) over \({\mathbb Q}\) share a root in the algebraic closure of \({\mathbb Z}_q\). This observation reduces the problem to study the resultant \(\Gamma_n\) of \(\Phi_n(x)\) and \(\Phi_n(x+1)\). Moreover \(\Phi_n(x)\) splits in \({\mathbb Z}_q[x]\) if and only if \(q\equiv 1 \pmod n\) what reduces the problem to find prime divisors of \(\Gamma_n\) which are \(\equiv 1 \pmod{n}\). The authors prove the existence of such divisors for all \(n\neq 1,2,3,6\). They also give an upper bound on the size and quantity of these divisors. In the course of their study Lucas and Mersenne divisors of \(\Gamma_n\) are exhibited.
    0 references
    0 references
    finite fields
    0 references
    cyclotomic polynomial
    0 references
    resultant
    0 references
    Lucas numbers
    0 references
    Mersenne numbers
    0 references